Easily Testable Cellular Realizations for the (Exactly P)-out-of n and (p or More)-out-of n Logic Functions
Issue No. 01 - January (1974 vol. 23)
S.M. Reddy , Department of Electrical Engineering, University of Iowa
Networks to realize all n-variable symmetric threshold functions and elementary symmetric functions are given. It is also shown that only 2n test inputs are necessary and sufficient to test any number of faults in these networks.
Easily testable networks, multiple faults, single faults, stuck-at-faults, symmetric functions, threshold functions.
J.R. Wilson, S.M. Reddy, "Easily Testable Cellular Realizations for the (Exactly P)-out-of n and (p or More)-out-of n Logic Functions", IEEE Transactions on Computers, vol. 23, no. , pp. 98-100, January 1974, doi:10.1109/T-C.1974.223787