This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Numerical Complexity of Short-Circuit Faults in Logic Networks
February 1985 (vol. 34 no. 2)
pp. 186-190
B.P. Sinha, Electronics Unit, Indian Statistical Institute
The problem of estimating the number of all possible multiple short circuit faults in a network with a given number of lines is settled in this correspondence. A new combinatorial number, namely an associated Bell number B'(r), which enumerates the number of possible partitions of a set {1, 2,???, r} with certain constraints, is introduced. This concept immediately resolves the counting problem of short-circuit or bridging faults in an electrical network. A related combinatorial problem is also discussed which shows that under some realistic model of circuit failure, the number of possible ways the network can malfunction is closely connected to the Fibonacci sequence.
Index Terms:
Stirling numbers, Bell numbers, bridging faults, Fibonacci numbers, logic networks, short-circuit faults
Citation:
B.P. Sinha, B.B. Bhattacharya, "On the Numerical Complexity of Short-Circuit Faults in Logic Networks," IEEE Transactions on Computers, vol. 34, no. 2, pp. 186-190, Feb. 1985, doi:10.1109/TC.1985.1676557
Usage of this product signifies your acceptance of the Terms of Use.