Browsing by Author "Chen, CCP"

Now showing 1 - 2 of 2

HiPRIME: Hierarchical and passivity preserved interconnect macromodeling engine for RLKC power delivery
(2005-06-01)
Lee, YM
;
Cao, YH
;
Chen, TH
;
Wang, JML
;
Chen, CCP
This paper proposes a general hierarchical analysis methodology, HiPRIME, to efficiently analyze RLKC power delivery systems. After partitioning the circuits into blocks, we develop and apply the IEKS (Improved Extended Krylov Subspace) method to build the multiport Norton equivalent circuits which transform all the internal sources to Norton current sources at ports. Since there are no active elements inside the Norton circuits, passive or realizable model order reduction techniques such as PRIMA can be applied. The significant speed improvement, 700 times faster than Spice with less than 0.2% error and 7 times faster than a state-of-the-art solver, InductWise, is observed. To further reduce the top-level hierarchy runtime, we develop a second-level model reduction algorithm and prove its passivity.
The power grid transient simulation in linear time based on 3-D alternating-direction-implicit method
(2003-11-01)
Lee, YM
;
Chen, CCP
;
電子工程學系及電子研究所
;
Department of Electronics Engineering and Institute of Electronics
The rising power consumption and clock frequency of very large scale integration technology demand robust and stable power delivery. Extensive transient simulations on large-scale power delivery structures are required to analyze power delivery fluctuation caused by dynamic IR drop and Ldi/dt drop as well as package and on-chip resonance. In this paper, we develop a novel and efficient transient simulation algorithm for the power distribution networks. Our algorithm, three-dimensional (3-D) transmission-line-modeling alternating-direction-implicit (TLM-ADI) method, first models the power delivery structure as 3-D transmission line shunt-node structure and transfer those equations to the telegraph equation. Finally, we solve it by the alternating direction implicit method. The 3-D TLM-ADI method, with linear runtime and memory requirement, is also unconditionally stable, which ensures that the time steps are not limited by any stability requirement. Extensive numerical simulation results show that the proposed algorithm is not only over 300000 times faster than SPICE but also extremely memory saving and accurate.