On projection-based algorithms for model-order reduction of interconnects

Meiling Wang, Chia Chi Chu, Qingjian Yu, Ernest S. Kuh

Research output: Contribution to journalArticle

80 Citations (Scopus)

Abstract

Model-order reduction is a key technique to do fast simulation of interconnect networks. Among many model-order reduction algorithms, those based on projection methods work quite well. In this paper, we review the projection-based algorithms in two categories. The first one is the coefficient matching algorithms. We generalize the Krylov subspace method on moment matching at a single point, to multipoint moment-matching methods with matching points located anywhere in the closed right-hand side (RHS). of the complex plane, and we provide algorithms matching the coefficients of series expansion-based on orthonormal polynomials and generalized orthonormal basis functions in Hilbert and Hardy space. The second category belongs to the grammian-based algorithms, where we provide efficient algorithm for the computation of grammians and new approximate grammian-based approaches. We summarize some important properties of projection-based algorithms so that they may be used more flexibly.

Original languageEnglish (US)
Pages (from-to)1563-1585
Number of pages23
JournalIEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications
Volume49
Issue number11
DOIs
StatePublished - Nov 2002

Fingerprint

Polynomials

Keywords

  • Coefficient matching
  • Congruence transform
  • Generalized orthonormal basis function
  • Grammian
  • Interconnect
  • Model order reduction
  • Multipoint moment matching
  • Orthonormal polynomials
  • Projection-based algorithms

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

On projection-based algorithms for model-order reduction of interconnects. / Wang, Meiling; Chu, Chia Chi; Yu, Qingjian; Kuh, Ernest S.

In: IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, Vol. 49, No. 11, 11.2002, p. 1563-1585.

Research output: Contribution to journalArticle

@article{039a7a3995fd430594ed8293a9b4c332,
title = "On projection-based algorithms for model-order reduction of interconnects",
abstract = "Model-order reduction is a key technique to do fast simulation of interconnect networks. Among many model-order reduction algorithms, those based on projection methods work quite well. In this paper, we review the projection-based algorithms in two categories. The first one is the coefficient matching algorithms. We generalize the Krylov subspace method on moment matching at a single point, to multipoint moment-matching methods with matching points located anywhere in the closed right-hand side (RHS). of the complex plane, and we provide algorithms matching the coefficients of series expansion-based on orthonormal polynomials and generalized orthonormal basis functions in Hilbert and Hardy space. The second category belongs to the grammian-based algorithms, where we provide efficient algorithm for the computation of grammians and new approximate grammian-based approaches. We summarize some important properties of projection-based algorithms so that they may be used more flexibly.",
keywords = "Coefficient matching, Congruence transform, Generalized orthonormal basis function, Grammian, Interconnect, Model order reduction, Multipoint moment matching, Orthonormal polynomials, Projection-based algorithms",
author = "Meiling Wang and Chu, {Chia Chi} and Qingjian Yu and Kuh, {Ernest S.}",
year = "2002",
month = "11",
doi = "10.1109/TCSI.2002.804542",
language = "English (US)",
volume = "49",
pages = "1563--1585",
journal = "IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications",
issn = "1549-8328",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "11",

}

TY - JOUR

T1 - On projection-based algorithms for model-order reduction of interconnects

AU - Wang, Meiling

AU - Chu, Chia Chi

AU - Yu, Qingjian

AU - Kuh, Ernest S.

PY - 2002/11

Y1 - 2002/11

N2 - Model-order reduction is a key technique to do fast simulation of interconnect networks. Among many model-order reduction algorithms, those based on projection methods work quite well. In this paper, we review the projection-based algorithms in two categories. The first one is the coefficient matching algorithms. We generalize the Krylov subspace method on moment matching at a single point, to multipoint moment-matching methods with matching points located anywhere in the closed right-hand side (RHS). of the complex plane, and we provide algorithms matching the coefficients of series expansion-based on orthonormal polynomials and generalized orthonormal basis functions in Hilbert and Hardy space. The second category belongs to the grammian-based algorithms, where we provide efficient algorithm for the computation of grammians and new approximate grammian-based approaches. We summarize some important properties of projection-based algorithms so that they may be used more flexibly.

AB - Model-order reduction is a key technique to do fast simulation of interconnect networks. Among many model-order reduction algorithms, those based on projection methods work quite well. In this paper, we review the projection-based algorithms in two categories. The first one is the coefficient matching algorithms. We generalize the Krylov subspace method on moment matching at a single point, to multipoint moment-matching methods with matching points located anywhere in the closed right-hand side (RHS). of the complex plane, and we provide algorithms matching the coefficients of series expansion-based on orthonormal polynomials and generalized orthonormal basis functions in Hilbert and Hardy space. The second category belongs to the grammian-based algorithms, where we provide efficient algorithm for the computation of grammians and new approximate grammian-based approaches. We summarize some important properties of projection-based algorithms so that they may be used more flexibly.

KW - Coefficient matching

KW - Congruence transform

KW - Generalized orthonormal basis function

KW - Grammian

KW - Interconnect

KW - Model order reduction

KW - Multipoint moment matching

KW - Orthonormal polynomials

KW - Projection-based algorithms

UR - http://www.scopus.com/inward/record.url?scp=0036857202&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036857202&partnerID=8YFLogxK

U2 - 10.1109/TCSI.2002.804542

DO - 10.1109/TCSI.2002.804542

M3 - Article

VL - 49

SP - 1563

EP - 1585

JO - IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications

JF - IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications

SN - 1549-8328

IS - 11

ER -