AN ALGORITHM FOR SIMULATING POWER GROUND NETWORKS USING PADE APPROXIMANTS AND ITS SYMBOLIC IMPLEMENTATION/

Citation
Jc. Shah et al., AN ALGORITHM FOR SIMULATING POWER GROUND NETWORKS USING PADE APPROXIMANTS AND ITS SYMBOLIC IMPLEMENTATION/, IEEE transactions on circuits and systems. 2, Analog and digital signal processing, 45(10), 1998, pp. 1372-1382
Citations number
36
Categorie Soggetti
Engineering, Eletrical & Electronic
ISSN journal
10577130
Volume
45
Issue
10
Year of publication
1998
Pages
1372 - 1382
Database
ISI
SICI code
1057-7130(1998)45:10<1372:AAFSPG>2.0.ZU;2-I
Abstract
This paper presents an event-driven algorithm and its symbolic impleme ntation for the analysis of power and ground (P/G) bus networks. The a lgorithm uses frequency-domain techniques and moment matching approach es based on Fade approximants to estimate the transfer function at eac h node in the P/G network, Afterwards, the transient waveforms are ext racted for each node. The process requires repetitive simulation of a linear and time-variant (from one time event to the next) circuit mode l for the P/G network which is the reason a symbolic implementation wa s produced. The P/G network is modeled by a hierarchical combination o f mesh and tree structures that are composed of a collection of RC-pi- segments and pulldown (or pullup) switches. The snitches are symbolica lly represented by Boolean variables and a compiled symbolic code is g enerated only once for each P/G network. The transient waveforms are t hen produced by repetitive evaluation of the symbolic output. The resu lts show that the symbolic implementation is an order of magnitude fas ter, with reasonably good accuracy, than using a traditional analog ci rcuit simulator like SPICE.