Passive rational interpolation-based reduction via Carathéodory extension for general systems

Authors:
Boyuan Yan;Sheldon X.-D. Tan;Jeffrey Fan
Affiliations:
Department of Electrical and Computer Engineering, Texas A&M University, College Station, TX;State Key Laboratory of ASIC and System, Fudan University, Shanghai, China and Department of Electrical Engineering, University of California, Riverside, CA;Department of Electrical and Computer Engineering, Florida International University, Miami, FL
Venue:
IEEE Transactions on Circuits and Systems II: Express Briefs
Year:
2010

Citing 4
Cited 1

A Convex Optimization Approach to the Rational Covariance Extension Problem

SIAM Journal on Control and Optimization
PRIMA: passive reduced-order interconnect macromodeling algorithm

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Guaranteed passive balancing transformations for model order reduction

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Efficient linear circuit analysis by Pade approximation via the Lanczos process

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Decentralized and passive model order reduction of linear networks with massive ports

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Passive reduction of interconnects requires the system to be described in the so-called passive form, which limits the application of existing approaches. Passive reduction of a dynamic system in general structure form still remains a difficult problem, and existing solutions are expensive. This brief presents a novel rational interpolation-based reduction framework for reducing the dynamic systems described in any internal structure. The new method is based on the Carathéodory extension, which ensures that the interpolating function is passive without any restriction on the circuit structure. As an explicit moment-matching method, it has a similar computational cost as the Krylov-subspace-based reduction methods and is very efficient to reduce the large systems whose input-output behavior can be approximated by a small number of moments.