Sciweavers

ICCAD
2003
IEEE

Branch Merge Reduction of RLCM Networks

14 years 9 months ago
Branch Merge Reduction of RLCM Networks
— In this paper we consider the problem of finding a smaller RLCM circuit that approximately replicates the behavior (up to a certain frequency) of a given RLCM circuit. Targeted at parasitic extractors for verification of VLSI designs, the proposed algorithm uses a branch merge, node elimination methodology, with the choice of nodes for elimination being guided by time-constant criteria. Reliable, accurate, easy to code, the algorithm works well for coupled buses and clocks, strongly inductive networks, and low-loss transmission lines, as well as for lossy RLC networks.
Bernard N. Sheehan
Added 16 Mar 2010
Updated 16 Mar 2010
Type Conference
Year 2003
Where ICCAD
Authors Bernard N. Sheehan
Comments (0)