|
ABSTRACT
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.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
S. Lin, and E. S. Kuh, "transient simulation of lossy interconnects based on the recursive convolution formulation," IEEE Trans. on CAS I: Fundamental Theory and Applications, vol.39, pp.879--92, Nov. 1992.
|
 |
2
|
|
| |
3
|
Kevin J. Kerns , Ivan L. Wemple , Andrew T. Yang, Stable and efficient reduction of substrate model networks using congruence transforms, Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design, p.207-214, November 05-09, 1995, San Jose, California, United States
|
| |
4
|
A. Odabasioglu, M. Celik, L. T. Pillage, "PRIMA: passive reduced-order interconnect macromodeling algorithm," IEEE Trans. on CAD, vol.17, pp.645--54, Aug. 1998.
|
 |
5
|
|
| |
6
|
V. Raghavan , J. E. Bracken , R. A. Rohrer, AWESpice: a general tool for the accurate and efficient simulation of interconnect problems, Proceedings of the 29th ACM/IEEE conference on Design automation, p.87-92, June 08-12, 1992, Anaheim, California, United States
|
| |
7
|
|
| |
8
|
|
| |
9
|
S. Chan, "introductory topological analysis of electrical networks," Holt, Rinehart and Winston, Inc., 1974.
|
| |
10
|
Y. I. Ismail, E. G. Friedman, "DTT: direct truncation of the transfer function --- an alternative to moment matching for tree structured interconnect," IEEE Trans. on CAD, vol. 21, No. 2, Feb. 2002.
|
| |
11
|
S. B. Akers, Jr., "the use of wye-delta transformations in network simplification," Operations Research, 8, pp.311--23, 1960.
|
 |
12
|
|
| |
13
|
Z. Qin, C.K. Cheng, "linear network reduction via generalized Y-Δ transformation: theory," Technical Report, UCSD, CS2002-0706, 2002.
|
 |
14
|
|
| |
15
|
W. C. Yengst, "procedures of modern network synthesis," Macmillan, New York, 1964.
|
| |
16
|
R. J. Duffin, E. L. Peterson, C. Zener, "geometric programming: theory and application," John Wiley and Sons, New York, 1967.
|
CITED BY 8
|
|
Janet Wang , Prashant Saxena , Omar Hafiz , Xing Wang, Realizable parasitic reduction for distributed interconnects using matrix pencil technique, Proceedings of the 2004 conference on Asia South Pacific design automation: electronic design and solution fair, p.780-785, January 27-30, 2004, Yokohama, Japan
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|