By Topic

On the Numerical Complexity of Short-Circuit Faults in Logic Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Sinha, B.P. ; Electronics Unit, Indian Statistical Institute ; Bhattacharya, B.B.

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.

Published in:

Computers, IEEE Transactions on  (Volume:C-34 ,  Issue: 2 )