On the equivalent of structure preserving reductions approach and adjoint networks approach for VLSI interconnect reductions

Ming Hong Lai*, Chia Chi Chu, Wu Shiung Feng

*Corresponding author for this work

Research output: Contribution to journalJournal Article peer-review

1 Scopus citations

Abstract

Two versions of Krylov subspace order reduction techniques for VLSI interconnect reductions, including structure preserving reductions approach and adjoint networks approach, will be comparatively investigated. Also, we will propose a modified structure preserving reduction algorithm to speed up the projection construction in a linear order. The numerical experiment shows the high accuracy and low computational consumption of the modified method. In addition, it will be shown that the projection subspace generated from the structure-preserving approach and those from the adjoint networks approach are equivalent. Therefore, transfer functions of both reduced networks are identical.

Original languageEnglish
Pages (from-to)411-414
Number of pages4
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE90-A
Issue number2
DOIs
StatePublished - 02 2007

Keywords

  • Adjoint networks
  • Krylov subspace order reductions
  • Structure-preserving reductions
  • VLSI interconnect

Fingerprint

Dive into the research topics of 'On the equivalent of structure preserving reductions approach and adjoint networks approach for VLSI interconnect reductions'. Together they form a unique fingerprint.

Cite this