Daniel L. Ostapko, June Hong Se
IEEE TC
A simple procedure to produce a minimum length test set for a parity network is presented. If is the largest fan in of any EX-OR gate element in the tree, 2M test patterns are chosen by considering only 2M test sequences, of length 2M, assigned to each signal line. Copyright © 1981 by The Institute of Electrical and Electronics Engineers, Inc.
Daniel L. Ostapko, June Hong Se
IEEE TC
Ravi Nair, Se June Hong, et al.
DAC 1982
Se June Hong, Ravi Nair
Proceedings of the IEEE
Se June Hong, Sholom M. Weiss
Pattern Recognition Letters