Logo image
Applications of tree/link partitioning for moment computations of general lumped R(L)C interconnect networks with multiple resistor loops
Journal article   Peer reviewed

Applications of tree/link partitioning for moment computations of general lumped R(L)C interconnect networks with multiple resistor loops

Herng-Jer Lee, Ming-Hong Lai, Chia-Chi Chu and Wu-Shiung Feng
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol.E87-A(12), pp.3281-3292
12/2004

Abstract

Moment computations Reduced ordered binary decision diagram Resistor loop Tree/link partition
A new moment computation technique for general lumped R(L)C interconnect circuits with multiple resistor loops is proposed. Using the concept of tearing, a lumped R(L)C network can be partitioned into a spanning tree and several resistor links. The contributions of network moments from each tree and the corresponding links can be determined independently. By combining the conventional moment computation algorithms and the reduced ordered binary decision diagram (ROBDD), the proposed method can compute system moments efficiently. Experimental results have demonstrate that the proposed method can indeed obtain accurate moments and is more efficient than the conventional approach.

Metrics

1 Record Views

Details

Logo image