Realizable parasitic reduction using generalized Y-Δ transformation

We propose a realizable RCLK-in-RCLK-out parasitic reduction technique. The method employs generalized Y-Δ transformation. In our method, admittances are kept in their original rational forms of s, and their orders are reduced by truncating high-order terms. Therefore reduced admittances match the low-order terms in exact admittances. First-order realization of admittances is guaranteed, and higher-order realization is achieved by template optimization using Geometric Programming. The algorithm uniquely uses common-factor identification and cancelation operations to make Y-Δ transformation numerically stable. The experiment shows that our method can achieve higher reduction ratio than TICER and comparable simulation results with PRIMA.

[1]  S. Akers.  The Use of Wye-Delta Transformations in Network Simplification , 1960 .

[2]  Andrew T. Yang,et al.  Stable and efficient reduction of substrate model networks using congruence transforms , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[3]  Haifang Liao,et al.  Partitioning and reduction of RC interconnect networks based on scattering parameter macromodels , 1995, ICCAD.

[4]  Bernard N. Sheehan,et al.  TICER: Realizable reduction of extracted RC circuits , 1999, 1999 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (Cat. No.99CH37051).

[5]  Shu-Park Chan,et al.  Introductory topological analysis of electrical networks , 1969 .

[6]  Yehea I. Ismail,et al.  DTT: direct truncation of the transfer function - an alternative tomoment matching for tree structured interconnect , 2002, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  Luís Miguel Silveira,et al.  Guaranteed passive balancing transformations for model order reduction , 2002, DAC '02.

[8]  Vivek Raghavan,et al.  AWESpice: a general tool for the accurate and efficient simulation of interconnect problems , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[9]  Chung-Kuan Cheng,et al.  RCLK-VJ network reduction with Hurwitz polynomial approximation , 2003, Proceedings of the ASP-DAC Asia and South Pacific Design Automation Conference, 2003..

[10]  Ernest S. Kuh,et al.  Transient simulation of lossy interconnects based on the recursive convolution formulation , 1992 .

[11]  Lawrence T. Pileggi,et al.  PRIMA: passive reduced-order interconnect macromodeling algorithm , 1997, ICCAD 1997.

[12]  William C. Yengst,et al.  Procedures of modern network synthesis , 1964 .

[13]  Roland W. Freund,et al.  Reduced-Order Modeling of Large Linear Subcircuits via a Block Lanczos Algorithm , 1995, 32nd Design Automation Conference.

[14]  Ernest S. Kuh,et al.  Transient simulation of lossy interconnect , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[15]  Haifang Liao,et al.  Partitioning and reduction of RC interconnect networks based on scattering parameter macromodels , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[16]  Clarence Zener,et al.  Geometric Programming : Theory and Application , 1967 .