Noise compliant macromodel synthesis for RF and Mixed-Signal applications

This paper proposes a compact synthesis approach for reduced-order behavioral macromodels of linear circuit blocks for RF and Mixed-Signal design. The proposed approach revitalizes the classical synthesis of lumped linear and timeinvariant multiport networks by reactance extraction, which is here exploited to obtain reduced-order equivalent SPICE netlists that can be used in any type of system-level simulations, including transient and noise analysis. The effectiveness of proposed approach is demonstrated on a real design applicatio

On the internal signature and minimal electric network realizations of reciprocal behaviors

In a recent paper, it was shown that (i) any reciprocal system with a proper transfer function possesses a signature-symmetric realization in which each state has either even or odd parity; and (ii) any reciprocal and passive behavior can be realized as the driving-point behavior of an electric network comprising resistors, inductors, capacitors and transformers. These results extended classical results to include uncontrollable systems. In this paper, we establish new lower bounds on the number of states with even parity (capacitors) and odd parity (inductors) for reciprocal systems that need not be controllable

On the internal signature and minimal electric network realizations of reciprocal behaviors

This is the author accepted manuscript. The final version is available from Elsevier via the DOI in this record.In a recent paper, it was shown that (i) any reciprocal system with a proper transfer function possesses a signature-symmetric realization in which each state has either even or odd parity; and (ii) any reciprocal and passive behavior can be realized as the driving-point behavior of an electric network comprising resistors, inductors, capacitors and transformers. These results extended classical results to include uncontrollable systems. In this paper, we establish new lower bounds on the number of states with even parity (capacitors) and odd parity (inductors) for reciprocal systems that need not be controllable

A structure-preserving doubling algorithm for Lur'e equations

We introduce a numerical method for the numerical solution of the Lur'e equations, a system of matrix equations that arises, for instance, in linear-quadratic infinite time horizon optimal control. We focus on small-scale, dense problems. Via a Cayley transformation, the problem is transformed to the discrete-time case, and the structural infinite eigenvalues of the associated matrix pencil are deflated. The deflated problem is associated with a symplectic pencil with several Jordan blocks of eigenvalue 1 and even size, which arise from the nontrivial Kronecker chains at infinity of the original problem. For the solution of this modified problem, we use the structure-preserving doubling algorithm. Implementation issues such as the choice of the parameter γ in the Cayley transform are discussed. The most interesting feature of this method, with respect to the competing approaches, is the absence of arbitrary rank decisions, which may be ill-posed and numerically troublesome. The numerical examples presented confirm the effectiveness of this method

On reciprocal systems and controllability

In this paper, we extend classical results on (i) signature symmetric realizations, and (ii) signature symmetric and passive realizations, to systems which need not be controllable. These results are motivated in part by the existence of important electrical networks, such as the famous Bott-Duffin networks, which possess signature symmetric and passive realizations that are uncontrollable. In this regard, we provide necessary and sufficient algebraic conditions for a behavior to be realized as the driving-point behavior of an electrical network comprising resistors, inductors, capacitors and transformers