On the Existence of Combinational Logic Circuits Exhibiting Multiple Redundancy

1 December 1978

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers

Vol. C-27 (12) , 1221-1225
https://doi.org/10.1109/tc.1978.1675032

Abstract

Multiple redundancy is a very complex form of redundancy about which little is known. This correspondence shows by construction that redundancy of any multiplicity can exist in an arbitrary combinational circuit, and that redundancy of any multiplicity ≥ 4 can exist in a tree circuit. Many examples are given. The correspondence concludes with a discussion of the effect multiple redundancy can have on multiple fault testing. It is shown that with a proper algorithm multiple redundancy can actually cause fewer problems than single redundancy does when single fault testing is being considered.

Keywords

This publication has 8 references indexed in Scilit:

Fault Masking in Combinational Logic Circuits
IEEE Transactions on Computers, 1975
The Boolean Difference and Multiple Fault Analysis
IEEE Transactions on Computers, 1975
Redundancy Testing in Combinational Networks
IEEE Transactions on Computers, 1974
Minimal Fault Tests for Combinational Networks
IEEE Transactions on Computers, 1974
Detection of Multiple Faults in Combinational Logic Networks
IEEE Transactions on Computers, 1972
Multiple Fault Detection in Combinational Networks
IEEE Transactions on Computers, 1972
Cause-Effect Analysis for Multiple Fault Detection in Combinational Networks
IEEE Transactions on Computers, 1971
Fault Detection in Redundant Circuits
IEEE Transactions on Electronic Computers, 1967