Easily Testable Realizations ror Logic Functions | IEEE Journals & Magazine | IEEE Xplore

Easily Testable Realizations ror Logic Functions


Abstract:

Desirable properties of "easily testable networks" are given. A realization for arbitrary logic function, using AND and EXCLUSIVE-OR gates, based on Reed-Muller canonic e...Show More

Abstract:

Desirable properties of "easily testable networks" are given. A realization for arbitrary logic function, using AND and EXCLUSIVE-OR gates, based on Reed-Muller canonic expansion is given that has many of these desirable properties. If only permanent stuck-at-0 (s-a-0) or stuck-at-1 (s-a-1) faults occur in a single AND gate or only a single EXCLUSIVE-OR gate is faulty, the following results are derived on fault detecting test sets for the proposed networks: 1) only (n/4) tests, independent of the function being realized, are required if the primary inputs are fault-free; 2) only 2n, additional inputs (which depend on the function realized) are required if the primary inputs can be faulty, where n, is the number of variables appearing in even number of product terms in the Reed-Muller canonical expansion of the function; and 3) the additional 2ne inputs are not required if the network is provided with an observable point at the output of an extra AND gate.
Published in: IEEE Transactions on Computers ( Volume: C-21, Issue: 11, November 1972)
Page(s): 1183 - 1188
Date of Publication: 14 August 2006

ISSN Information:


Contact IEEE to Subscribe

References

References is not available for this document.