Abstract
An efficient method for evaluating the terminal-pair reliability based on an edge expansion tree and using an OBDD (ordered binary decision diagram) is presented. The effectiveness of the algorithm is demonstrated on the larger benchmarks collected in previous work. One notable case of the experimental results for a 2 × 20 lattice network is that the number of nodes in the OBDD is linearly proportional to the number of stages. This is significantly superior to previous algorithms which are based on the sum of disjoint products and has exponential complexity.
Original language | English |
---|---|
Pages (from-to) | 759-760 |
Number of pages | 2 |
Journal | Electronics Letters |
Volume | 33 |
Issue number | 9 |
DOIs | |
State | Published - 24 04 1997 |
Externally published | Yes |
Keywords
- Reliability theory