Redundancy Testing in Combinational Networks
Authors:
- E.S. DavidsonEDE.S. Davidson
- 1 October 1974
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-23 (10) , 1029-1047
Abstract
A simple, necessary and sufficient test is developed for testing whether a single connection in a tree-type NAND network is redundant. A procedure is presented for testing every connection in the network. The computational complexity of the procedure is mi2 where m = the number of gates and i = the average number of inputs per gate in the network.Keywords
This publication has 5 references indexed in Scilit:
- A Transform for NAND Network DesignIEEE Transactions on Computers, 1972
- A Nand Model ror Fault Diagnosis in Combinational Logic NetworksIEEE Transactions on Computers, 1971
- The Minimization of TANT NetworksIEEE Transactions on Electronic Computers, 1967
- Backtrack ProgrammingJournal of the ACM, 1965
- The Use of Triple-Modular Redundancy to Improve Computer ReliabilityIBM Journal of Research and Development, 1962