Abstract
With soaring work frequency and decreasing feature sizes, VLSI circuits with RLC parasitic components are more like analog circuits and should be carefully analyzed in physical design. However, the number of extracted RLC components is typically too large to be analyzed efficiently by using present analog circuit simulators like SPICE. In order to speedup the simulations without error penalty, this paper proposes a novel methodology to compress the time-descritized circuits resulted from numerical integration approximation at every time step. The main contribution of the methodology is the efficient structure-level compression of DC circuits containing many current sources, which is an important complement to present circuit analysis theory. The methodology consists of the following parts: 1) An approach is proposed to delete all intermediate nodes of RL branches. 2) An efficient approach is proposed to compress and back-solve parallel and serial branches so that it is error-free and of linear complexity to analyze circuits of tree topology. 3) The Y to π transformation method is used to error-free reduce and back-solve the intermediate nodes of ladder circuits with the linear complexity. Thus, the whole simulation method is very accurate and of linear complexity to analyze circuits of chain topology. Based on the methodology, we propose several novel algorithms for efficiently solving RLC-model transient power/ground (P/G) networks. Among them, EQU-ADI algorithm of linear-complexity is proposed to solve RLC P/G networks with mesh-tree or mesh-chain topologies. Experimental results show that the proposed method is at least two orders of magnitude faster than SPICE while it can scale linearly in both time-and memory-complexity to solve very large P/G networks.
Similar content being viewed by others
References
Yang X D, Cheng C K, Ku W H, et al. Hurwitz stable reduced order modeling for RLC interconnect trees. IEEE Journal of Analog Integrated Circuits and Signal Processing, 2002, 31(3): 222–228
Qin Z, Cheng C K. RCLK-VJ network reduction with Hurwitz polynomial approximation. In: Proc IEEE Asia and South Pacific Design Automation Conf (ASPDAC), 03EX627. Piscataway: IEEE Press, 2003. 283–291
Tan X D. A general s-domain hierarchical network reduction algorithm. In: Proc IEEE/ACM Int Conf Computer Aided Design, 477033. New York: ACM Press, 2003. 650–657
Li X, Zeng X, Zhou D, et al. Behavioral modeling of analog circuits by wavelet collocation method. In: Proc IEEE/ACM Int Conf Computer Aided Design, 478010. New York: ACM Press, 2001. 65–69
Dharchoudhury A, Panda R, Blaauw D, et al. Design and analysis of power distribution networks in power PC microprocessors. In: Proc IEEE/ACM Design Automation Conf, 477980. New York: ACM Press, 1998. 738–743
Bai G, Bobba S, Hajj I N. Simulation and optimization of the power distribution network in VLSI circuits. In: Proc IEEE/ACM Int Conf Computer Aided Design, 477006. New York: ACM Press, 2000. 12: 481–486
Su H H, Gala K H, Sapatnekar S S. Fast analysis and optimization of power/ground networks. In: Proc IEEE/ACM Int Conf Computer Aided Design, 477006. New York: ACM Press, 2000. 477–482
Wang J M, Nguyen T V. Expended Krylov subspace method for reduced order analysis of linear circuits with multiple sources. In: Proc IEEE/ACM Design Automation Conf, 477000. New York: ACM Press, 2000. 247–252
Odabasioglu, Celik M, Pilleggi L T. PRIME: passive reduction-order interconnect macro-modeling algorithm. IEEE Trans Computer Aided Design, 1998, 17(8): 645–654
Cao Y, Lee Y, Chen T, et al. HiPRIME: hierarchical and passivity reserved interconnect macromodeling engine for RLKC power delivery. In: Proc IEEE/ACM Design Automation Conf, 477021. New York: ACM Press, 2002. 379–384
Zhao M, Panda R V, Sapatnekar S S, et al. Hierarchical analysis of power distribution networks. In: Proc IEEE/ACM Design Automation Conf, 477000. New York: ACM Press, 2000. 150–155
Chen T, Chen C C. Efficient large-scale power grid analysis based on preconditioned Krylov-subspace iterative method. In: Proc IEEE/ACM Design Automation Conf, 477011. New York: ACM Press. 2001. 559–562
Lee Y M, Chen C P. Power grid transient simulation in linear time based on transmission-line-modeling alternating direction implicit method. In: Proc IEEE/ACM Int Conf Computer Aided Design, 478010. New York: ACM Press, 2001. 75–80
Nassif S R, Kozhaya J N. Fast power grid simulation. In: Proc IEEE/ACM Design Automation Conf, 477000. New York: ACM Press, 2000. 156–161
Zhu Z, Yao B, Cheng C K. Power network analysis using an adaptive algebraic multigrid approach. In: Proc IEEE/ACM Int Conf Computer Aided Design, 477033. New York: ACM Press, 2003. 105–108
Su H H, Sani E A, Nassif R. Power grid reduction based on algebraic multigrid principles. In: Proc IEEE/ACM Design Automation Conf, 477031. New York: ACM Press, 2003. 109–112
Tan X D. Shi C J. Fast power-ground network optimization using equivalent circuit modeling. In: Proc IEEE/ACM Design Automation Conf, 477011. New York: ACM Press. 2001. 550–554
Qian H F, Nassif R, Sapatnekar S S. Random walks in a supply Network. In: Proc IEEE/ACM Design Automation Conf, 477031. New York: ACM Press, 2003. 93–98
Cai Y C, Pan Z, Luo Z Y, et al. Fast reduction and reconstruction strategy in analyzing power/ground network with mesh and tree structure. Journal of Computer Science and Technology, 2005, 20(2): 224–230
Pan Z, Cai Y C, Luo Z Y, et al. Transient analysis of on-chip power distribution networks using equivalent circuit modeling. In: Proc ACM Int Symposium On Quality Electronic Design, PR01881. Piscataway: IEEE Press, 2004. 63–68
Cai Y C, Pan Z, Luo Z Y, et al. Geometric multigrid based algorithm for transient RLC power/ground (P/G) grids analysis. Journal of Computer-Aided Design & Computer Graphics (In Chinese), 2005, 17(4): 33–38
Wang X Y, Luo Z Y, Tan X D, et al. EQUADI: A linear complexity algorithm on transient power/ground(P/G) network analysis for ASICs. In: Proc IEEE Int Conf on Solid-state Integrated Circuit Technology, 04EX863. Piscataway: IEEE Press, 2004. 1952–1955
Guan Y, Chen J L. Digital Computing Methodology (in Chinese). Beijing: Qinghua University Press, 1990. 245–246
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Luo, Z., Cai, Y., Tan, S.X.D. et al. Time-domain analysis methodology for large-scale RLC circuits and its applications. SCI CHINA SER F 49, 665–680 (2006). https://doi.org/10.1007/s11432-006-2022-6
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s11432-006-2022-6