loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASP-DAC/VLSI Design 2002
Efficient Approximate Balanced Truncation of General Large-Scale RLC Systems via Krylov Methods
Bangalore, India
January 07-January 11
ISBN: 0-7695-1441-3
Q. Su, Purdue University
V. Balakrishnan, Purdue University
C-K. Koh, Purdue University
We present an efficient implementation of an approximate balanced truncation model reduction technique for general large-scale RLC systems, described by a state-space model where the "C" matrix in the time-domain modified nodal analysis (MNA) circuit equation "C\dot{x}=-Gx+Bu" is not necessarily invertible. The large sizes of the models that we consider make most implementations of the balance-and-truncate method impractical from the points of view of computational load and numerical conditioning. This motivates our use of Krylov subspace methods to directly compute approximate low-rank square roots of the Gramians of the original system. The approximate low-order general balanced and truncated model can then be constructed directly from these square roots. We demonstrate using three practical circuit examples that our new approach effectively gives approximate balanced and reduced order coordinates with little truncation error.
Index Terms:
RLC interconnects, model reduction, large scale systems, Krylov, balanced truncation
Citation:
Q. Su, V. Balakrishnan, C-K. Koh, "Efficient Approximate Balanced Truncation of General Large-Scale RLC Systems via Krylov Methods," vlsid, pp.311, ASP-DAC/VLSI Design 2002, 2002
Usage of this product signifies your acceptance of the Terms of Use.