• DocumentCode
    619507
  • Title

    ABCD-L: Approximating continuous linear systems using Boolean models

  • Author

    Karthik, Aadithya V. ; Roychowdhury, Jaijeet

  • Author_Institution
    Dept. of Electr. Eng. & Comput. Sci., Univ. of California, Berkeley, Berkeley, CA, USA
  • fYear
    2013
  • fDate
    May 29 2013-June 7 2013
  • Firstpage
    1
  • Lastpage
    9
  • Abstract
    In this supplement, we provide additional context for ABCD-L and place our contributions in perspective, relative to the existing body of literature on topics like AMS modelling/verification, Boolean and hybrid systems frameworks, etc. Further, we demonstrate that ABCD-L can be applied in conjunction with Model Order Reduction (MOR) techniques, to Booleanize large LTI systems whose direct eigendecomposition may be computationally infeasible. For example, we combine ABCD-L with Arnoldi iteration based MOR to efficiently produce accurate Boolean models of a real-world power grid network (with 25849 nodes) obtained from a benchmark set made available by IBM. Due to space constraints, we were unable to include such material within our main manuscript.
  • Keywords
    Boolean algebra; SPICE; approximation theory; integrated circuit modelling; interpolation; ABCD-L; AMS modelling-verification; Arnoldi iteration based MOR techniques; Boolean models; Booleanize large LTI systems; IBM; SPICE; approximating continuous linear systems; direct eigendecomposition; model order reduction techniques; real-world power grid network; Accuracy; Approximation methods; Computational modeling; Equalizers; Integrated circuit modeling; Mathematical model; Registers;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Design Automation Conference (DAC), 2013 50th ACM/EDAC/IEEE
  • Conference_Location
    Austin, TX
  • ISSN
    0738-100X
  • Type

    conf

  • Filename
    6560656