|
| 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
| ASCII Text | x | ||
| 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, February, 1985. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1985.1676557, author = {B.P. Sinha and B.B. Bhattacharya}, title = {On the Numerical Complexity of Short-Circuit Faults in Logic Networks}, journal ={IEEE Transactions on Computers}, volume = {34}, number = {2}, issn = {0018-9340}, year = {1985}, pages = {186-190}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1985.1676557}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - On the Numerical Complexity of Short-Circuit Faults in Logic Networks IS - 2 SN - 0018-9340 SP186 EP190 EPD - 186-190 A1 - B.P. Sinha, A1 - B.B. Bhattacharya, PY - 1985 KW - Stirling numbers KW - Bell numbers KW - bridging faults KW - Fibonacci numbers KW - logic networks KW - short-circuit faults VL - 34 JA - IEEE Transactions on Computers ER - | |||
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.