This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
J.A. Abraham, Digital Systems Laboratory, Stanford University
A combinatorial procedure is given to calculate the reliability of an interwoven redundant logic network to any desired degree of accuracy. The procedure consists of enumerating combinations of gate failure which are tolerated by the redundant network, and is explained with reference to a quadded logic network. Since the exact reliability calculation might be too time consuming for large networks, a formula is given for a lower bound which can be used in conjunction with the exact method to give a very accurate reliability figure with a comparatively small computation time.
Index Terms:
Fault pattern enumeration, interwoven redundant logic, quadded logic, reliability analysis
Citation:
J.A. Abraham, "A Combinatorial Solution to the Reliability of Interwoven Redundant Logic Networks," IEEE Transactions on Computers, vol. 24, no. 5, pp. 578-584, May 1975, doi:10.1109/T-C.1975.224265
Usage of this product signifies your acceptance of the Terms of Use.