Partial random walk for large linear network analysis

This paper proposes a new simulation algorithm for analyzing large power distribution networks, modelled as linear RLC circuits, based on a partial random walk concept. The random walk simulation method has been shown to be an efficient way to solve for a small number of nodes in a larger power distribution network by H.-F. Qian et al. (2003), but the algorithm becomes expensive to solve for nodes that are more than a few. We combine direct methods like LU factorization with the random walk concept to solve power distribution networks when a significant number of node waveforms is required. We also apply an equivalent circuit modelling method to speed up the direct simulation of subcircuits. Experimental results show that the resulting algorithm, called partial random walk (PRW), has significant advantages over the pure random walk method especially when the VDD/GND nodes are sparse and accuracy requirement is high.

[1]  Rajendran Panda,et al.  Hierarchical analysis of power distribution networks , 2002, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  Haifeng Qian,et al.  Random walks in a supply network , 2003, Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451).

[3]  Raminderpal Singh Simulation and Optimization of the Power Distribution Network in VLSI Circuits , 2002 .

[4]  Sachin S. Sapatnekar,et al.  Fast analysis and optimization of power/ground networks , 2000, IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140).

[5]  Sani R. Nassif,et al.  Multigrid-like technique for power grid analysis , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).

[6]  Charlie Chung-Ping Chen,et al.  Efficient large-scale power grid analysis based on preconditioned Krylov-subspace iterative methods , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).