+ All Categories
Home > Documents > ECE 451 Macromodeling - University of Illinois at Urbana...

ECE 451 Macromodeling - University of Illinois at Urbana...

Date post: 23-Oct-2020
Category:
Upload: others
View: 1 times
Download: 0 times
Share this document with a friend
34
ECE 451 – Jose SchuttAine 1 ECE 451 Macromodeling Jose E. Schutt-Aine Electrical & Computer Engineering University of Illinois [email protected]
Transcript
  • ECE 451 – Jose Schutt‐Aine 1

    ECE 451Macromodeling

    Jose E. Schutt-AineElectrical & Computer Engineering

    University of [email protected]

  • ECE 451 – Jose Schutt‐Aine 2

    Linear N-Portwith MeasuredS-Parameters

    NonlinearNetwork

    1

    NonlinearNetwork

    2

    NonlinearNetwork

    3

    NonlinearNetwork

    4Objective: Perform time‐domain simulation of composite network to determine timing waveforms, noise response or eye diagrams

    Blackbox Macromodeling

  • ECE 451 – Jose Schutt‐Aine 3

    Measurement Data

    Approximation function

    Frequency

    S-pa

    ram

    ete r

    FrequencyS-

    para

    met

    e r

    Approximation function

    Measurement Data S-pa

    ram

    e ter

    Frequency

    Measurement Data

    Approximation function

    Low order Medium order Higher order

    LT

    CT

    LT

    CT

    LT LT

    CT

    Orders of Approximation

  • ECE 451 – Jose Schutt‐Aine 4

    Output

    Frequency-DomainData

    IFFT MOR

    DiscreteConvolution

    RecursiveConvolution

    STAMP

    Circuit Simulator

    Macromodel Implementation

  • ECE 451 – Jose Schutt‐Aine 5

    B=SA

    b(t) = s(t)*a(t)

    s( t )* a( t ) s( t )a( )d

    In frequency domain

    In time domain

    Convolution:

    Terminations are described by a source vector Vg() and an impedance matrix Z

    Blackbox is described by its scattering parameter matrix S

    Blackbox Macromodeling

  • ECE 451 – Jose Schutt‐Aine 6

    Since a(t) is known for t < t, we have:

    Isolating a(t)

    t 1

    1s( t )* a( t ) s( 0 )a( t ) s( t )a( )

    t 1

    1H( t ) s( t )a( ) : History

    t

    1s( t )* a ( t ) s( t )a( )

    When time is discretized the convolution becomes

    Discrete Convolution

  • ECE 451 – Jose Schutt‐Aine 7

    11stamp oY Z 1 s'( 0 ) 1 s'( 0 )

    11stamp oI 2Z 1 s'(0 ) H( t )

    ( ) ( )g stamp g stampY Y v t I I

    stamp stampi( t ) Y v( t ) I

    Stamp Equations

  • ECE 451 – Jose Schutt‐Aine 8

    B( ) S( )A( )

    b( t ) s( t )* a( t )

    Frequency-Domain Formulation

    t

    0

    b( t ) s( t )* a( t ) s( t )a( )d t

    1s( t )* a( t ) s( t )a( )

    t 1

    1H( t ) s( t )a( ) : History

    Time-Domain Formulation

    Convolution

    Discrete Convolution

    Computing History is computationally expensive Use FD rational approximation and TD recursive convolution

    Convolution Limitations

  • ECE 451 – Jose Schutt‐Aine 9

    Large Network (>1,000 nodes)

    Reduced Order Model

    (< 30 poles)

    SPICE Y(t) v(t) = i(t) Y() V() = I()

    Order Reduction

    Y() = Y()~ ~

    Recursive Convolution

    Y(t) v(t) = i(t) ~

    11

    1 1

    ( )1 /

    Li

    i c i

    aY Aj

    Model-Order Reduction

  • ECE 451 – Jose Schutt‐Aine 10

    • AWE – Pade • Pade via Lanczos (Krylov methods)• Rational Function• Chebyshev-Rational function• Vector Fitting Method

    11

    1 1

    ( )1 /

    Li

    i c i

    aH Aj

    Objective: Approximate frequency-domain transfer function to take the form:

    Methods

    Model-Order Reduction

  • ECE 451 – Jose Schutt‐Aine 11

    Question: Why use a rational function approximation?

    Lk

    k 1 ck

    cY( ) H( )X ( ) d X ( )1 j /

    1

    ( ) ( ) ( )

    L

    pkk

    y t dx t T y t

    ( ) ( ) 1 ( ) ck ckT Tpk k pky t a x t T e e y t T

    Answer: because the frequency‐domain relation 

    will lead to a time‐domain recursive convolution:

    which is very fast!

    where

    Model-Order Reduction (MOR)

  • ECE 451 – Jose Schutt‐Aine 12

    Lk

    k 1 ck

    cH( ) d1 j /

    Transfer function is approximated as

    In order to convert data into rational function form, we need a curve fitting scheme Use Vector Fitting

    Model-Order Reduction

  • ECE 451 – Jose Schutt‐Aine 13

    • 1998 - Original VF formulated by Bjorn Gustavsen and Adam Semlyen*

    • 2003 - Time-domain VF (TDVF) by S. Grivet-Talocia.

    • 2005 - Orthonormal VF (OVF) by Dirk Deschrijver, Tom Dhaene, et al.

    • 2006 - Relaxed VF by Bjorn Gustavsen.

    • 2006 - VF re-formulated as Sanathanan-Koerner (SK) iteration by W. Hendrickx, Dirk Deschrijver and Tom Dhaene, et al.

    * B. Gustavsen and A. Semlyen, “Rational approximation of frequency responses by vector fitting,” IEEE Trans. Power Del., vol. 14, no. 3, pp 1052–1061, Jul. 1999

    History of Vector Fitting (VF)

  • ECE 451 – Jose Schutt‐Aine 14

    Algorithm

    1

    1

    ( ) ( )( )

    1

    Nn

    n

    n

    N

    n

    n

    n

    cd sh

    ss f ss c

    s

    a

    a

    1 1

    ( ) ( ) .N N

    n n

    n nn na ac cd s h f s f s

    s s

    Can show* that the zeros of (s) are the poles of f(s) for the next iteration

    Avoid ill-conditioned matrix

    Guarantee stability

    Converge, accurate

    With Good Initial Poles

    * B. Gustavsen and A. Semlyen, “Rational approximation of frequency responses by vector fitting,” IEEE Trans. Power Del., vol. 14, no. 3, pp 1052–1061, Jul. 1999

    , , ,n nc c d hSolve for

    Vector Fitting (VF)

  • ECE 451 – Jose Schutt‐Aine 15

    • Bandwidth Low‐frequency data must be added

    • PassivityPassivity enforcement

    • High Order of ApproximationOrders > 800 for some serial linksDelay need to be extracted

    Issues with MOR

  • ECE 451 – Jose Schutt‐Aine 16

    Can be done using S parameter Matrix 

    *TD = 1 - S S Dissipation MatrixAll the eigenvalues of the dissipation matrix must be greater than 0 at each sampled frequency points. 

    This assessment method is not very robust since it may miss local nonpassive frequency points between sampled points.

    Use Hamiltonian from State Space Representation

    Passivity Assessment

  • ECE 451 – Jose Schutt‐Aine 17

    11

    1 1

    ( )1 /

    Li

    i c i

    aH Aj

    MOR and Passivity

  • ECE 451 – Jose Schutt‐Aine 18

    The State space representation of the transfer function is given by

    x(t) = Ax(t)+ Bu(t)

    y(t) = Cx(t)+ Du(t)

    1( )S s s C I - A B + D

    The transfer function is given by

    State-Space Representation

  • ECE 451 – Jose Schutt‐Aine 19

    • Approximate all N2 scattering parameters using Vector Fitting

    • Form Matrices A, B, C and D for each approximated scattering parameter

    • Form A, B, C and D matrices for complete N‐port

    • Form Hamiltonian Matrix H

    Passivity Assessment - Procedure

  • ECE 451 – Jose Schutt‐Aine 20

    -1 T -1 T

    T -1 T T -1 T

    A - BR D C BR BM =

    C S C -A + C DR B

    Construct Hamiltonian Matrix M

    The system is passive if M has no purely imaginary eigenvaluesIf imaginary eigenvalues are found, they define the crossover frequencies (j) at which the system switches from passive to non‐passive (or vice versa)

    gives frequency bands where passivity is violated

    andT TR = D D - I S = DD - I

    Hamiltonian

  • ECE 451 – Jose Schutt‐Aine 21

    M has dimension 2NLFor a 20‐port circuit with VF order of 40, Mwill be of dimension 2 40  20 = 1600The matrix M has dimensions 1600  1600

    Passivity assessment can be slow… 

    Eigen‐analysis of this matrix is required

    -1 T -1 T

    T -1 T T -1 T

    A - BR D C BR BM =

    C S C -A + C DR B

    Size of Hamiltonian

  • ECE 451 – Jose Schutt‐Aine 22

    Hamiltonian Perturbation Method (1)

    Residue Perturbation Method (2)

    (2) D. Saraswat, R. Achar, and M. Nakhla, “A fast algorithm and practical considerations for passive macromodeling of measured/simulated data,” IEEE Trans. Adv. Packag., vol. 27, no. 1, pp. 57–70, Feb. 2004.

    (1) S. Grivet-Talocia, “Passivity enforcement via perturbation of Hamiltonian matrices,” IEEE Trans. Circuits Syst. I, vol. 51, no. 9, pp. 1755-1769, Sep. 2004.

    Passivity Enforcement Techniques

  • ECE 451 – Jose Schutt‐Aine 23

    Performs VF with common polesAssessment via Hamiltonian Enforcement: Residue Perturbation Method Simulation: Recursive convolution

    Passive VF Simulation Code

    Number of Ports Order CPU‐Time4‐Port 20 1.7 secs6‐port 32 3.69 secs10‐port 34 8.84 secs20‐port 34 33 secs40 50 142 secs80 12 255 secs

  • ECE 451 – Jose Schutt‐Aine 24

    Passive VF Code - Examples

    4 portsorder = 60

    40 portsorder = 50

    Example 1 Example 2

  • ECE 451 – Jose Schutt‐Aine 25

    4 ports, 2039 data points - VFIT order = 60 (4 iterations ~6-7mins), Passivity enforcement: 58 Iterations (~1hour)

    Two-Port Passivity Enforced VF

  • ECE 451 – Jose Schutt‐Aine 26

    Passive Time-Domain Simulation

  • ECE 451 – Jose Schutt‐Aine 27

    Magnitude of S1-21

    40-Port Passivity Enforced VF

  • ECE 451 – Jose Schutt‐Aine 28

    Phase of S1-21

    40-Port Passivity Enforced VF

  • ECE 451 – Jose Schutt‐Aine 29

    Phase of S21

    40-Port Passivity Enforced VF

  • ECE 451 – Jose Schutt‐Aine 30

    Magnitude of S21

    40-Port Passivity Enforced VF

  • ECE 451 – Jose Schutt‐Aine 31

    Magnitude of S11

    40-Port Passivity Enforced VF

  • ECE 451 – Jose Schutt‐Aine 32

    Phase of S11

    40-Port Passivity Enforced VF

  • ECE 451 – Jose Schutt‐Aine 33

    40-Port Time-Domain Simulation

  • ECE 451 – Jose Schutt‐Aine 34

    40-Port Time-Domain Simulation


Recommended