reduction and realization techniques in modelling of
play

ReductionandRealization Techniques inModelling of Passive - PowerPoint PPT Presentation

ReductionandRealization Techniques inModelling of Passive ElectronicStructures Pieter Heres Scientific Computing Group, EindhovenUniversityofTechnology FunnyexampleofROM:


  1. Reduction�and�Realization� Techniques in�Modelling of� Passive Electronic�Structures Pieter Heres Scientific Computing Group, Eindhoven�University�of�Technology

  2. Funny�example�of�ROM:� An�image�consists�of�matrix�(or�3) Singular�value�decomposition: T U Σ V = A Truncate�a�certain�amount�of�singular�values. Example:� 139�singular�values

  3. Example:� The�largest�10,�20,�30�and�40�singular�values

  4. Overview of�my�talk • System�formulation • What�is�ROM? • Krylov subspace�methods • Orthogonalization • Realization

  5. Electronic�structures • Passive�structures: – Interconnects – Analog�parts�of�chips – Coupled�with�digital�part • Many�models�can�be�represented�by�RLC- networks: – TLM – PEEC – EFIE�integral�model – FIT – FDTD�(spatially�discretized)

  6. System�formulation DAE�system: � � � � � � � � T C 0 v t v t ( ) ( ) G − P d � � � � � � � � = − + Bu ( t ) � � � � � � � � � � � � � � 0 L i � � i dt ( t ) ( t ) P R � � v ( t ) � � T y t L ( ) = � � � � i ( t ) Or: � C x ( t ) = − Gx ( t ) + Bu ( t ) T x y L ( t ) = ( t ) For�instance:�voltage-in-current-out

  7. What�is�ROM? Large�(RLC-)circuit � C x ( t ) = − Gx ( t ) + Bu ( t ) T x y t L t ( ) = ( ) replaced�by Small�circuit ~ d ~ ~ ~ ~ C x ( t ) = − G x ( t ) + B u ( t ) dt ~ ~ T x y ˆ ( t ) = L ( t ) (with�approximately�same�behavior)

  8. Demands • Behavior�approximated�well: – For�a�fixed�set�of�inputs – Up�to�a�maximum�frequency • Gain�in�computational�time • Passivity�preservation!

  9. System�formulation � C x t Gx t Bu t ( ) = − ( ) + ( ) T x y ( t ) = L ( t ) Transform�with�Laplace: s CX ( s ) = − GX ( s ) + BU ( s ) T X Y ( s ) = L ( s ) T − 1 H s = L G + s C B Transfer�function: ( ) ( ) Direct�relation�between�input�and�output Approximation,�in�frequency�domain

  10. Krylov-subspace�methods PRIMA�(Odabasioglu,�Celik)�and�PVL�(Feldmann,� T − T − 1 1 Freund):� H ( s ) = L ( G + s C ) B = L ( I − ( s − s ) A ) R 0 � n − 1 b b A b Ab A ( , ) = [ , ,..., ] n − 1 A G s C C = − ( + 0 ) with: − 1 R G C B = ( + s 0 )

  11. Krylov-subspace�methods�(2) Defined�by: � n − 1 b ( b , A ) = [ b , Ab ,..., A ] � Orthonormal basis:� V Projection: ˜ V T G G V

  12. Krylov-subspace�methods(3) SVD-Laguerre (Knockaert,�De�Zutter): Laguerre expansion: T − 1 H ( s ) = L ( G + s C ) B = n � � ∞ 2 α � s − α n ( ) � � T − 1 L G + α C G − α C G + α C B ( )( ) ( ) � � s + α s + α n = 0 Krylov-space: − 1 − 1 b = ( G + α C ) B A = G + α C G − α C ( ) ( )

  13. Example PCB Original�size�695�by�695 Reduced�to�70�by�70 Behavior�up�to�1GHz

  14. Example�(AC�analysis)

  15. Example�(transient)

  16. Orthogonalization

  17. Krylov spaces Orthogonalize�while�building�up: � n − 1 B ( B , A ) = [ B , AB ,..., A ] � Extra�care�for�multiple�columns�of�B Choices: – which�columns�are�generated�when? – what�is�orthogonalized�against�what? Every�column�in� B� has�its�own�Krylov-space.

  18. Krylov spaces Which�columns�are�generated�when? – Columns�of�B�separately – B�in�blocks What�is�orthogonalized�against�what? – Afterwards�(eg.�with�SVD) – During • Against�all • Against�column�of�same�Krylov� space

  19. Modified�Gram-Schmidt Sometimes�re-orthogonalization is�necessary. for�i=1..j h�=�v iT w; w�=�w�– h�v i ; end w�=�w/|w|; Rule�of�thumb:� re-orthogonalize�if�more�than�75%�is�removed

  20. Krylov�spaces • Mixing�of�Krylov�spaces – essential�information�can�be�lost – spurious�information�can�occur • Preserve�the�shape�of�the�Hessenberg�matrix • Block�Arnoldi� (as�in�PRIMA)�is�a�right�way�and�an� efficient�way

  21. Realization

  22. Realization ~ T x V x = Projection: Physical�meaning�is�lost Given�an�arbitrary�system,�find�a�circuit: d ~ ~ ~ ~ ~ C x ( t ) = − G x ( t ) + B u ( t ) dt ~ ~ T x ˆ y ( t ) = L ( t ) AC�and�Transient�analysis

  23. Need�for�realization Transient�analysis�can�be�done,�via�frequency� domain�result�(IFFT)�.. …�or�via�general�solution�and�a�convolution� integral. All�these�methods�are�expensive�and�specific�for� one�input. A�circuit�can�be�coupled�with�the�rest�of�circuit.

  24. Realization�(2) Define�a�circuit�with� q internal�nodes State�space�vector:�node�voltages Rows:�KCL’s for�every�node =>�Circuit�with� q nodes: � � � q = C mj x i = G mj x i = B mj u j j j j j j

  25. Realization�(3) Output�is�defined�as�sources�to�the�terminals�of�the� model

  26. Results • From�large�model�to�small�model • Able�to�combine�reduced�model�with�components� and�other�models – AC�analysis�and�stable�transient�analysis • Future�work:� – non-linear�MOR – Parametrized�MOR

  27. My�website,�email�and�… www.ecce.tue.nl/SMURF P.J.Heres@tue.nl Thank�you�for�your�attention!

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend