ACM Home Page
Please provide us with feedback. Feedback
Model order reduction for strictly passive and causal distributed systems
Full text PdfPdf (176 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 39th annual Design Automation Conference table of contents
New Orleans, Louisiana, USA
SESSION: Passive model order reduction table of contents
Pages: 46 - 51  
Year of Publication: 2002
ISBN ~ ISSN:0738-100X , 1-58113-461-4
Authors
Luca Daniel  University of California, Berkeley
Joel Phillips  Cadence Berkeley Labs
Sponsor
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 21,   Citation Count: 2
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/513918.513932
What is a DOI?

ABSTRACT

This paper presents a class of algorithms suitable for model reduction of distributed systems. Distributed systems are not suitable for treatment by standard model-reduction algorithms such as PRIMA, PVL, and the Arnoldi schemes because they generate matrices that are dependent on frequency (or other parameters) and cannot be put in a lumped or state-space form. Our algorithms build on well-known projection-based reduction techniques, and so require only matrix-vector product operations and are thus suitable for operation in conjunction with electromagnetic analysis codes that use iterative solution methods and fast-multipole acceleration techniques. Under the condition that the starting systems satisfy system-theoretic properties required of physical systems, the reduced systems can be guaranteed to be passive. For distributed systems, we argue that causality of the underlying representation is as important a consideration.


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
 
2
Eric Grimme. Krylov Projection Methods for Model Reduction. PhD thesis, Coordinated-Science Laboratory, University of Illinois at Urbana-Champaign, Urbana-Champaign, IL, 1997.
 
3
A. Odabasioglu, M. Celik, and L. T. Pileggi. Prima: Passive reduced-order interconnect macromodeling algorithm. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, 17(8):645--54, August 1998.
4
 
5
Eli Chiprout and Michael S. Nakhla. Analysis of interconnect networks using complex frequency hopping (CFH). IEEE Trans. Computer-Aided Design, 14(2):186--200, February 1995.
 
6
 
7
B. D. Anderson and S. Vongpanitlerd. Network Analysis and Synthesis. Prentice-Hall, Englewood Cliffs, New Jersey, 1973.
 
8
J. T. Wen. Time domain and frequency domain conditions for strict positive realness. IEEE Transactions on Automatic Control, 33:988--992, 1988.
 
9
M. R. Wohlers. Lumped and distributed passive networks. Academic Press, New York, 1969.
 
10
H. M. Nussenzveig. Causality and dispersion relations. Academic Press, New York, 1972.
11
 
12
W. F. Arnold and A. J. Laub. Generalized eigenproblem algorithms and software for algebraic Riccati equations. Proc. IEEE, 72:1746--1754, 1984.
13
 
14
N. E. Wu and G. Gu. Discrete Fourier transform and h∞ approximation. IEEE Transactions on Automatic Control, 35(9):1044--1046, September 1990.
 
15
B. Ninness and F. Gustafsson. A unifying construction of orthonormal bases for system identification. IEEE Transactions on Automatic Control, 42:515--521, 1997.
 
16
G. Bachmann, L. Narici, and E. Beckenstein. Fourier and wavelet analysis. Springer-Verlag, 2000.


Collaborative Colleagues:
Luca Daniel: colleagues
Joel Phillips: colleagues