Easily Testable Realizations ror Logic Functions
- 1 November 1972
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-21 (11) , 1183-1188
- https://doi.org/10.1109/t-c.1972.223475
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.Keywords
This publication has 4 references indexed in Scilit:
- Easily Testable Two-Dimensional Cellular Logic ArraysIEEE Transactions on Computers, 1974
- Minimization of Exclusive or and Logical Equivalence Switching CircuitsIEEE Transactions on Computers, 1970
- Fault Detection in Redundant CircuitsIEEE Transactions on Electronic Computers, 1967
- Application of Boolean algebra to switching circuit design and to error detectionTransactions of the I.R.E. Professional Group on Electronic Computers, 1954