Network Synthesis Intro

Network synthesis is the process of designing a physical circuit that realizes a given mathematical specification, such as a driving point impedance or a transfer function. This is the reverse of network analysis and forms the theoretical foundation for filter design, impedance matching, and signal processing hardware implementation. GATE and university examinations test this topic heavily through Hurwitz polynomials and realizability conditions.

Core Concept: Analysis Versus Synthesis

In network analysis, a circuit with known element values is given and the objective is to determine its response: voltages, currents, impedance, or transfer function. This is a forward problem. In network synthesis, the problem is reversed: a desired mathematical function (impedance, admittance, or transfer function) is specified, and the goal is to find a physical network of passive elements that realizes this function exactly.

Not every mathematical function can be realized as a physical passive network. The function must satisfy specific mathematical conditions related to passivity and stability. These conditions are captured through the concepts of Hurwitz polynomials and positive real functions. Synthesis theory tells us both whether a function is realizable and how to systematically construct the circuit that realizes it.

A key point is that synthesis is not unique: the same driving point function may be realized in multiple different circuit topologies, such as Foster Form I, Foster Form II, Cauer Form I, or Cauer Form II. Each realization uses the same element values rearranged in different ladder or partial-fraction expanded forms.

Mathematical Expression: Hurwitz Polynomials

A Hurwitz polynomial is a polynomial P(s) with real coefficients whose roots (zeros) all lie in the left half of the complex s-plane (LHP), meaning the real parts of all roots are strictly negative. A polynomial with roots on the imaginary axis (pure imaginary roots) is called a modified Hurwitz polynomial. Hurwitz polynomials are critical because the denominator of a stable driving point function must be Hurwitz: this ensures that the network's natural frequencies correspond to decaying or oscillatory (not growing) responses.

The standard test for a Hurwitz polynomial involves the continued fraction expansion. Given P(s), split it into even part m(s) and odd part n(s): P(s) = m(s) + n(s). The polynomial is Hurwitz if and only if the continued fraction expansion of m(s)/n(s) (or n(s)/m(s)) yields all positive quotient coefficients. This procedure is directly used in Cauer synthesis to extract element values.

For a polynomial of degree n, the Hurwitz test using Routh's array provides an alternative verification method. All elements in the first column of the Routh array must be positive for the polynomial to be Hurwitz. Missing terms in a polynomial (zero coefficients for intermediate powers of s) are an immediate indicator that the polynomial is NOT Hurwitz.

Practical Understanding

The importance of Hurwitz polynomials in synthesis comes from their direct connection to physical realizability. A passive network stores and dissipates energy but cannot generate it. This physical constraint translates into the mathematical requirement that the driving point impedance Z(s) must be a positive real (PR) function. One of the necessary conditions for Z(s) = P(s)/Q(s) to be positive real is that both P(s) and Q(s) must be Hurwitz polynomials.

In filter design, the synthesis process starts from a transfer function specification (such as a Butterworth or Chebyshev filter response), derives the driving point impedance, verifies its positive realness, and then applies one of the systematic synthesis methods (Foster or Cauer) to extract the physical LC, RC, or RL network. The Hurwitz check is always the first gate that a proposed function must pass.

Numerical Example

To verify whether a given polynomial is Hurwitz, perform the continued fraction expansion of its even-to-odd ratio and check that all quotients are positive. The example below demonstrates this for a simple cubic polynomial.

Given:
P(s) = s³ + 2s² + 3s + 4

Why this formula applies:
Split into even m(s) and odd n(s) parts, then expand m(s)/n(s) as continued fraction.
All positive quotients → Hurwitz.

Formula:
P(s) = m(s) + n(s)
m(s) = even terms = 2s² + 4
n(s) = odd terms = s³ + 3s

Substitution:
Compute n(s)/m(s):
(s³ + 3s)/(2s² + 4)

Calculation:
Step 1: (s³ + 3s) ÷ (2s² + 4)
Quotient q1 = s/2, Remainder = (3s - 2s) = 2s
Actual: s³/2s² = s/2; (s³+3s) - (s/2)(2s²+4) = s³+3s - s³ - 2s = s
Remainder r1 = s

Step 2: (2s² + 4) ÷ s
Quotient q2 = 2s, Remainder = 4

Step 3: s ÷ 4
Quotient q3 = s/4, Remainder = 0

All quotients: q1 = 1/2, q2 = 2, q3 = 1/4 → All positive

Final Answer:
P(s) = s³ + 2s² + 3s + 4 IS a Hurwitz polynomial.
All roots lie in the left half plane.

Exam Tip: A necessary (but not sufficient) condition for a Hurwitz polynomial is that all coefficients must be present and positive. If any coefficient is zero or negative, the polynomial is immediately NOT Hurwitz. This quick check eliminates wrong options in GATE MCQs.

Mechanism: Key Properties

• Network synthesis is the inverse of analysis: given a mathematical function, find the physical circuit that realizes it.
• A Hurwitz polynomial has all roots strictly in the left half of the s-plane. A modified Hurwitz polynomial may also have roots on the imaginary axis (purely reactive networks like LC).
• Necessary condition for Hurwitz: all coefficients of the polynomial must be present (non-zero) and positive. This is a quick screening test.
• The continued fraction expansion of m(s)/n(s) must yield all positive quotient coefficients for the polynomial to be Hurwitz. Each quotient corresponds to one element value in the Cauer realization.
• Synthesis realizability requires the driving point function to be a Positive Real function. Hurwitz denominators are a necessary part of this condition.
• Multiple realizations are possible for the same function: Foster I, Foster II, Cauer I, Cauer II. All are valid but use different circuit topologies.

Quick Revision

• Synthesis: given Z(s) or H(s), find the physical R, L, C circuit. Analysis goes in the reverse direction.
• Hurwitz polynomial: all roots in open left half s-plane. All coefficients positive and present.
• Modified Hurwitz: roots allowed on imaginary axis as well. Used for LC networks (lossless).
• Continued fraction test: expand m(s)/n(s); all quotients must be positive for Hurwitz condition.
• Trap: a polynomial with all positive coefficients is NOT necessarily Hurwitz; the continued fraction test must be performed.
• Trap: a polynomial with any missing or negative coefficient is immediately NOT Hurwitz.
• Hurwitz condition on denominator of Z(s) is necessary but not sufficient for positive realness.