An efficient framework for passive compact dynamical modeling of multiport linear systems

Mahmood,; Suaya,

doi:10.1109/date.2012.6176676

Cited by 6 publications

(5 citation statements)

References 12 publications

(57 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…see Appendix C for a derivation. From (17), we note that h(x (0) ) − ∂h(x (0) ) T P LB ∂h(x (0) ) > 1 implies h(x) > 1 , which means that all points in ε LB are infeasible,…”

Section: A Initializationmentioning

confidence: 99%

“…Within these 'two-steps' methods, some approaches guarantee optimality in the second step exploiting convex or quasiconvex formulations ( [10]- [12], [14]- [17]). Such algorithms enforce passivity by defining constraints based on the positive real lemma or the bounded real lemma [39], [40].…”

mentioning

confidence: 99%

“…Such algorithms enforce passivity by defining constraints based on the positive real lemma or the bounded real lemma [39], [40]. For example, in [10], [16], [17] passivity constraints are formulated as linear matrix inequalities. As for [13], these formulations may result in a high computational costs both in terms of memory and CPU time, even for moderately complex models.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Efficient Localization Methods for Passivity Enforcement of Linear Dynamical Models

Mahmood

Grivet-Talocia

Chinea³

et al. 2014

IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.

View full text Add to dashboard Cite

This paper describes a novel approach for passivity enforcement of compact dynamical models of electrical interconnects. The proposed approach is based on a parameterization of general state-space scattering models with fixed poles. We formulate the passivity constraints as a unitary boundedness condition on the H ∞ norm of the system transfer function. When this condition is not verified, we use it as an explicit constraint within an iterative perturbation loop of the system state-space matrices. Since the resulting optimization framework is convex but nonsmooth, we solve it via localization based algorithms, such as the ellipsoid and the cutting plane methods. The proposed technique solves two critical bottleneck issues of the existing approaches for passivity enforcement of linear macromodels. Compared to quasi-optimal schemes based on singular value or Hamiltonian eigenvalue perturbation, we are able to guarantee convergence to the optimal solution. Compared to convex formulations based on direct Bounded Real Lemma constraints, we are able to reduce both memory and time requirements by orders of magnitude. We demonstrate the effectiveness of our approach on a number of cases for which existing algorithms either fail or exhibit very slow convergence.

show abstract

“…see Appendix C for a derivation. From (17), we note that h(x (0) ) − ∂h(x (0) ) T P LB ∂h(x (0) ) > 1 implies h(x) > 1 , which means that all points in ε LB are infeasible,…”

Section: A Initializationmentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

See 1 more Smart Citation

Efficient Localization Methods for Passivity Enforcement of Linear Dynamical Models

Mahmood

Grivet-Talocia

Chinea³

et al. 2014

IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.

View full text Add to dashboard Cite

show abstract

“…they have negative real part ( 0). For our analysis, the model that minimizes the mismatch between the measured transconductance and output of the model using an optimization framework as described in [22,23].…”

Section: Temperature Stabilitymentioning

confidence: 99%

Resonant body transistors in standard CMOS technology

Marathe

Wang

Mahmood

et al. 2012

2012 IEEE International Ultrasonics Symposium

Self Cite

View full text Add to dashboard Cite

“…Convex relaxations to this problem are proposed in [1]- [4]. These algorithms rely on enforcing passivity by defining constraints for the positive real lemma or the bounded real lemma.…”

Section: Introductionmentioning

confidence: 99%

Robust localization methods for passivity enforcement of linear macromodels

Mahmood

Chinea²,

Calafiore

et al. 2013

2013 17th IEEE Workshop on Signal and Power Integrity

View full text Add to dashboard Cite

In this paper we solve a non-smooth convex formulation for passivity enforcement of linear macromodels using robust localization based algorithms such as the ellipsoid and the cutting plane methods. Differently from existing perturbation based techniques, we solve the formulation based on the direct H ∞ norm minimization through perturbation of state-space model parameters. We provide a systematic way of defining an initial set which is guaranteed to contain the global optimum. We also provide a lower bound on the global minimum, that grows tighter at each iteration and hence guarantees δ − optimality of the computed solution. We demonstrate the robustness of our implementation by generating accurate passive models for challenging examples for which existing algorithms either failed or exhibited extremely slow convergence.

show abstract

An efficient framework for passive compact dynamical modeling of multiport linear systems

Cited by 6 publications

References 12 publications

Efficient Localization Methods for Passivity Enforcement of Linear Dynamical Models

Efficient Localization Methods for Passivity Enforcement of Linear Dynamical Models

Resonant body transistors in standard CMOS technology

Robust localization methods for passivity enforcement of linear macromodels

Contact Info

Product

Resources

About