Symbolic circuit analysis

Symbolic circuit analysis is a formal technique of circuit analysis to calculate the behaviour or characteristic of an electric/electronic circuit with the independent variables (time or frequency), the dependent variables (voltages and currents), and (some or all of) the circuit elements represented by symbols.^[1]^[2]

When analysing electric/electronic circuits, we may ask two types of questions: What is the value of certain circuit variable (voltage, current, resistance, gain, etc.) or what is the relationship between some circuit variables or between a circuit variable and circuit components and frequency (or time). Such relationship may take the form of a graph, where numerical values of a circuit variable are plotted versus frequency or component value (the most common example would be a plot of the magnitude of a transfer function vs. frequency).

Symbolic circuit analysis is concerned with obtaining those relationships in symbolic form, i.e., in the form of analytical expression, where the complex frequency (or time) and some or all of the circuit components are represented by symbols.

Frequency domain expressions

In the frequency domain the most common task of symbolic circuit analysis is to obtain the relationship between input and output variables in the form of a rational function in the complex frequency $\mathit{s}\,$ and symbolic variables $\mathbf {x}$ :

T(s,\mathbf{x})=\frac{N(s,\mathbf{x})}{D(s,\mathbf{x})}

The above relationship is often called the network function. For physical systems, $N(s,\mathbf{x})$ and $D(s,\mathbf{x})$ are polynomials in $\mathit{s}\,$ with real coefficients:

T(s,\mathbf{x})=\frac{\displaystyle \sum_{i=0}^n a_i(\mathbf{x}) s^i}{\displaystyle \sum_{i=0}^m b_i(\mathbf{x}) s^i}=K\frac{\displaystyle \prod_{i=1}^n (s-z_i(\mathbf{x}))}{\displaystyle \prod_{i=1}^m (s-p_i(\mathbf{x}))}

where $z_i(\mathbf{x})$ are the zeroes and $p_i(\mathbf{x})$ are the poles of the network function; $m \geqslant n$ .

While there are several methods for generating coefficients $a_i(\mathbf{x})$ and $b_i(\mathbf{x})$ , no technique exists to obtain exact symbolic expressions for poles and zeroes for polynomials of order higher than 5.

Types of symbolic network functions

Depending on which parameters are kept as symbols, we may have several different types of symbolic network functions. This is best illustrated on an example. Consider, for instance, the biquad filter circuit with ideal op amps, shown below. We want to obtain a formula for its voltage transmittance (also called the voltage gain) in the frequency domain, ${T_v(s) = V_{out}(s)/V_{in}(s)}\,$ .

Figure 1: Biquad circuit with ideal opamps. (This diagram was created using the schematic capture feature of SapWin.)

Network function with s as the only variable

If the complex frequency $\mathit{s}\,$ is the only variable, the formula will look like this (for simplicity we use the numerical values: $R_i=i, C_i = 0.01i\,$ ):

T(s)=\frac{3.48s}{13.2s^2+1.32s+0.33}

Semi-symbolic network function

If the complex frequency $\mathit{s}\,$ and some circuit variables are kept as symbols (semi-symbolic analysis), the formula may take a form:

$\begin{align} T(s,\mathbf{x})&=\frac{1.74C_2s}{6.6C_1 C_2 s^2+0.66C_2 s+0.33} \\ \mathbf{x}&=[C_1~C_2] \end{align}$

Fully symbolic network function

If the complex frequency $\mathit{s}\,$ and all circuit variables are symbolic (fully symbolic analysis), the voltage transmittance is given by (here $G_i = 1/R_i \,$ ):

$\begin{align} T(s,\mathbf{x})&=\frac{G_4 G_6 G_8 C_2s}{G_6 G_{11} C_1 C_2 s^2+G_1 G_6 G_{11} C_2 s+G_2 G_3 G_5 G_{11}} \\ \mathbf{x}&=[C_1~C_2~G_1~G_2~G_3~G_4~G_5~G_6~G_8~G_{11}] \end{align}$

All expressions above are extremely useful in obtaining insight into operation of the circuit and understanding how each component contributes to the overall circuit performance. As the circuit size increases, however, the number of terms in such expressions grows exponentially. So, even for relatively simple circuits, the formulae become too long to be of any practical value. One way to deal with this problem is to omit numerically insignificant terms from the symbolic expression, keeping the inevitable error below the predetermined limit.^[3]

Sequence of Expressions form

Another possibility to shorten the symbolic expression to manageable length is to represent the network function by a sequence of expressions (SoE).^[4] Of course, the interpretability of the formula is lost, but this approach is very useful for repetitive numerical calculations. A software package STAINS (Symbolic Two-port Analysis via Internal Node Suppression) has been developed to generate such sequences.^[5] There are several types of SoE that can be obtained from STAINS. For example, the compact SoE for $T_v(s)\,$ of our biquad is

x1 = G5*G3/G6
x2 = -G1-s*C1-G2*x1/(s*C2)
x3 = -G4*G8/x2
Ts = x3/G11

The above sequence contains fractions. If this is not desirable (when divisions by zero appear, for instance), we may generate a fractionless SoE:

x1 = -G2*G5
x2 = G6*s*C2
x3 = -G4*x2
x4 = x1*G3-(G1+s*C1)*x2
x5 = x3*G8
x6 = -G11*x4
Ts = -x5/x6

Yet another way to shorten the expression is to factorise polynomials $N(s,\mathbf{x})$ and $D(s,\mathbf{x})$ . For our example this is very simple and leads to:

Num = G4*G6*G8*s*C2
Den = G11*((G1+s*C1)*G6*s*C2+G2*G3*G5)
Ts = Num/Den

For larger circuits, however, factorisation becomes a difficult combinatorial problem and the final result may be impractical for both interpretation and numerical calculations.

References

↑ G. Gielen and W. Sansen, Symbolic Analysis for Automated Design of Analog Integrated Circuits. Boston: Kluwer Academic Publishers, 1991.
↑ Labrèche P., presentation: Linear Electrical Circuits:Symbolic Network Analysis, 1977
↑ B. Rodanski, M. Hassoun, "Symbolic Analysis," in The Circuits and Filters Handbook: Fundamentals of Circuits and Filters, 3rd ed., Wai-Kai Chen, Editor. CRC Press, 2009, pp. 25-1 - 25-29.
↑ M. Pierzchala, B. Rodanski, "Generation of Sequential Symbolic Network Functions for Large-Scale Networks by Circuit Reduction to a Two-Port," IEEE Transactions on Circuits and Systems - I: Fundamental Theory and Applications, vol. 48, no. 7, July 2001, pp. 906-909.
↑ L.P. Huelsman, "STAINS - Symbolic Two-Port Analysis via Internal Node Suppression," IEEE Circuits & Devices Magazine, March 2002, pp. 3-6.

This article is issued from Wikipedia - version of the 8/24/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.