An algorithm for simulating power/ground networks using Pade approximants and its symbolic implementation

TLDR: An event-driven algorithm and its symbolic implementation for the analysis of power and ground (P/G) bus networks and the results show that the symbolic implementation is an order of magnitude faster, with reasonably good accuracy, than using a traditional analog circuit simulator like SPICE.

Abstract: This paper presents an event-driven algorithm and its symbolic implementation for the analysis of power and ground (P/G) bus networks. The algorithm uses frequency-domain techniques and moment matching approaches based on Pade approximants to estimate the transfer function at each node in the P/G network. Afterwards, the transient waveforms are extracted for each node. The process requires repetitive simulation of a linear and time-variant (from one time event to the next) circuit model for the P/G network which is the reason a symbolic implementation was produced. The P/G network is modeled by a hierarchical combination of mesh and tree structures that are composed of a collection of RC-/spl pi/-segments and pulldown (or pullup) switches. The switches are symbolically represented by Boolean variables and a compiled symbolic code is generated only once for each P/G network. The transient waveforms are then produced by repetitive evaluation of the symbolic output. The results show that the symbolic implementation is an order of magnitude faster, with reasonably good accuracy, than using a traditional analog circuit simulator like SPICE.