ACM Home Page
Please provide us with feedback. Feedback
Realizable parasitic reduction using generalized Y-Δ transformation
Full text PdfPdf (394 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 40th annual Design Automation Conference table of contents
Anaheim, CA, USA
SESSION: Model order reduction table of contents
Pages: 220 - 225  
Year of Publication: 2003
ISBN:1-58113-688-9
Authors
Zhanhai Qin  Synopsys, Inc., Sunnyvale CA
Chung-Kuan Cheng  Univ. of California, San Diego, CA
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 31,   Citation Count: 8
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/775832.775890
What is a DOI?

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
 
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
 
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

Collaborative Colleagues:
Zhanhai Qin: colleagues
Chung-Kuan Cheng: colleagues