Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Guaranteed passive balancing transformations for model order reduction
J Phillips, L Daniel, LM Silveira - Proceedings of the 39th Annual Design …, 2002 - dl.acm.org
The major concerns in state-of-the-art model reduction algorithms are: achieving accurate
models of sufficiently small size, numerically stable and efficient generation of the models …
models of sufficiently small size, numerically stable and efficient generation of the models …
A convex programming approach for generating guaranteed passive approximations to tabulated frequency-data
CP Coelho, J Phillips, LM Silveira - IEEE Transactions on …, 2004 - ieeexplore.ieee.org
In this paper, we present a methodology for generating guaranteed passive time-domain
models of subsystems described by tabulated frequency-domain data obtained through …
models of subsystems described by tabulated frequency-domain data obtained through …
[หนังสือ][B] Advanced model order reduction techniques in VLSI design
Model order reduction (MOR) techniques reduce the complexity of VLSI designs, paving the
way to higher operating speeds and smaller feature sizes. This book presents a systematic …
way to higher operating speeds and smaller feature sizes. This book presents a systematic …
Neural-network approaches to electromagnetic-based modeling of passive components and their applications to high-frequency and high-speed nonlinear circuit …
X Ding, VK Devabhaktuni, B Chattaraj… - IEEE Transactions …, 2004 - ieeexplore.ieee.org
In this paper, artificial neural-network approaches to electromagnetic (EM)-based modeling
in both frequency and time domains and their applications to nonlinear circuit optimization …
in both frequency and time domains and their applications to nonlinear circuit optimization …
A fast algorithm and practical considerations for passive macromodeling of measured/simulated data
D Saraswat, R Achar, MS Nakhla - IEEE Transactions on …, 2004 - ieeexplore.ieee.org
Passive macromodeling of high-speed package and interconnect modules characterized by
measured/simulated data has generated immense interest during the recent years. This …
measured/simulated data has generated immense interest during the recent years. This …
Global passivity enforcement algorithm for macromodels of interconnect subnetworks characterized by tabulated data
D Saraswat, R Achar, MS Nakhla - IEEE Transactions on Very …, 2005 - ieeexplore.ieee.org
With the continually increasing operating frequencies, complex high-speed interconnect and
package modules require characterization based on measured/simulated data. Several …
package modules require characterization based on measured/simulated data. Several …
A quasi-convex optimization approach to parameterized model order reduction
In this paper an optimization based model order reduction (MOR) framework is proposed.
The method involves setting up a quasiconvex program that explicitly minimizes a relaxation …
The method involves setting up a quasiconvex program that explicitly minimizes a relaxation …
Difficulties in high frequency transformer modeling
Traditional transformer models available in EMTP-like software packages are not capable of
representing transformer behavior during a transient state, which includes high frequencies …
representing transformer behavior during a transient state, which includes high frequencies …
Passive constrained rational approximation algorithm using Nevanlinna-Pick interpolation
CP Coelho, JR Phillips… - Proceedings 2002 Design …, 2002 - ieeexplore.ieee.org
As system integration evolves and tighter design constraints must be met, it becomes
necessary to account for the non-ideal behavior of all the elements in a system. For high …
necessary to account for the non-ideal behavior of all the elements in a system. For high …
[PDF][PDF] Fault tolerant graphs, perfect hash functions and disjoint paths
Given a graph G on n nodes we say that a graph T on n+ k nodes is a k-fault tolerant version
of G, if we can embed G in any n node induced subgraph of T. Thus T can sustain k faults …
of G, if we can embed G in any n node induced subgraph of T. Thus T can sustain k faults …