ACM Home Page
Please provide us with feedback. Feedback
Generic sub-space algorithm for generating reduced order models of linear time varying vlsi circuits
Full text PdfPdf (531 KB)
Source
Great Lakes Symposium on VLSI archive
Proceedings of the 18th ACM Great Lakes symposium on VLSI table of contents
Orlando, Florida, USA
POSTER SESSION: Poster session 1 table of contents
Pages 111-114  
Year of Publication: 2008
ISBN:978-1-59593-999-9
Authors
Jayanthi Ravindra  International Institute of Information Technology (IIIT), Hyderabad, India
Mandalika Srinivas  International Institute of Information Technology (IIIT), Hyderabad, India
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 20,   Citation Count: 0
Additional Information:

abstract   references   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/1366110.1366138
What is a DOI?

ABSTRACT

We present an algorithm for reducing large VLSI circuits to much smaller ones with similar input-output behavior. A key feature of our method, called generic subspace, is that it is capable of reducing linear time-varying systems. This enables it to capture frequency-translation and sampling behavior, important in communication subsystems such as mixers, RF components and switched-capacitor filters. Reduction is obtained by projecting the original system described by linear differential equations into subspace of a lower dimension. Experiments have been carried out using Cadence Design Simulator which indicates that the proposed sub-space technique achieves more % reduction with less CPU time than the other model order reduction techniques existing in literature. We also present applications to RF circuit subsystems, obtaining size reductions and evaluation speedups of orders of magnitude with insignificant loss of accuracy.


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
L. T. Pillage et.al, "Asymptotic waveform evaluation for timing analysis," IEEE TCAD, vol. 9, pp. 352--366, Apr. 1990.
 
2
E. Chiprout et.al, "Analysis of interconnect networks using complex frequency hopping (CFH)," IEEE TCAD, vol. 14, pp. 186--200, Feb. 1995.
 
3
J. E. Bracken et.al "Interconnect simulation with asymptotic waveform evaluation (AWE)," IEEE TCAS, vol. 39, pp. 869--878, Nov. 1992.
 
4
 
5
 
6
Q. Yu, et.al "Multipoint multiport algorithm for passive reduced-order model of interconnect networks," in Proc. ISCAS, vol. 6, Sept. 1998, pp. 74--77.
 
7
Pavan, et.al, "Simulation of High-Speed Distributed Interconnects Using Krylov-Space Techniques" IEEE TCAD, Vol. 19, No. 7, pp. 799--808, July 2000.
8
 
9
J. R. Phillips, "Projection-based approaches for model reduction of weakly nonlinear, time-varying systems," IEEE TCAD, vol. 22, pp. 171--187, Feb. 2003.
 
10
 
11
L. Zadeh, "Frequency Analysis of Variable Networks", IRE Proc., vol. 38, pp. 291--299, 1950.
 
12
H. D''angelo, LTV Systems: Analysis and Synthesis, Allyn and Bacon, Boston, MA, 1970.
 
13
 
14
I.M. Jaimoukha, et.al, "Numerical solution of large scale Lyapunov equations using Krylov subspace methods", in Proc. of the 31st Conf. on Deci. and Cont., Arizona, December 1992, pp. 1927--1932.
15
 
16
Wai-Shing Lukl et.al "Waveform Krylov subspace Methods for Tightly Coupled Systems? in Proc. of ISCAS" 1996, pp. 536--539.
 
17
Guoyong Shi, et.al, "On Symbolic Model Order Reduction", IEEE TCAD, Vol. 25, No. 7, pp. 1257--1272, July 2006.

Collaborative Colleagues:
Jayanthi Ravindra: colleagues
Mandalika Srinivas: colleagues