SPECTRAL ANALYSIS OF ELECTRONIC CIRCUITS

Abstract

A method for electronic circuit spectral analysis includes receiving a list of parts for an electronic circuit, determining a part admittance matrix with algebraic nodes for each part, and determining a circuit admittance matrix for exterior nodes, interior nodes, and algebraic nodes based on the part admittance matrices. The method also includes reducing interior nodes of the circuit admittance matrix for exterior nodes, interior nodes, and algebraic nodes to determine a circuit admittance matrix for exterior nodes and algebraic nodes, reducing algebraic nodes to transform the circuit admittance matrix for exterior nodes and algebraic nodes into a Green's Function, evaluating the Green's Function to determine a circuit exterior node admittance matrix over a frequency spectrum, and transforming the circuit exterior node admittance matrix to a circuit scattering matrix over the frequency spectrum.

Description

RELATED APPLICATION INFORMATION

[0001] This patent claims priority from provisional application No. 62/339,445 filed on May 20, 2016, entitled "SPECTRAL ANALYSIS OF ELECTRONIC CIRCUITS" which is incorporated by reference in its entirety.

NOTICE OF COPYRIGHTS AND TRADE DRESS

[0002] A portion of the disclosure of this patent document contains material which is subject to copyright protection. This patent document may show and/or describe matter which is or may become trade dress of the owner. The copyright and trade dress owner has no objection to the facsimile reproduction by anyone of the patent disclosure as it appears in the Patent and Trademark Office patent files or records, but otherwise reserves all copyright and trade dress rights whatsoever.

BACKGROUND

Field

[0003] This disclosure relates to spectral analysis of electronic circuits.

Description of the Related Art

[0004] Conventional electronic circuit spectral analysis calculates an exterior node admittance spectrum one frequency at a time. The circuit admittance is the sum of admittances of component parts connected to interior and exterior nodes. Interior node elimination (or Kron reduction) yields the exterior node admittance, from which the circuit behavior may be predicted. This process is repeated by a loop over frequency points to create an admittance spectrum. Central processing unit ("CPU") time scales linearly in the number of frequency points.

DESCRIPTION OF THE DRAWINGS

[0005] FIG. 1 shows a flow chart of calculation of spectra in conventional circuit analysis using Kron reduction.

[0006] FIG. 2 shows a flow chart of a method of electronic circuit spectral analysis by algebraic node transformation.

[0007] FIG. 3A shows a schematic diagram of a unit shunt capacitor

[0008] FIG. 3B shows a schematic diagram of a unit shunt resistor.

[0009] FIG. 3C shows a schematic diagram of a J inverter.

[0010] FIG. 3D shows a schematic diagram of an assembly of a shunt resistor using a unit shunt resistor and two J inverters.

[0011] FIG. 3E shows a schematic diagram of an assembly of an infinitesimal shunt conductance and a unit shunt capacitor.

[0012] FIG. 3F shows a schematic diagram of an assembly of a shunt inductor from a J inverter and a unit shunt capacitor.

[0013] FIG. 3G shows a schematic diagram of an assembly of a shunt capacitor from two J inverters and a unit shunt capacitor.

[0014] FIG. 3H shows a schematic diagram of an assembly of a series resistor using three unit J inverters and a shunt resistor.

[0015] FIG. 3I shows a schematic diagram of standard nodes of a series inductor.

[0016] FIG. 3J shows a schematic diagram of expansion to algebraic nodes of the series inductor of FIG. 3I.

[0017] FIG. 4A shows a schematic diagram of standard nodes of a series capacitor.

[0018] FIG. 4B shows a schematic diagram of node expansion of the series capacitor of FIG. 4A.

[0019] FIG. 5 shows a schematic diagram of circuit nodes in a Modified Butterworth Van Dyke (MBVD) model for an acoustic wave resonator.

[0020] FIG. 6 shows a schematic diagram of algebraic node expansion of the MBVD model of FIG. 5.

[0021] FIG. 7 shows a schematic diagram of a reduced MBVD model after elimination of interior circuit nodes.

[0022] FIG. 8 shows a schematic diagram of the reduced MBVD model of FIG. 7 after diagonalization of the Hurwitz matrix.

[0023] FIG. 9 shows a flow chart of calculation of spectra of electronic circuits using diagonalization for small-size Hurwitz matrices.

[0024] FIG. 10 shows a flow chart of the calculation of spectra of electronic circuits using linear algebra appropriate for intermediate-size Hurwitz matrices.

[0025] FIG. 11 shows a flow chart of calculation of spectra of electronic circuits using the Kernel Polynomial Method appropriate for large-sized Hurwitz matrices.

[0026] FIG. 12 shows an S matrix for a reconfigurable SAW filter circuit example.

[0027] FIG. 13 is a graph of central processing unit ("CPU") time versus number of frequency points for various methods of calculating the S matrix of the reconfigurable SAW filter example of FIG. 12.

[0028] FIG. 14 shows an S matrix for a SAW duplexer example.

[0029] FIG. 15 is a graph of CPU time versus number of frequency points for various methods for calculating the S matrix of the SAW duplexer example of FIG. 14.

[0030] FIG. 16 shows poles and zeros of the SAW duplexer example of FIG. 14.

DETAILED DESCRIPTION

[0031] A fast method and system are described for spectral analysis of electronic circuits and equivalent linear time invariant systems. Symbolic algebra can be used to transform equations into a form that is more efficient for computation or that provides greater insight. An algebraic node transformation of the admittance can improve the scaling of CPU time with the number of frequency points. The nodal analysis of the admittance is transformed by a process of algebraic node expansion and interior node reduction. The transformed form for the exterior node admittance is analogous to a Green's, or impulse response, function. This simplifies the frequency dependence of the admittance, which enables orders of magnitude faster computation of spectral properties such as the scattering matrix and pole zero analysis.

[0032] The algebraic node transformation method is applicable to lumped component circuits assembled from resistors, inductors and capacitors. It is also applicable to many other linear time invariant systems which have equivalent circuit analogues. It may be adapted to distributed electronic components such as calculated by electromagnetic simulation.

[0033] The design and characterization of circuits such as filters, duplexers, and multiplexer can involve processes of synthesis, optimization and survey over extremely large numbers of possible circuit designs. Spectral analysis over thousands of frequency points and pole zero analysis can be a rate limiting steps for this design process. The methods described herein accelerate the circuit design process by orders of magnitude, which can enable discovery of new types of circuits.

[0034] The method introduces algebraic node analysis, and matrix transformations comprised, in part, of successive nodal expansions and interior node reductions, to isolate the frequency dependence from the remaining computation of the spectral response of a circuit. The transformation from interior to algebraic node representations of the admittance enables most of the calculation to be done one time only for all frequencies, thereby accelerating calculation for many frequency points.

[0035] According to this method, a frequency dependent external node admittance matrix is transformed into the Green's function form. The time Fourier transform propagates as the exponential of time multiplied by a complex symmetric stable Hurwitz matrix. Frequency independent matrices required to form the Green's function are calculated before a final vectorized calculation of the frequency spectrum. Efficient linear algebra methods developed for Green's function evaluation in many disciplines, such as physics and chemistry, may be adapted to the spectral analysis of circuits. The central processing unit ("CPU") time scales sublinearly in the number of frequency points. It approaches linear scaling at large number of frequency points, but with a much smaller coefficient than the conventional method. Detailed comparisons depend on the particular circuit and the method for Green's function evaluation.

[0036] For many applications, the method is orders of magnitude faster than the conventional spectral analysis method, especially if large numbers of frequency points are desired. Examples drawn from surface acoustic wave device design demonstrate approximately two orders of magnitude speed increase for spectral analysis and pole zero analysis.

[0037] The algebraic node transformation method also provides a new characterization of the dynamical behavior of circuits that is complementary to other established methods. Features of analyticity, causality, positivity and sum rules may transcend particular applications. They can be used as powerful constraints on circuit data analysis and modeling.

[0038] FIG. 1 shows a flow diagram for a conventional circuit spectral analysis method.

[0039] At step 101, a parts list for a circuit is received. The admittance matrix of a circuit is assembled from the admittance matrices of its parts by connecting parts together at nodes.

[0040] At step 102, an admittance matrix is determined for each part at one frequency using a library of frequency-dependent functions. This method includes a library of functions to calculate an admittance matrix for each type of part. Simple parts such as resistors, inductors and capacitors have only exterior nodes. Parts that are subcircuits have interior nodes as well.

[0041] At step 103, a circuit admittance matrix can be determined at one frequency by attaching exterior nodes of parts to circuit nodes.

[0042] At step 104, the circuit interior nodes are then eliminated (or Kron reduced) to determine a circuit exterior node admittance matrix at one frequency, where the submatrices are functions of frequency.

[0043] At step 105, the calculations of step 102, step 103, and step 104 are looped over an indicated frequency spectrum, such that a circuit exterior node admittance is determined at all frequencies of interest at step 106.

[0044] At step 107, the circuit exterior node admittance is transformed to a circuit scattering matrix at all frequencies of interest. The CPU time for the conventional algorithm scales linearly in the number of frequency points.

[0045] In the algebraic node transformation method shown in FIG. 2 and described further herein, the introduction of frequency dependence is pushed to a later step. For a modest number of frequency points this removes most of the dependence of the CPU time on the number of frequency points. In the limit of large numbers of frequency points, the CPU time dependence is linear but with a much smaller coefficient than the conventional method.

[0046] At step 201, a parts list for a circuit is received.

[0047] At step 202, admittance matrices with algebraic nodes are determined for each part in the parts list using a library of frequency-independent functions. Here, an expanded admittance matrix is calculated for each type of part, which includes exterior and interior circuit nodes, as well as algebraic nodes. The diagonal elements of the admittance for algebraic nodes have a linear frequency dependence. All other admittance matrix elements are frequency independent.

[0048] At step 203, the expanded circuit admittance with exterior, interior and algebraic nodes is assembled by connecting exterior nodes of parts to exterior and interior circuit nodes. The expanded admittance for the complete circuit retains all the algebraic nodes of the simple parts and the subcircuits that comprise the whole. The only frequency dependence is linear in the diagonal elements of algebraic nodes. All other elements of the expanded circuit admittance are frequency independent.

[0049] At step 204, the expanded circuit admittance is transformed into a reduced circuit admittance matrix for only exterior and algebraic nodes. The interior circuit nodes are eliminated by Kron reduction. The reduced matrix is the sum of a frequency-dependent diagonal matrix and a frequency-independent complex symmetric matrix. The algebraic node submatrix of the frequency independent matrix satisfies the stability properties of a Hurwitz matrix. Eigenvalues are either positive real or complex conjugate pairs with positive real parts. They describe the internal dynamics of the system. External coupling is provided by the matrix elements between algebraic and exterior nodes.

[0050] At step 205, this admittance is further transformed by reduction of the algebraic nodes. The resulting circuit admittance matrix for exterior circuit nodes has a Green's Function form with a spectral dependence on the Hurwitz matrix. This form is similar mathematically to impulse or linear response functions in other disciplines.

[0051] At step 206, the Green's Function is evaluated to determine a circuit exterior node admittance at all frequencies of interest. The submatrices in this expression are independent of frequency, so they only need to be calculated once. For modest numbers of frequency points, the CPU time required to evaluate the submatrices for all frequency points in the fast circuit spectral analysis method is comparable to the time required for evaluation of submatrices for a single frequency point in the conventional method. A variety of existing numerical methods developed in other disciplines may be adapted to evaluate Green's functions.

[0052] At step 207, the circuit exterior node admittance is transformed to a circuit scattering matrix at all frequencies of interest.

Algebraic Node Expansion

[0053] In nodal analysis, a circuit is represented by a set of nodes with electrical components connected between them. Each circuit node is associated with a current I and voltage V. A set of nodes is associated with vectors of currents I and voltages V. By definition, the admittance matrix Y is the relation between currents and voltages, I=YV. The circuit obeys Kirchoff Current Law. Currents for `interior` nodes are zero. Currents for `exterior` nodes may be non-zero. Nodal analysis using exterior and interior nodes is prior art.

[0054] Algebraic nodes may be introduced by considering the following problem. Assume there are fundamental units of resistance R.sub.0 and capacitance C.sub.0. And assume there are elemental shunt components with these values shown in FIG. 3. How can all RLC circuits be assembled by connecting the unit components using only J inverters?

[0055] The admittances for unit components are as follows.

[0056] For a unit shunt capacitor shown in FIG. 3A,

Y.sub.1.sup.C=j.omega.C.sub.u.

For a unit shunt resistor shown in FIG. 3B,

Y 1 R = 1 R u . ##EQU00001##

For a unit J inverter in FIG. 3C,

Y 2 J = j R u ( 0 J J 0 ) . ##EQU00002##

Shunt means the component is connected between an exterior node and ground. J inverters are represented by a double line between two exterior nodes.

[0057] The choice of scales is arbitrary. The unit of resistance may be an ohm .OMEGA., or it may be the transmission line standard of 50.OMEGA.. The unit of capacitance may be a picofarad. R.sub.u=1 and C.sub.u=1 in the selected units. Using dimensional analysis, if required the admittances units can be reintroduced at the end of a calculation.

[0058] FIG. 3D shows that a shunt resistor for any R may be assembled from these basic components by connecting a unit shunt resistor to two J inverters with J= {square root over (R)} and J=1. A node shared by two or more components, and not with the exterior, is an `interior` node. The admittance is

Y 3 R = ( 0 j 0 j 0 j R 0 j R 1 ) . ##EQU00003##

There are two interior nodes.

[0059] Node elimination, or Kron reduction, is important to all that follows. To clarify, suppose there are two types of nodes, a and b. In block submatrix form

( I a I b ) = ( Y aa Y ab Y ba Y bb ) .times. ( V a V b ) . ##EQU00004##

[0060] To eliminate all the b nodes, invoke Kirchoffs Current Law to solve for I.sub.b=0. The result is

Y.sub.aa.sup.r=Y.sub.aa-Y.sup.abY.sub.bb.sup.-1Y.sub.ba.

Here, the superscript r denotes reduced.

[0061] For the shunt resistor example, the first node is exterior and the second two are interior. Elimination of the third node yields

Y 2 R = ( 0 j j R ) . ##EQU00005##

[0062] There is an impedance R on the second node. Reduce that to yield the familiar one node admittance, Y.sub.1.sup.R=1/R.

[0063] The two and three node admittances are obtained from the one node admittance by `expansion`. The reverse process is `reduction`. All three forms produce the same electrical behavior, so they are `equivalent circuits`.

[0064] The unit shunt capacitor is the only frequency .omega. dependent elemental component. Use of it requires complex variable analysis. An equivalent circuit is needed to control mathematical singularities in the complex .omega. plane, especially how to close contour integrals. The solution shown in FIG. 3E puts each unit shunt capacitor in parallel with an infinitesimal shunt conductance .epsilon. or inverse resistance. The combined admittance is Y.sub.1=j.omega.+.epsilon..

[0065] The infinitesimal defines a limit, as in

lim .fwdarw. 0 1 x .+-. j = P 1 x .-+. j .pi..delta. ( x ) . ##EQU00006##

[0066] Here, .delta.(x) is a Dirac delta function, an infinitely sharp positive function with an integral equal to one. P indicates take the Cauchy principal value in integrals. It relates real and imaginary parts of quantities to be calculated. In .omega.'s Fourier conjugate time variable t, it guarantees Fourier transforms are causal, which means admittances for passive circuits decay with increasing time. Lossless components need this limiting procedure. For lossy components, resistors may replace .epsilon. to define complex .omega. plane contour integrals.

[0067] In the following, a unit shunt capacitor is implicitly in parallel with an infinitesimal conductance .epsilon.. Equivalently, .omega. implicitly has an infinitesimal imaginary part -j.epsilon.. It is made explicit only where needed for emphasis.

[0068] An equivalent circuit for a shunt inductor can be assembled from these components as shown FIG. 3F, by connecting the exterior node of a shunt unit capacitor and the inverter with J=1/ {square root over (L)}. The two node expanded admittance of an inductor is

Y 2 L = j ( 0 1 L 1 L .omega. ) . ##EQU00007##

[0069] Elimination, or Kron reduction, of the algebraic node results in the usual one exterior node admittance for an inductor, Y.sub.1.sup.L=1/j.omega.L. That proves the expanded two node circuit expanded is an equivalent circuit for an inductor.

[0070] The two node admittance puts the frequency .omega. and the inductor L variables on separate matrix elements. As shall be demonstrated, this separation enables linear algebra transformations that are advantageous for calculating frequency sweeps, or the spectral response, of a circuit. For that reason, the new interior node of the shunt capacitor is labeled an `algebraic` node.

[0071] An equivalent circuit for a shunt capacitor can be assembled as shown in FIG. 3G, by connecting two J inverters with a unit capacitor. One J inverter has J=1 and the other has J=1/ {square root over (C)}. The three node expanded admittance of a capacitor is

Y 3 C = j ( 0 1 0 1 0 1 C 0 1 C .omega. ) . ##EQU00008##

[0072] The first node is an exterior node, the second node is interior, and the third node is algebraic. Elimination of the algebraic and interior nodes yields the familiar one exterior node admittance Y.sub.1.sup.C=j.omega.C. The two J inverters have enabled a scale transformation of the unit capacitor.

[0073] An equivalent circuit for a series component can be assembled as shown in FIG. 3H, by connecting the corresponding shunt component to a T network of three unit J inverters. The four node expanded admittance of a series resistor is

Y 4 R = ( 0 0 j 0 0 0 - j 0 j - j 0 j 0 0 j 1 R ) . ##EQU00009##

[0074] The first two nodes are exterior, and the second two are interior. Elimination of the interior nodes results in the standard two exterior node admittance for a series resistor,

Y 2 R = ( 1 R - 1 R - 1 R 1 R ) . ##EQU00010##

[0075] For the applications considered in this disclosure, the interior nodes may be eliminated. However, there can be zeros on the diagonal elements for the interior nodes, which may result in division by zero during node elimination. This problem may be regularized by adding an infinitesimal shunt resistance or conductance at the node to be eliminated.

[0076] For example, elimination of the interior node for the shunt capacitor Y.sub.3.sup.C yields

Y 2 C = j .omega. ( 0 0 0 1 ) + 1 ( 1 1 C 1 C 1 C ) . ##EQU00011##

[0077] This is a two node expanded admittance, with one exterior node and one algebraic node.

[0078] Two equivalent ways of representing the one node admittance are

Y 1 C = 1 1 j .omega. C + ; Y 1 C = j .omega. C + . ##EQU00012##

[0079] The purpose of infinitesimals is to track how to take a limit in complex variable analysis. So the rules for infinitesimal math differ from normal math, in the same sense that rules for infinity math differ. That is, .epsilon. multiplied by something is .epsilon. times the sign of something, .epsilon.+.epsilon.=.epsilon., .epsilon..times..epsilon.=.epsilon., and so on. In the first equation, .omega. is implicitly .omega.-j.epsilon.. The two equations are equivalent in the sense of infinitesimal math.

[0080] The fully expanded admittance for a series inductor has five nodes, two exterior, two interior and one algebraic. To regularize, add an infinitesimal shunt conductance at the shunt inductor node, and eliminate interior nodes. The reduced admittance has two exterior nodes and one algebraic node,

Y 3 L = ( - - j L - j L - j L j L j .omega. ) . ##EQU00013##

[0081] The .epsilon. elements are negligible for numerical purposes and the .epsilon.=0 limit may be taken.

[0082] The use of tiny resistors and conductances as regularization in complex variable analysis differs from their use to regularize numerical calculations. A computer has limited precision. Regularization by adding tiny resistances or conductances is helpful to dampen effects of random machine errors. The scale for regularization corresponds to the square root of machine precision, approximately 10.sup.-8.OMEGA. for typical computers. Such numerical regularization is not taken to a zero limit. Too small a regularization can cause numerical calculations to go unstable resulting in, e.g., division by zero errors.

[0083] Equivalent circuits for series inductors and capacitors with internal nodes eliminated are illustrated in FIGS. 3I, 3J, 4A, and 4B. These figures use a simplified symbol for the algebraic node as just a circle with an .omega. on it.

[0084] FIG. 3I shows a schematic diagram of nodes of a series inductor 300, and FIG. 3J shows a schematic diagram of node expansion of the series inductor of FIG. 3I. Nodes 301 and 302 are exterior nodes. Mathematical expressions give the value of the elements. Node 303 is a frequency dependent algebraic node, which means that the diagonal admittance Y.sub.33=j.omega.. Inverters 305, 307 do not depend on .omega.. An inverter is a circuit element that flips voltages to currents, and vice versa. Labels on the inverters represent values of the inverters.

[0085] FIG. 4A shows a schematic diagram of nodes of a series capacitor 400, and FIG. 4B shows a schematic diagram of node expansion of the series capacitor 400 of FIG. 4A. Nodes 401 and 402 are exterior nodes. Node 404 is a frequency dependent algebraic node, and node 403 is a frequency independent algebraic node, such that Y.sub.33=0. Labels on J-inverters, 405, 406, and 407 represent values of the inverters.

[0086] As shown above, equivalent circuits for any RLC circuit can be assembled from the simple components in FIGS. 3A-3H. As they are connected in a network, exterior nodes become interior, and the algebraic nodes are unchanged. If not useful, interior nodes of any component may be eliminated, resulting in expanded admittances that have only exterior nodes and algebraic nodes.

Reduction of Algebraic Nodes to Green's Function Form

[0087] After reduction of all interior nodes, all RLC circuits have an admittance expanded with algebraic nodes in the block matrix form

Y = j .omega. ( 0 0 0 1 ) + ( Y ee Y ea Y ae Y aa ) . ##EQU00014##

[0088] A subscript `e` denotes an exterior node, and a subscript `a` denotes an algebraic node. Here 1 denotes a unit diagonal matrix in the space of algebraic nodes. All of the w dependence is made explicit by the expansion to algebraic nodes. The number of such nodes equals the sum of capacitors and inductors in the circuit.

[0089] Expansion of the admittance to algebraic nodes is a great simplification of the frequency dependence of RLC circuits. All of the block matrices need to be calculated only once for all frequencies. As shall be shown, this dramatically accelerates the spectral analysis of circuits.

[0090] To compute the admittance spectrum for exterior nodes, reduce all algebraic nodes

Y ee r ( .omega. ) = Y ee - Y ea 1 ( j .omega. + ) 1 + Y aa Y ae . ##EQU00015##

[0091] Unless a matrix has an explicit (.omega.) dependence, it is frequency independent. Such matrices need to be calculated only once for a complete spectral analysis. Here the 1 is a diagonal unit matrix in the space of algebraic nodes.

[0092] Define the Laplace transform variable S.ident.j.omega.. In order for the RLC circuit to be stable, the characteristic polynomial,

P(s).ident.det[(s+.epsilon.)1+Y.sub.aa],

[0093] must satisfy the Hurwitz criterion. It must have real coefficients of powers of s. The roots are in the left hand complex s-plane. The .epsilon. ensures this condition is met even in the lossless circuit limit. Roots are either negative real, or they come in complex conjugate pairs with negative real parts. The roots are dynamical modes of the system.

[0094] To address spectral properties, it is better to work with H.ident.jY.sub.aa. The Fourier transform of the admittance evolves with time by multiplying by e.sup.jHt. H is a square symmetric matrix. It is real for lossless circuits and complex for lossy circuits. A square complex matrix H may be diagonalized with left and right eigenvector matrices W' and V, respectively

HV=VE; W'H=EW'.

[0095] E is a diagonal matrix of eigenvalues corresponding to resonant frequencies of the circuit. V is a matrix of eigenvectors, which are linear superpositions of the algebraic nodes.

[0096] Symmetric means that the non-conjugate transpose H.sup.T=H. A diagonal matrix satisfies E.sup.T=E. Then a sequence of substitutions leads to

V.sup.TH.sup.T=E.sup.TV.sup.T V.sup.TH=EV.sup.T W'=V.sup.T

[0097] Multiply the left hand side by V.sup.T and the right hand side of the second by V. The result is

V.sup.TVE=V.sup.THV=EV.sup.TV.

[0098] Inasmuch as this shows K.ident.V.sup.TV commutes with a non-unit diagonal matrix, it must also be diagonal. It follows that

V - 1 = 1 K V T ; H = VEV - 1 ; ##EQU00016##

[0099] In the limit of lossless circuits, H is real symmetric, K.fwdarw.1, eigenvectors are orthonormal, and eigenvalues are real.

[0100] The Hurwitz stability property requires real parts to be paired, E.sub.k=.+-.w.sub.k+j.GAMMA..sub.k, or to be pure imaginary E.sub.k=j.GAMMA..sub.k. This symmetry helps ensure the admittance obeys Y(-.omega.)=Y(.omega.)*; that is, the admittance is Fourier transform to a real causal convolution function of time.

[0101] The inverse matrix has a representation in terms of eigenvalues and eigenvectors,

G ij ( .omega. ) .ident. ( 1 ( j .omega. + ) 1 + Y aa ) ij = k V ik 1 j ( .omega. + w k ) + + .GAMMA. k V kj - 1 ##EQU00017##

[0102] The real part is positive definite and satisfies a frequency integral sum rule,

1 = 2 .pi. .intg. 0 .infin. G ( .omega. ) d .omega. . ##EQU00018##

[0103] Here 1 is a diagonal unit matrix in the space of algebraic nodes.

[0104] Real and imaginary parts are not independent. They are related by Cauchy principal value integrals, as in

G ( .omega. ) = 2 .omega. .pi. P .intg. 0 .infin. G ( .omega. ' ) .omega. '2 - .omega. 2 d .omega. ' . ##EQU00019##

[0105] Here P indicates to take the principal value integral. They are a consequence of analyticity in the lower half w plane. That is, all eigenvalues, and therefore poles of G, are in the upper half plane corresponding to decaying modes in the Fourier transform time variable.

[0106] Then the exterior node spectral admittance is,

Y.sub.ee.sup.r(.omega.)=Y.sub.ee-Y.sub.eaG(.omega.)Y.sub.aw.sup.T.

[0107] It is the sum of a real frequency independent term and a projection of G(.omega.) from algebraic nodes to exterior nodes using a non-conjugate transpose inner product.

Modified Butterworth Van Dyke Model Example

[0108] FIG. 5 shows a Modified Butterworth Van Dyke (MBVD) model 500 for an acoustic wave resonator. It is used, for example, in the design of radio frequency filters for cell phones. FIG. 5 shows a diagram of circuit nodes and parts in a MBVD model 500. The parts comprise one inductor L, two capacitors C and C.sub.0, and two resistors R and R.sub.0. C.sub.0 is called the static capacitance. The R, L, C in series is called the motional resonator. Conventional nodal analysis yields 5 circuit nodes. Nodes 501 and 502 are exterior circuit nodes, and nodes 503, 504, and 505 are interior circuit nodes.

[0109] FIG. 6 is a schematic diagram of the 10 node expanded admittance for the MBVD 500 of FIG. 5. The algebraic node expansion yields a frequency-dependent algebraic node 606 for the inductor, frequency-independent and frequency-dependent pairs of algebraic nodes 607, 608 for C.sub.0, nodes 609, 610 for C, and inverters 611, 612, 613, 614, 615, 616, 617, 618, and 619. The labels on the inverters are the value of the inverter. The labels are mathematical expressions for the component Y/j values.

[0110] Connecting an MBVD model as a subcircuit in a filter circuit requires uses only the exterior e circuit nodes. Calculating the frequency dependence of the MBVD circuit uses only the algebraic nodes. The interior circuit nodes 603, 604, and 605 and the algebraic nodes 607 and 609 of the two capacitors C and C.sub.0, respectively, may be reduced. The Kron reduction procedure is to set the currents for these nodes to zero and to solve for the relation of currents and voltages of the remaining nodes. The calculation proceeds in the order of nodes that do not have zeros on the diagonal. The result is a five-node reduced admittance matrix for the MBVD that has only two exterior circuit nodes and three frequency-dependent algebraic nodes, represented as:

Y 5 BVD = j .omega. ( 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 1 ) + ( 1 R 0 - 1 R 0 0 - j L - 1 R 0 C 0 - 1 R 0 1 R 0 0 j L 1 R 0 C 0 0 0 0 j LC 0 - j L j L j LC R L 0 - 1 R 0 C 0 1 R 0 C 0 0 0 1 R 0 C 0 ) . ##EQU00020##

[0111] The reduced admittance of the MBVD has the characteristic form of the sum of frequency times a diagonal unit matrix and a frequency independent complex symmetric matrix.

[0112] FIG. 7 shows a schematic diagram of the reduced admittance matrix of an MBVD 700, corresponding to the representation of the reduced admittance matrix of the MBVD above. The labels are mathematical expressions for the component values of the admittance. A label on a single node denotes that it is the value of the diagonal element. Labels on inverters 721, 722, 723, 724, and 725 are the values of the inverter. The reduction process has added frequency independent values to the .omega. on the diagonal for frequency dependent nodes. Node 708, which corresponds to R.sub.0 and C.sub.0 for the static capacitance, is directly connected to exterior nodes 701 and 702. The resistor contributes to the direct term {tilde over (Y)}.sub.ee. For the motional branch resonator corresponding to the series R, L and C in FIG. 5, only node 706 connects to the exterior nodes. Node 710 connects only to node 706.

[0113] The H is j times the algebraic node submatrix of the frequency-independent part of the reduced admittance. The eigenvalues of H are

E .+-. = .+-. 1 LC - ( R 2 L ) 2 + jR 2 L .ident. .+-. 1 LC e .+-. j .THETA. ; E 3 = j R 0 C 0 ##EQU00021##

The first two eigenvalues are the resonant frequencies of the motional resonator damped by the resistor. The third eigenvalue is the exponential decay rate for the static capacitance R.sub.0, C.sub.0 part of the circuit. The right eigenvectors for an MBVD can be expressed in terms of loss angle .theta.:

V = ( 1 1 + e 2 j .THETA. 1 1 + e - 2 j .THETA. 0 - e j .THETA. 1 + e 2 j .THETA. e - j .THETA. 1 + e - 2 j .THETA. 0 0 0 1 ) ##EQU00022##

The eigennodes are linear superpositions of the original algebraic nodes. For a lossless MBVD, the angle .theta. is zero, and the eigennodes are orthonormal. For lossy circuits, the eigennodes in general are not orthonormal.

[0114] FIG. 8 shows a schematic diagram of the admittance matrix after diagonalization of H 800. The algebraic parts nodes 706 and 710 of FIG. 7 have been replaced by algebraic eigennodes 811 and 812. These are linear combinations of algebraic parts nodes that diagonalize H. The admittance matrix after diagonalization becomes a transversal array. That is, the algebraic eigennodes are only connected to exterior nodes by J-inverters 821, 822, 823, 824, and 825. Node 805 is already an eigennode. Eigennodes do not connect to each other.

[0115] The MBVD is only one example of the nodal analysis of the algebraic node transformation method. An infinite number of other circuits comprised of R, L, and C parts may be analyzed using algebraic node expansion and Kron reduction. They will show similar characteristics.

Numerical Evaluation of Greens Function

[0116] FIG. 9 shows a flow diagram of one method of evaluation of Green's Function to determine a circuit exterior node admittance at all frequencies, as shown in step 206 of FIG. 2. This uses Hurwitz matrix diagonalization and vectorization. The method of FIG. 9 is most suitable for small-size Hurwitz matrices.

[0117] At step 901, the Hurwitz matrix H, which as discussed above is j times the algebraic node submatrix of admittance, is diagonalized using efficient linear algebra techniques. Most of the CPU time is spent in the diagonalization. The matrix dimension N is the sum of the number of inductors and the number of capacitors. The CPU time for diagonalizing non-sparse matrices scales as N.sup.3. The memory scales as N.sup.2. Diagonalization is fast for small circuits. The exterior node admittance at one frequency is calculated as a sum over eigennodes of the Hurwitz matrix.

[0118] At step 902, the calculation over many frequency points is vectorized, i.e. a style of computer programming where operations are applied to whole arrays instead of individual elements. Multiple frequencies are calculated almost as quickly as a single frequency. A sweep of, for example, 1000 frequency points using the fast circuit spectral analysis method requires CPU time comparable to calculating a single frequency point in the conventional method.

[0119] Here, the Hurwitz matrix is diagonalized once independent of the number of frequency points. The sweep over frequencies may be vectorized and requires negligible CPU time.

[0120] At step 207, the method continues, as in FIG. 2, where the circuit exterior node admittance is transformed to a circuit scattering matrix at all frequencies of interest. For filter, duplexer, and multiplexers applications, the S matrix is a suitable design characterization. For other kinds of circuits and applications, equivalent matrix representations for circuit performance (e.g. admittance, impedance, and ABCD) may be more appropriate. For a two port device, an S-matrix is a 2.times.2 matrix containing four S-parameters, or scattering parameters. An S-matrix is a convention used to describe the performance of linear electrical networks. S(1,2) is the transfer function from port 1 to port 2 of the electronic circuit. S(1,2) is essentially the "insertion loss" of the electronic circuit with a change in numeric sign (e.g. S(1,2)=-3 dB is equivalent to an insertion loss of 3 dB). Similarly S(2,1) is the transfer function from port 2 to port 1 of the electronic circuit. S(1,1) is the reflection at port 1 and S(2,2) is the reflection at port 2. For a three port device, such as a duplexer, the S-matrix is a 3.times.3 matrix. And so on.

[0121] For large circuits, the CPU time and memory required to diagonalize the Hurwitz matrix may be too large.

[0122] FIG. 10 shows a flow diagram of another method of evaluation of Green's Function using linear algebra that may be more appropriate for intermediate size Hurwitz matrices. The goal is the same, to determine a circuit exterior node admittance at all frequencies, as shown in step 206 of FIG. 2.

[0123] At step 1001, Green's Function is evaluated by linear algebra one frequency at a time over a frequency spectrum of interest. Linear algebra methods, such as LU decomposition, are used to calculate the effect of (.omega.-{tilde over (H)}).sup.-1. The linear algebra is done one frequency point at a time, rather than array processing (or vectorizing) the frequency dependence. This will be more efficient than the conventional circuit spectral analysis method, because the work of calculating the required submatrices (such as the Hurwitz matrix and the exterior to algebraic node admittance) need only be done once regardless of the number of frequency points. However, this frequency loop is not easily vectorized, and the CPU time will scale linearly in the number of frequency points.

[0124] FIG. 11 shows a flow diagram of yet another method of evaluation of Green's Function to determine a circuit exterior node admittance at all frequencies, as shown in step 206 of FIG. 2. It uses the Kernel Polynomial Method (KPM) which is appropriate for very large sparse Hurwitz matrices for lossless circuits.

[0125] At step 1101, the Green's Function is expanded in Chebyshev Polynomial Moments. A Chebyshev moment expansion is analogous to a Fourier expansion.

[0126] At step 1102, a finite number of Chebyshev Polynomial Moments of Green's Functions are created by Hurwitz matrix on vector multiplication. This provides a truncated moment expansion. The frequency resolution improves with increasing the number of moments.

[0127] At step 1103, truncated Chebyshev Polynomial Moment Expansion of Green's Function is evaluated by Fast Fourier Transform. The Kernel in the name comes from the use of apodization (or reweighting) of the moments in the expansion to minimize the Gibbs phenomenon.

[0128] The details of the KPM are as follows. It is a method developed in quantum physics and chemistry to analyze spectra by evaluating Green's functions. Here KPM is adapted to fast circuit spectral analysis. For large sparse Hurwitz matrices it scales linearly in N for both CPU requirements and memory requirements. The analogue of the Hurwitz matrix for Green's function evaluation in quantum systems is a Hamiltonian matrix, which is Hermitian. KPM is routinely applied to physical systems whose Hamiltonian matrices have dimension of more than a billion.

[0129] KPM uses expansions of the Green's function in a polynomial series. If the eigenspectrum of the Hurwitz matrix is bounded above and below, all eigenvalues may be scaled to the range between -1 to +1. Let a hat A symbolize scaling of variables to the range of support of the polynomial. Then, there is an operator identity for the Dirac delta function,

.delta. ( .omega. ^ - H ^ ) = 1 .pi. 1 - .omega. ^ 2 [ 1 + 2 n = 1 .infin. T n ( .omega. ^ ) T n ( H ^ ) ] . ##EQU00023##

[0130] Here, the T.sub.n are Chebyshev polynomials of the first kind. This identity may be applied to generate a truncated Chebyshev polynomial expansion of the imaginary part of the Green's function (or real part of the admittance)

Y ~ ea .delta. ( .omega. ^ - H ^ ) Y ~ ae .apprxeq. 1 .pi. 1 - .omega. ^ 2 n = 0 N g n T n ( .omega. ^ ) .mu. n ; .mu. n .ident. Y ~ ea T n ( H ^ ) Y ~ ae . ##EQU00024##

[0131] The real part can be calculated from the imaginary part by the analyticity relations. The g.sub.n are apodization weights used to minimize Gibbs oscillations in truncation of a series. The Chebyshev moments .mu..sub.n are calculated by the Hurwitz matrix on vector multiplies using the Chebyshev polynomial recursion, which is a numerically stable operation. If the multiplies can be reduced to rules, the storage requirement may be only three vectors having the dimension of the Hurwitz matrix. The number of moments needed scales linearly with the inverse frequency resolution desired. Since Chebyshev polynomial expansions are truncated Fourier series, evaluation of spectra may be accomplished by fast Fourier transforms.

[0132] If the eigenvalue spectrum is unbounded, then other choices of polynomial with infinite or semi-infinite support may be preferred, such as Hermite, Laguerre and Legendre. KPM can be applied with minimal modification to the real symmetric Hurwitz matrices appropriate for large lossless circuits. The KPM needs further development to be applicable to lossy circuits.

[0133] In addition to the three (diagonalization, linear algebra, kernel polynomial) methods detailed above, there are other Green's function evaluation methods widely used in physics that may be adapted to circuit spectral analysis. A Hamiltonian matrix for quantum physics plays a similar time evolution role as the Hurwitz matrix for circuits. For example, a time series of the admittance can be generated by equating time evolution as multiplication by the exponential of the time multiplied by the Hamiltonian, as discussed above for a causal Green's function. This time series may be analyzed by Fourier methods or by Filter Diagonalization methods to calculate the exterior circuit admittance spectrum. The most appropriate numerical method will depend on the particular circuit being analyzed and the software implementation of the method.

Applications to Spectral Analysis

[0134] FIG. 12 is a graph 1200 of S-parameters for a reconfigurable SAW (surface acoustic wave) filter circuit example. The calculations use MATLAB 2016a on one core of a Lenovo laptop. This example is a reconfigurable filter project which tunes passives coupled to acoustic wave resonators to change the filter response. The model consists of an in-line ladder of eight MBVDs, ten inductors and nine capacitors. Each MBVD contains two capacitors, one inductor and two resistors. As such, the total Hurwitz matrix dimension is 43.

[0135] The MBVD parts values are taken from fits to finite element simulations of the electroacoustic properties of LiTaO.sub.3 SAW resonators, which in turn have been validated by experiment. The Y matrix is sparse. Graph 1200 shows three terms of the S matrix (in dB) of the reconfigurable SAW filter circuit vs. frequency (in MHz) calculated by the algebraic node transformation method. S(1,2) is the transfer function from port 1 to port 2 of the reconfigurable SAW filter circuit. S(1,1) is the reflection at port 1 and S(2,2) is the reflection at port 2 of the reconfigurable SAW filter circuit.

[0136] FIG. 13 shows a log-log plot 1300 of a number of frequency points versus CPU time for circuit spectral analysis methods. The data indicated with a + symbol correspond to a conventional circuit spectral analysis method in FIG. 1. It has been mexed in MATLAB (that is, accelerated by compilation in C++). Its CPU time scales linearly with the number of frequency points. The data with a o symbol labeled H&D correspond to the algebraic node transformation method using Hurwitz matrix diagonalization, as shown in FIG. 9. The data with a * symbol labeled H&LA correspond to the fast circuit spectral analysis method using the linear algebra, as shown in FIG. 10. The data with a .diamond. symbol labeled H&LU also correspond to the fast circuit spectral analysis method using the linear algebra, as shown in FIG. 10. The calculation uses LU decomposition with MATLAB's lu.m function. Neither of these linear algebra approaches using the Hurwitz matrix are processed with MATLAB's mex function. With large numbers of frequency points, the Hurwitz diagonalization code is up to 25 times more efficient than the conventional linear algebra code. A typical reconfigurable SAW filter design application would require 2000 frequency points to give 0.5 MHz resolution.

[0137] FIG. 14 shows a graph 1400 of an example of a Band 2 SAW duplexer S matrix (in dB) versus frequency (in MHz). The design consists of 29 MBVDs connected on a LiTaO.sub.3 piezoelectric substrate with aluminum metallization connecting ports. A Y matrix is modeled by a 57 port electromagnetic layout calculation. A layout matrix is a distributed part whose admittance varies slowly with frequency. For the purposes of comparing methods, it is taken to be a frequency independent reactance (or FIR). There are also two inductors connecting to exterior ports. The Hurwitz matrix dimension is the sum of three for each MBVD and one for each inductor for a total of 89. The admittance matrix is dense.

[0138] FIG. 15 is a log-log plot 1500 comparing the number of frequency points versus CPU time for various circuit spectral analysis methods. The same symbol labels are used as in FIG. 13. For the number of frequency points required for typical applications, the algebraic node transformation method using Hurwitz matrix diagonalization, shown in FIG. 9, is up to 350 times more efficient than the conventional spectral analysis methods. The algebraic node transformation method using the Hurwitz matrix with linear algebra, shown in FIG. 10, is faster than the conventional spectral analysis method by a factor of about six.

Pole Zero Analysis

[0139] `Analysis` starts with a circuit and predicts its response. `Synthesis` is the inverse process of starting with a desired response and finding circuits that can reproduce it. For example, the response function may be a scattering matrix. For each channel, the response F(s) is specified as a rational function of frequency s=j .omega., a ratio of finite order numerator polynomial P(s) and equal or higher order denominator polynomial Q(s):

F ( s ) = P ( s ) Q ( s ) ; s = j .omega. . ( 34 ) ##EQU00025##

[0140] In order for the electrical response of the circuit to be stable, the numerator and denominator polynomials must both be `Hurwitz`. This is a set of constraints on the type of polynomials. Monic polynomials may be completely specified by their roots, so the Hurwitz conditions may be restated in terms of the roots. Roots of numerator polynomials are called `zeros`. Roots of the denominator polynomial are `poles`.

[0141] Characterization of a circuit response by its poles and zeros is termed `pole zero analysis`. This is an important tool for network synthesis and characterization. Ideal components in a ladder topology circuit may be synthesized by matching poles and zeros to a continued fraction expansion of the driving point admittance. In principle, for ideal components equivalent circuit transformations enable infinite variations of circuits to be found that meet pole zero objectives.

[0142] In practice, real components are lossy and deviate from the ideal model. Realizing the pole zero objectives may be difficult. Real circuits need to be characterized. Real component parameters may need to be tuned, searched and optimized to recover pole zero objectives while maintaining realizability. The poles and zeros may also need to be optimized to minimize circuit complexity and loss with available components.

[0143] Efficient methods for extracting poles and zeros are needed for synthesis and characterization. The poles and zeros are distributed in the complex .omega.-plane. They are found by extending scattering matrix calculations to complex frequencies. Minima are zeros of numerator polynomials and maxima are poles of denominator polynomials. For the surface acoustic wave device examples considered here, the search covers a two dimensional space of real frequencies over a several hundred MHz range and imaginary frequencies in the .+-.100 MHz range. Typical searches at high resolution require S matrix evaluations at up to a million complex frequencies.

[0144] For example, FIG. 16 shows the poles and zeros extracted for the SAW duplexer example. H denotes poles from zeros of the denominator Hurwitz polynomial in common with all channels. The ports are labeled 1 for Tx, 2 for antenna and 3 for Rx. S11 denotes reflection zeros for the Tx channel, S12 denotes transmission zeros between Tx and antenna, S32 denotes transmission zeros for the Rx channel, etc. The pole zero structure is very complex, due to strong electromagnetic cross coupling in the metal on piezoelectric layout connecting the SAW resonators.

[0145] Pole zero analysis can be done either using the conventional spectral analysis method depicted in FIG. 1, or using the new spectral analysis method shown in FIG. 2. The results are identical. However, the new method is approximately two hundred times faster. On a single laptop core, a pole zero calculation takes less than a second of cpu time. The conventional method requires minutes. Such orders of magnitude increase in speed enables real time synthesis, in which a change in component parameters instantaneously changes a display of poles and zeros.

[0146] For large numbers of frequency points, these examples demonstrate an orders of magnitude improvement in speed for the algebraic node transformation method compared to the conventional spectral analysis method. The details of the performance comparison between methods will depend on the specific circuit, the specific software and hardware implementation, and the specific needs of the application.

Extensions of Algebraic Node Transformations

[0147] Applications of the algebraic node transformation method are not limited to the spectral analysis of circuits, and indeed they are not limited to circuits. They are generally applicable to linearly time invariant (LTI) systems, which are important in such diverse areas as control systems, seismology, mechanical filters, acoustics, etc.

[0148] The method expands nodal analysis to `algebraic nodes` which separate the frequency variable from component variables. Algebraic nodes are created by assembling standard system components from more elemental unit components. Then interior nodes connecting standard components are reduced. The result is a transformation of nodal analysis from interior nodes to algebraic nodes, which is better suited for fast computation over many frequency points.

[0149] The method is most straightforwardly applied to any system that may be modeled as an equivalent electrical circuit. Such analogies are well developed for mechanical, magnetic, acoustic, optical, and hydraulic networks. They work where the network can be assembled by connecting discrete and linear components, analogous to lumped elements. Particularly useful is the ability of network analysis to synthesize a network to meet a prescribed frequency response, such as a filter. When multiple types of components are assembled into a network, electrical analogies enable the entire system to be represented in a unified, coherent way. Equivalent circuits are useful to model transducers, sensors and actuators that cross between energy types. Electrical analogies also exist in mathematics, for example, the solution of inhomogeneous differential equations.

[0150] The analogies are developed by finding relationships between variables in one domain that have a mathematical form identical to variables in the electrical domain. For example, two analogies are widely used for mechanical systems: the impedance analogy and the mobility analogy. The impedance analogy makes force and voltage analogous while the mobility analogy makes force and current analogous. A second variable must be chosen to make pairs of power conjugate variables analogous. When multiplied together they have units of power. In the impedance analogy this results in force and velocity being analogous to voltage and current respectively. The ratio of power conjugate variables, such as force/velocity, is analogous to electrical impedance. The mobility analogy preserves the topology of networks instead of impedances. A mechanical network diagram can have the same topology as its analogous electrical network diagram.

[0151] The node expansion and reduction process uses concepts that have analogies in other disciplines. An electrical engineer may recognize that G has features characteristic of an impulse response function. In other disciplines, labels for similar formula are causal Green's function, transfer function, propagator, linear response, and resolvent operator. A system with interior degrees of freedom is responding linearly to an exterior interaction. In the RLC circuit example, exterior interaction is represented by Y.sub.ea with the frequency variable w replaced by algebraic nodes `a`.

[0152] The Cauchy principal value integral relation between real and imaginary parts also appears in a variety of disciplines using different names. The labels include dispersion relations, the Kramers Kronig relations, the Hilbert transform, and the Sokhotski-Plemelj theorem. These analyticity properties are a consequence of requirements that Fourier transforms to time be real and the time evolution be causal. Sum rules, analyticity and positive definite properties have proven to be helpful constraints in the analysis of incomplete experimental data. They may hold even if the data come from a poorly characterized system, and thus they are useful for statistical inference.

[0153] Node expansion and reduction is not limited to spectral analysis and the frequency variable .omega.. For example, a different ordering of nodal expansions and reductions may be applied to efficiently analyze loss in an RLC circuit. Expand from elementary circuit components as before. Then reduce all internal nodes except the shunt resistor nodes, labeled `g`. The resulting block matrix form of the admittance is

Y = ( 0 0 0 G ) + ( Y ee Y eg Y ge Y gg ) . ##EQU00026##

[0154] Here G is the diagonal conductance matrix for shunt resistors. All submatrices are .omega. dependent but not loss dependent. They are purely imaginary and reactive. They can be calculated once as lossless circuits regardless of the loss distribution. Such calculations may use the very efficient spectral analysis methods with algebraic nodes introduced here. The final step is reduction of shunt resistor nodes to yield the exterior admittance with loss. Such node reordering may accelerate calculation of loss effects in circuit design.

[0155] The node expansion and reduction method may be applied to many other combinations of circuit nodes. The appropriate choice of node reduction order depends on the circuit features of interest. The method is equally applicable to impedance analysis of circuits. There should also be analogues for mesh analysis, which is the complement of nodal analysis.

[0156] Analogies suggest further extensions of the node expansion and reduction method. For example, spatial variation is important to distributed components such as a transmission line. There is a Fourier transform wavenumber variable k that is conjugate to space. Calculation of the wavenumber dependence of the admittance for distributed components may be accelerated by similar node expansion and reduction techniques. However, no causality properties are required for wavenumber, so the matrices will not necessarily be Hurwitz.

[0157] However, the analogies are imperfect, and therefore potentially misleading. Consider quantum mechanics. The systems are lossless. The norm in Hilbert space is a complex conjugate transpose inner product. The time evolution matrix H is called the Hamiltonian. H is Hermitian. Its eigenvalues are real. They are related to energy by Planck's constant E= .omega..

[0158] Circuits have profoundly unique features. Circuits are typically lossy. The norm in nodal space is a non-conjugate transpose inner product. The time evolution matrix Y.sub.aa is complex symmetric and satisfies Hurwitz stability conditions. Its eigenvalues are complex conjugate pairs or real. There is no analogue of Planck's constant for circuits.

[0159] Coupling matrix methods for microwave filter design use a mathematical form analogous to the algebraic node expansion of the admittance matrix (See, e.g., Cameron, et al, Microwave Filters for Communication Systems). The coupling matrix model captures the frequency dependence near bandpass of resonators in a lossless filter circuit. It is an important tool for network synthesis, especially in microwave engineering. The analogue to .omega. is a low pass frequency variable .OMEGA. .varies. .omega./.omega..sub.0-.omega..sub.0/.omega. where .omega..sub.0 is a bandpass center frequency. Algebraic nodes are analogous to shunt resonators. Interior nodes are analogous to non-resonant nodes.

[0160] However, coupling matrix methods apply only to resonators. They approximate lossless inductors and capacitors LC as Frequency Independent Reactances (FIRs). This incorrect frequency dependence violates complex variable analysis properties of LC components. FIR approximation can be matched exactly to LC circuits at only one frequency. Fidelity between the coupling matrix model and its LC realization degrades away from the matching frequency. FIR approximation has not been extended to systems with loss due to resistors R.

[0161] The node expansion and reduction method captures the correct frequency dependence of RLC circuits.

Claims

1. A spectral analysis method for determining performance of an electronic circuit, comprising: receiving a list of parts for the electronic circuit; determining a part admittance matrix with algebraic nodes for each part; determining a circuit admittance matrix for exterior nodes, interior nodes, and algebraic nodes based on the part admittance matrices; reducing interior nodes of the circuit admittance matrix for exterior nodes, interior nodes, and algebraic nodes to determine a circuit admittance matrix for exterior nodes and algebraic nodes; reducing algebraic nodes to transform the circuit admittance matrix for exterior nodes and algebraic nodes into a Green's Function; evaluating the Green's Function to determine a circuit exterior node admittance matrix over a frequency spectrum; and transforming the circuit exterior node admittance matrix to a circuit scattering matrix that characterizes the performance of the electronic circuit over the frequency spectrum.

2. The method of claim 1, wherein evaluating the Green's Function to determine the circuit exterior node admittance matrix comprises: diagonalizing a Hurwitz matrix of the Green's Function to determine a circuit exterior node admittance matrix; and vectorizing a frequency calculation over the circuit exterior node admittance matrix.

3. The method of claim 1, wherein evaluating the Green's Function to determine the circuit exterior node admittance matrix comprises: evaluating Green's Function by linear algebra one frequency at a time over the frequency spectrum to determine the circuit exterior node admittance matrix.

4. The method of claim 1, wherein evaluating the Green's Function to determine the circuit exterior node admittance matrix comprises: expanding the Green's Function in Chebyshev Polynomial Moments; creating truncated Chebyshev Polynomial Moments of the Green's Function by Hurwitz Matrix on vector multiplication of the Chebyshev Polynomial Moments; and evaluating truncated Chebyshev Polynomial Moments expansion of the Green's Function by Fast Fourier Transform to determine the circuit exterior node admittance matrix.

5. The method of claim 1, wherein evaluating the Green's Function to determine the circuit exterior node admittance matrix comprises: time evolution of the exterior node to algebraic node admittance using an exponential of a Hurwitz matrix; and Fourier transform of the time series to generate the spectrum.

6. The method of claim 1, wherein evaluating the Green's Function to determine the circuit exterior node admittance matrix comprises: time evolution of exterior node to algebraic node admittance using an exponential of a Hurwitz matrix; and filtering diagonalization of the time evolution to generate the circuit exterior node admittance matrix.

7. The method of claim 1 further comprising modeling a non-electronic system as an equivalent circuit prior to determining the parts admittance matrix.

8. The method of claim 1, wherein the Green's Function has a spectral dependence on a Hurwitz matrix.