Lattice delay network

Lattice delay networks are an important subgroup of lattice networks. They are all-pass filters, so they have a flat amplitude response, but a phase response which varies linearly (or almost linearly) with frequency. All lattice circuits, regardless of their complexity, are based on the schematic shown below, which contains two series impedances, Za, and two shunt impedances, Zb. Although there is duplication of impedances in this arrangement, it offers great flexibility to the circuit designer so that, in addition to its use as delay network (as featured here) it can be configured to be a phase corrector, a dispersive network, an amplitude equalizer, or a low pass (or bandpass) filter, according to the choice of components for the lattice elements. It is shown in Lattice networks that when a lattice is configured as a delay network, it has a characteristic impedance which is resistive (= Ro), its impedances Za and Zb are dual impedances, i.e. Za&sdot;Zb = Ro2 (or Za/Ro = Ro/Zb) and Za and Zb consist of inductors and capacitors. Such a lattice is a constant resistance network and an all-pass filter, and it has a phase response determined by the properties of Za. This makes it ideal as a delay device because it can be included in a cascade of other filter sections without affecting the overall amplitude response, nor will it create mismatch problems, but it will increase the phase slope (i.e. the delay) of the overall assembly.

In order to achieve a desired delay, it is necessary to choose specific components for Za and Zb, and the design methods to do this are given in later sections. However, regardless of the method used, networks only achieve a constant delay over a finite band of frequencies, so if an increase in bandwidth and/or delay is required, more complex solutions for Za and Zb are necessary. Normally Za and Zb are lumped element impedances, suitable for networks operating at audio or video frequencies but operation up to v.h.f. and even u.h.f. is also possible. Sometimes, the design procedures can result in Za and Zb being highly complicated networks, but it is always possible to derive a cascade of simpler lattices with identical electrical characteristics, should that be preferred.

A lattice delay section has twice the delay of a comparable ladder filter section, and this helps to mitigate concerns over component duplication. In any case, a lattice configuration can be converted to an unbalanced equivalent, which will reduce the component count and permit some relaxation of component tolerances. Consequently, lattice delay sections, or their bridged T circuit equivalents, are able to provide substantial time delays in a compact physical form and they make efficient use of their operational bandwidth. Although there are other ways of achieving signal delays, such as by a long length of coaxial cable, or by lumped element ladder networks, such solutions have either greater physical bulk, or they make inefficient use of a frequency band, or they have poor phase linearity.

Design methods for lattice delays
Initially, the designs for lattice delays were based on image theory in which the aim was to simulate a finite length of transmission line. Later, network synthesis methods were introduced.

A commonly chosen response for the delay network is the maximally flat group delay characteristic. This delay response is ripple free and is perfectly smooth over the passband, only deviating from the mean value as the band edge is reached. Initially, such a response might be thought to be ideal for a delay network, but it is not necessarily the most efficient and in order to achieve a wider bandwidth, for a given delay, a higher order network is required. However, some increase in bandwidth is also possible, without increasing circuit complexity, by considering alternative characteristics, where the phase and group delay responses are allowed to ripple within the passband ’. There are several design procedures available by which a desired linear-phase approximation can be achieved, whether maximally-flat or with ripple. These methods include techniques from image theory, by the Potential Analog method, and by a Taylor expansion of a group delay, all of which are described in the following sections.

In situations where a balanced network is not appropriate, a single ended circuit operating with a ground plane is required. In such cases, the conversion of a lattice into a bridged T circuit is carried out, as described in the article Lattice network. The resulting unbalanced network has the same electrical characteristics as the balanced lattice network on which it is based. An example of this procedure is given in a later section.

Networks derived from image theory
An ideal delay line characteristic has constant attenuation and linear phase variation, with frequency, i.e. it can be expressed by
 * $$ T(p) = e^{-p \tau}$$

where τ is the required delay.

As shown in lattice networks, the series arms of the lattice, za, are given by
 * $$ z_a = \frac{1}{z_b} = \frac{1-T(p)}{1+T(p)} \qquad \text{so} \qquad z_a = \frac{1-e^{-p\tau}}{1+e^{-p\tau}}= \tanh \left (\frac{p\tau}{2} \right ) $$

More generally, for lattice circuits having a delay τ secs., with a characteristic impedance Zo, the expressions for Za and Zb are given by $$ Z_a = Z_0\tanh \left ( \frac{p \tau}{2} \right ) \quad \text{and} \quad Z_b = Z_0\coth \left ( \frac{p \tau}{2} \right )\quad \text{ where }\quad Z_a\cdot Z_b = Z_0^2 $$

As e−x and tanh(x) are not rational functions, exact solutions for za and zb are not possible, so some form of approximation has to be used.

Continued fraction approximation
A continued fraction expansion of tanh(x)  is


 * $$ \tanh(x)= \cfrac{1}{ \cfrac{1}{x} + \cfrac{1}{ \cfrac{3}{x} + \cfrac{1}{ \cfrac{5}{x} + \cfrac{1}{ \cfrac{7}{x} + \cdots}}}}$$

So, for a network with 1sec delay, za can be written


 * $$ z_a(p) = \tanh \left ( \frac{p}{2} \right ) = \cfrac{1}{1\cdot \cfrac{2}{p} + \cfrac{1}{3\cdot \cfrac{2}{p} + \cfrac{1}{5\cdot \cfrac{2}{p} + \cfrac{1}{\cdots}}}} $$

An exact solution requires an infinite number of terms, but an nth order approximation is obtained by terminating za after n elements. (If the last component retained is a capacitor, the remainder of the network is replaced by a short circuit). So, for example, terminating this expression after six terms will give a sixth order delay, which can be synthesised directly by Cauer’s methods to give the network shown.



A circuit for zb can easily found from this solution, since it is the dual of za, and is



Although this circuit of zb was easy to derive, it is not necessarily the most ideal. If an unbalanced equivalent circuit of the lattice is ultimately required, it would be better if zb started with a series inductor (see Lattice networks). To do this it is first necessary to multiply out the continued fraction expansion for za, for this example, to give za (and zb in particular) as a ratio of polynomials in p. This is


 * $$z_a(p)= \frac{24p^5+10080p^3+332640p}{p^6+840p^4+75600p^2+665280}= \frac{1}{z_b(p)}$$

and for the alternative Cauer I expansion proceeds as follows


 * $$ z_b= \frac{1}{42}p+Z_1(p) \quad \text{where} \quad Y_1(p)= \frac{1}{Z_1(p)}= \frac{42p^5+10080p^3+332640p}{600p^4+67680p^2+665280} $$


 * $$ Y_1(p)= \frac{42}{600}p+Y_2(p) \quad \text{where} \quad Z_2(p)= \frac{1}{Y_2(p)}= \frac{600p^4+67680p^2+665280}{5342.4p^3+286070.4p}$$

and so on, until the network shown below is obtained.



Further details of lattice circuits, using these impedances, are considered in the examples section, later.

Now, as shown in Lattice networks, the transfer function of this lattice is given by


 * $$T(p)= \frac{1-z_a}{1+z_a}$$

so


 * $$T(p)= \frac{p^6-42p^5+840p^4-10080p^3+75600p^2-332640p+665280}{p^6 + 42p^5 + 840p^4 + 10080p^3 + 75600p^2+332640p+665280}$$

From this the phase plot for this sixth-order all-pass function can be calculated and is given below.



This response is the same as that of the maximally flat delay which is derived in a later section. (In fact, the derivations of za by the continued fraction method result in family of lattices all of which have a maximally flat group delay characteristic). The phase error plot (i.e. the deviation of the response from linear) of this response can be found in the section on maximally flat delay networks, where the responses of networks of several orders are given.

Networks derived using the potential analogue method
The potential analogue method was proposed by Darlington as a simple way to choose pole-zero positions for delay networks. The method allows the designer to implement a delay characteristic by locating poles and zero on the complex frequency plane intuitively, without the need for complicated mathematics or the recourse to reference tables.

Other analogue methods, which were devised to aid the designer to choose the pole zero positions for his networks, include the "rubber sheet model" and the "electrolytic tank". and Teledeltos paper

Darlington’s procedure starts by considering the field between the two plates of a parallel plate capacitor. The field is uniform within the plates and only deviates from linear beyond the extremities of the plates. In order to increase the length over which the field is uniform, the length of the plates is increased, as required. The next step is to replace the uniform plates by uniformly spaced charged filaments, which give the same field, but may result in a ‘granularity error’ (or ripple). Finally, the equivalent electrical network is obtained by replacing the localised filament charges by poles and zeros, where the group delay characteristic corresponds to the electric field in the potential analogue.

A typical arrangement of poles and zeros to give, nominally, an electrical circuit with constant group delay follows the pattern shown in the figure below (see also Stewart ). The poles and zeros lie in two lines, of finite length, parallel to the jω axis at a distance ‘a’ from it. Also, they are spaced apart at a distance ‘b’ from each other in the jω direction.

In general, Darlington showed that the group delay and the granularity effect are given by


 * $$ \text{GD} = -\frac{d \phi}{d \omega}=\frac{2\pi}{b} \pm \frac{4\pi}{b}\exp \left ( - \frac{2 \pi a}{b} \right )\cos \left ( \frac{2\pi \omega}{b} \right ) $$

A good approximation to a unit delay characteristic is obtained by putting a = b = 2$\pi$ (a value which is easily remembered). However, the delay ripple (granularity) that results, when using these values of a and b, is rather high at ±8% and a better choice for a is 4.4 (= 1.4π) which gives a ripple a lower ripple of ±2.5%. The plots shown below, are for networks with increasing numbers of poles and zeros, for a = 4.4 and b = 2π. The order ‘n’ corresponds to the number of pole-zero pairs present in the network.



For frequencies beyond the end of the pole zero pattern, the group delay suffers a truncation error, but the band edge performance of a characteristic can be improved, by repositioning the outer poles and zeros slightly, to compensate for this sudden termination of the pattern. Darlington discusses this in his article.

The networks can be realised as a cascade of second order lattices (or their bridged-T equivalents) by allocating a complex conjugate quad of poles and zeros to each section of the cascade (as outlined in Lattice networks). The current example does not have a pole-zero pair located on the real axis, so a first order network is not required.

Networks with a maximally flat group delay characteristic
The general expression for the transfer function of a low pass filter network is given by


 * $$T(p)= \frac{1}{p^n+a p^{n-1}+b p^{n-2}+c p^{n-3}+d p^{n-4}+\cdots} $$

The group delay characteristic for this expression can be derived as a power series expansion in ω about zero frequency (i.e. a MacLaurin series). This is described as a maximally flat characteristic when as many as possible of the coefficients of ω in the power series equate to zero, by appropriate choice of values for a, b, c, d, etc. In deriving this characteristic, little regard is paid to the resulting amplitude response of the low pass filter. (In fact, it approximates to a Gaussian shape).

The time delay for a low-pass network, of order n, with the required characteristics to be maximally flat is given by


 * $$ t_d = - \frac{d \phi}{d \omega} = t_0 \frac{b_0+b_1 \omega^2+b_2 \omega^4+\cdots+b_{n-1} \omega^{2n-1}}{b_0 + b_1 \omega^2 + b_2 \omega^4+ \cdots + b_{n-1} \omega^{2n-1}+b_n \omega^{2n}} $$

where the first (n-1) coefficients of the denominator equal to the corresponding coefficients of the numerator. In this case, when the MacLaurin series for td is derived, by dividing the denominator into the numerator, the result is:


 * $$ t_d = t_0 \left ( 1 - \frac{b_n}{b_0} \omega^{2n} + \frac{b_1 b_n}{b_0^2} \omega^{2n+2} - \cdots \right ) $$

with the first (n &minus; 1) derivatives of td (considered as a function of ω2) at ω = 0 all equal to zero. In this particular expression, the maximally flat response is of order n.

With the maximally flat characteristic, the delay remains constant, equal to the zero-frequency value, over a finite range of frequencies, but beyond this range the delay decreases smoothly with increasing frequency. Higher order networks have a wider bandwidth.

All-pass networks are obtained when zeros are introduced into the right hand half of the complex frequency plane, at locations which are the mirror images of the left hand poles. Such a procedure solves the problem of poor passband responses of the low pass filters, with the added bonus that the resulting networks have the constant resistance property. The general response for the all-pass circuit with maximally flat delay is given by

$$T(p)= \frac{p^n-a p^{n-1}+b p^{n-2}-c p^{n-3}+d p^{n-4}-e p^{n-5}+\cdots}{p^n+a p^{n-1} + b p^{n-2} + c p^{n-3} + d p^{n-4} + e p^{n-5}+\cdots} $$

Introducing zeros, in this way, gives double the delay of an all-pole low pass filter, but the phase characteristic still retains the desired maximally flat feature. The circuit can be realized as a single lattice network, or a cascade of low order lattices, as shown later in some examples, as in lattice networks.

As an example of how a typical derivation proceeds, consider a 6th order low pass filter function. Its transfer function T(p) is given by


 * $$ T(p) = \frac{1}{p^6+a p^5+b p^4+c p^3+d p^2+e p+f} $$

The aim is to determine values for a, b, c, d, e, and f so that the group delay of the function is maximally flat.


 * $$\text{Now } \quad T(j \omega) = \frac{1}{(f - d\omega^2 + b\omega^4 - \omega^6) +j \omega (e - c\omega^2 +a\omega^4)} $$

And the phase response of the function is φ, where


 * $$\phi = \arg(t) = \arctan \left[ \frac{\omega (e - c\omega^2 + a\omega^4)}{f - d\omega^2 + b\omega^4 - \omega^6} \right ] $$

where


 * $$ u = \omega (e - c\omega^2 + a\omega^4 \qquad \text{so} \quad \frac{du}{d \omega} = e - 3c\omega^2 + 5a\omega^4 $$

and


 * $$v = f - d\omega^2 + b\omega^4 - \omega^6 \qquad \text{so} \quad \frac{dv}{d \omega} = -2d\omega + 4b\omega^3 - 6\omega^6 $$

The group delay is


 * $$ \text{GD} = - \frac{d \phi}{d \omega} = \frac{1}{u^2 + v^2} \left ( v\frac{du}{d \omega} - u \frac{dv}{d \omega} \right ) $$

Inserting the expressions for u and v and rearranging gives the following equation for group delay. Note that the group delay is by doubled, at this point, so that the results will apply to a sixth order all-pass network, rather than for the low-pass network. Thus we have


 * $$ GD_\text{all-pass} = \frac{2[ef + (de - 3cf)\omega^2 +(cd +5af -3ad) \omega^4 + (5e +bc -3ad) \omega^6 +(ab - 3c)\omega8 + a\omega^{10}}{f^2 +(e^2 -2df) \omega^2 +(d^2 + 2bf - 2Ce) \omega^4 + (c^2 + 2ae -2f - 2bd) \omega^6 + (2d + b^2 -2ac) \omega^8 + (a^2 - 2b)} $$

By choosing GD = 1 when ω = 0 and equating coefficients in the numerator and denominator, six relationships for the six unknowns a, b, c, d, e, and f are obtained, which are:


 * $$ 2ef = f^2 \qquad 2(de -3cf) = e^2 -2df \qquad 2(cd +5af -3be) = d^2 +2bf - 2ce $$


 * $$ 2(5e +bc -3ad) = c^2 +2ae -2f -2bd \qquad 2(ab -3c) = 2d +b^2 -2ac \qquad 2a = a^2 -2b $$

Solving these six equations for the unknowns gives


 * $$a = 42; \quad b = 840; \quad c = 10080; \quad d = 75600; \quad e = 332640; \quad f = 665280 $$

So the sixth order all-pass filter with maximally flat delay of 1 sec. is


 * $$ T(p) = \frac{p^6 -42p^5 +840p^4 -10080p^3 +75600p^2 - 33260p + 665280}{p^6 +42p^5 +840p^4 +10080p^3 +75600p^2 + 33260p + 665280} $$

This expression for T(p) is identical to the one derived earlier, for a sixth order delay, by the continued fraction method.

A similar procedure can be used to determine the transfer functions of networks of all orders, that have a maximally flat time delay, although the procedure does become tedious for the higher orders. A more convenient way of deriving the coefficients of the polynomials is to note that they are based on Bessel polynomials, and the coefficients for all-pass networks are given by


 * $$ a_r = \frac{(2N - r)!}{2^{N-r} r!(N-r)!} $$

Alternatively, the values can be obtained by inspection of published tables. Note, however, that the results in most of these tables are for normalised low-pass networks (all-pole networks) of 1 second delay, so using the given coefficient values directly in an all-pass expression will result in a circuit with a delay of 2 seconds.

A selection of results, for even order all-pass networks with n = 2 to 12 are given below. For brevity, the polynomials are not given in full, only the coefficients are listed.

For these results, consider T(p) to have the form $$T(p) = \frac{N(p)}{D(p)}.$$

In the denominator polynomial D(p), all coefficients are positive, whereas in the numerator polynomial N(p), the negative values are taken for the coefficients, whenever indicated. n = 2     1;   ±6   12 n = 4     1;   ±20;   180;   ±840;   1680 n = 6     1;   ±42;   840;   ±10080;   75600;   ±332640;   665280 n = 8     1;   ±72;   2520;   ±55440;   831600;   ±8648640;   60540480;   ±259459200;   518918400 n = 10    1;   ±110;   5940;   ±20592;   504504;   ±90810720;   1210809600;   ±11762150400;   79394515200   ±335221286400   670442572800 n = 12    1;   ±156;   12012;   ±600600;   21621600;   ±588107520;   12350257920;   ±2001132771840;   2514159648000   ±23465490048000;   154872234316800;   ±647647525324800;   1295295050649600

The pole and zero locations in the complex frequency plane for these responses, obtained by factorization of the polynomials, are as follows.

n = 2    	±3.0 ±j1.7321 n = 4    	±5.7924 ±j1.7345       ±4.2076 ±j5.2548 n = 6    	±8.4967 ±j1.7350      ±7.4714 ±j5.2525      ±5.0319 ±j8.9854 n = 8    	±11.1758 ±j1.7352      ±10.4097 ±j5.2324      ±8.7366 ±j8.8289      ±5.6780 ±j12.7078 n = 10    	±13.8441 ±j1.7353      ±13.2306 ±j5.2231      ±11.9351 ±j8.770      ±9.77244 ±j12.4500      ±6.2178 ±j16.4654 n = 12    	±16.4864 ±j1.8777      ±16.0337 ±j5.1567      ±14.9063 ±j8.7335	     ±13.2282 ±j12.3580      ±10.6595 ±j16.1017      ±6.6859 ±j20.2489 The phase error plots (i.e. the deviation of the phase response from linear) for even order networks from n = 2 to 12 are given in the accompanying figure.



All of the delay characteristics can be realized as a single lattice network, or as a cascade of second-order lattices by allocating a symmetrical group (quad) of two poles and two zeros to each second-order lattice in the network, and using the relationships given in Lattice network. See ‘Examples of lattice circuits’, below, for more information on circuit realization.

Delay networks with passband phase ripple
The maximally flat response is not very efficient. It has an excellent linear phase characteristic within its operating passband, but large complex networks are needed to obtain large delays. However, by allowing the phase response to ripple within the passband, a network of a specific order can achieve a wider bandwidth, (or more delay for a given bandwidth).

The permitted level of delay ripple (or phase ripple) introduced by a circuit is very much dependent on the application in which the network is being used. In situations where waveform or pulse fidelity is important, then the permitted ripple is only small. In the case of analogue television waveforms, for example, the picture content also has a bearing on the acceptable levels of system distortion. (With TV pictures, phase ripple will give effects similar to ‘ghosting’ or multipath reception, where low level multiple images are superimposed on the main picture. Also ‘ringing’ after transient edges is another result of non-linear phase. The acceptability of the picture impairment often depends on the scene being displayed). Wheeler, using the method of "paired echoes", suggested that a phase ripple of 0.1 rads, p-p (or 6 degrees, p-p) was tolerable in TV signals. Other writers suggest that a group delay ripple of a few percent is permissible. In making a judgement of permitted distortion, limits can be set on waveform asymmetry, the level of overshoots and pre-shoots, and rise-time degradation and this is discussed in the section on ‘Transient Testing’ later.

Delay networks derived with a Chebyshev ripple
Details of pole positions for low pass networks that have group delay with a "Chebyshev ripple" characteristic across the passband, for various orders of filter and various levels of ripple have been calculated and published by Ulbrich et al. and by MacNee. The tables below, based on this data, are for all-pass networks. A filter of given order can achieve more delay and/or bandwidth if more passband phase ripple is permitted.

Pole-zero position for all-pass networks with unit mean delay and 1% group delay ripple: n = 2     ±2.759 ±j1.959 n = 4     ±3.902 ±j2.300      ±3.118 ±j6.698 n = 6     ±4.424 ±j2.539      ±4.176 ±j7.500      ±3.260 ±j12.092 n = 8     ±4.690 ±j2.681      	±4.588 ±j7.985      ±4.285 ±j13.089      ±3.324 ±j17.772 n = 10     ±4.667 ±j2.693      ±4.618 ±j8.049      ±4.493 ±j13.303      ±4.185 ±j18.432      ±3.245 ±j22.931

Pole-zero position for all-pass networks with unit mean delay and 2% group delay ripple: n = 2     ±2.619 ±j1.958 n = 4     ±3.635 ±j2.380      ±2.958 ±j6.909 n = 6     ±3.965 ±j2.620      ±3.778 ±j7.741      ±3.029 ±j12.466 n = 8     ±4.204 ±j2.739     ±4.127 ±j8.164      ±3.895 ±j13.398      ±3.099 ±j18.189 n = 10     ±4.213 ±j2.829      ±4.178 ±j8.459     ±4.086 ±j13.997      ±3.854 ±j19.319     ±3.078 ±j24.176

Pole-zero position for all-pass networks with unit mean delay and 5% group delay ripple: n = 2     ±2.427 ±j2.087 n = 4     ±3.090 ±j2.525      ±2.615 ±j7.308 n = 6     ±3.248 ±j2.731      ±3.141 ±j8.095      ±2.640 ±j13.042 n = 8    ±4.690 ±j2.681     	 ±4.588 ±j7.985      ±4.285 ±j13.089      ±3.324 ±j17.772

Pole-zero position for all-pass networks with unit mean delay and 10% group delay ripple: n = 2     ±2.187 ±j2.222 n = 4     ±2.459 ±j2.739     ±2.195 ±j7.730

A delay network can be conveniently made up of a cascade of second order lattice networks, allocating a quad of poles and zeros, from the tables above, to each section. An example of a fourth order network, with 10% group delay ripple is considered later.

Delay ripple by using infinite product approximations
An alternative form of group delay ripple, preferable to the equal amplitude Chebyshev ripple, has low amplitude ripples at low frequencies but ripples of increasing amplitude as frequency increases. This characteristic is more desirable than the Chebyshev one because the phase errors are small at low frequencies, (where the spectrum of a typical waveforms has high energy content) but can be high at higher frequencies (where the energy content of the spectrum is lower).

A suitable ripple characteristic is obtained by taking power series approximations of sinh(x) and cosh(x), rather than deriving the continued fraction expansion of tanh(x), as was done earlier. Typically, with this procedure, the ripple on the phase characteristic deviates by ±5% from the mean (linear) value.

These results are similar to those obtained by the ‘Forced Ripple Method’, where a technique of curve fitting, at a finite number of frequencies of the phase response, is employed.

For normalized networks (Zo = 1) with unit time delay, the equations for za and zb can be written


 * $$ z_a = \tanh \left ( \frac{p}{2} \right ) = \frac{\sinh(p/2)}{cosh(p/2)} \qquad \text{and} \qquad z_b = \coth \left ( \frac{p}{2} \right ) = \frac{\cosh(p/2)}{sinh(p/2)} $$

sinh(x) and cosh(x) can be represented by infinite products, and these are


 * $$ \sinh(x) = x\prod_{k=1}^ \infty \left ( 1 + \frac{x^2}{k^2 \pi^2} \right ) \qquad \text{and} \qquad \cosh(x) = \prod_{k=1}^\infty \left [ 1+ \frac{4.x^2}{(2k - 1)^2 \pi^2} \right ] $$

So, for a unit delay network


 * $$ z_a = \frac{p}{2} \frac { \left ( 1 + \frac{p^2}{4\pi^2} \right) \left ( 1 + \frac{p^2}{16. \pi^2} \right) \left ( 1 + \frac{p^2}{36\pi^2} \right )\cdots }{\left ( 1  + \frac{p^2}{ \pi^2} \right) \left (1  + \frac{p^2}{9\pi^2} \right ) \left( 1  + \frac{p^2}{25\pi^2} \right)\cdots } $$

Terminating the series after a finite number of terms gives a limited bandwidth approximation for 1sec delay. So, for example, an expression to including terms up to p4 will give a fourth order delay network. In this case, za is


 * $$ z_a = K_4\frac{4\pi^2 p + p^3}{9\pi^4 + 10. \pi^2 p^2 + p^4} \qquad \text{where} \qquad K_4 = \frac{1 \times 9 \times \pi^2}{2 \times 4} = \frac{9. \pi^2}{8} $$

which can be realized as a ladder network using Cauer’s procedure, to give the circuit below for za. As before, the dual network, zb, is easily obtained by inspection.



As already stated, the transfer function of a normalized lattice all-pass network is given by


 * $$ T(p) = \frac{1 - z_a}{1 + z_a} $$

so for the fourth order network containing the impedance za, derived by the power series expansions, is


 * $$ T(p) = \frac{p^4 - K_4 p^3 +80\pi^2 p^2 - K_4.4\pi^2 p + 9\pi^4}{p^4 + K_4 p^3 +80. \pi^2 p^2 + K_4\cdot 4\pi^2 p + 9\pi^4}  \qquad \text{where} \qquad K_4 = \frac{9\pi^2}{8} $$

This has an all-pass magnitude characteristic, with the phase response shown in the figure below.



A collection of results, for even order networks with n = 2 to 10 are given below. (As with results given earlier, the polynomials are not presented in full, only the coefficients are listed).

In these results, $$T(p) = \frac{N(p)}{D(p)}$$ where the coefficients for the numerator and denominator polynomials are listed. For the denominator, D(p), all coefficients are positive, whereas for the numerator, N(p), the negative values are taken where indicated. n = 2     1;   ±K2;   π2      where      K2 = π2/2 n = 4     1;   ±K4;   80π2;   ±4π2.K4;    9π4       where      K4 = 1×9π2/2×4 = 9π2/8 n = 6     1;   ±K6;    35π2;    ±20π2.K6;    259π4;    ±64π2.K6;    225π6      where      K6 = 1×9×25×π2/2×4×16  = 225π2/128 n = 8     1;   ±K8;  84π2;  ±56π2.K8;  1974π4;   ±784π4.K8;  12916π6;  ±2304π6.K8;  11025π8       where      K8 = 1×9×25×49π2/2×4×16×36 = 11025π2/4608 n = 10    1;     ±K10;     165π2;     ±120π2.K10;     8778π4;      ±4368π4.K10;     172810π6 ;    ±52480π6.K10;     1057221π8;    ±147456π8.K10;     893025π10        where         K10 = 1×9×25×49×81π2/2×4×16×36×64 = 893025π2/294912

The pole and zero locations in the complex frequency plane, for these responses, are as follows. n = 2     ±2.4674 ±j1.9446 n = 4     ±2.08573 ±j6.999720      ±3.46592 ±j2.10266 n = 6     ±1.65372 ±j12.92985      ±2.95253 ±j7.141180      	±4.06821 ±j2.18380 n = 8     ±1.39164 ±j19.08424      ±2.39805 ±j13.00016      ±3.51463 ±j7.234452      ±4.50223 ±j2.23670 n = 10    ±1.22048 ±j25.3044      ±2.03964 ±j19.12346      ±2.90618 ±j13.05263      ±3.93447 ±j7.30403      ±4.84234 ±j2.27510 The phase error responses for the even order networks from n = 2 to n = 10 have been plotted in the accompanying figure.



Comparing the bandwidths of networks with passband ripple to those with a maximally flat response, an increase of approximately 50% is achieved.

Comparing three networks
As an example, consider the performance of a sixth order maximally flat delay network with two fourth order networks, one with Chebyshev ripple, and one using the power series approximation. The figure below compares the phase error plots of these three networks (the full line is for the maximally flat response, the dot-dash line for the Chebyshev response and the dashed line for the power series approximation).



As can be seen, all three normalised delay networks have a nominal linear phase bandwidth of 1.6 Hz (10 rads/s).

In order to compare the performance of the 4th order networks with the maximally flat circuit, it is necessary to use appropriate test waveforms. For example, in the case of television signals, sine-squared pulses may be used for the purpose

Some examples of lattice delay circuits
All networks given below are normalized for unit delay and one ohm terminations. To scale for a delay of τ secs., multiply all C and L values by τ. To scale for a different impedance level Ro, multiply all L values by Ro and divide all C values by Ro.

Circuits having a single lattice
The first example gives the circuit for a 6th order maximally flat delay. Circuit values for za and zb for a normalized lattice (with zb the dual of za) were given earlier. However, in this example the alternative version of zb is used, so that an unbalanced alternative can be easily produced. The circuit is



where component values for a normalised 1 ohm network, with 1 second delay at low frequencies, are: L1 = $1⁄2$ = 0.5      C1  = $1⁄6$ = 0.16667      L2  = $1⁄10$ = 0.1 C2 = $1⁄14$ = 0.07143      L3  = $1⁄19$ = 0.05556      C3  = $1⁄22$ = 0.04545 and L4' = 0.02381     C4' = 0.070      L5' = 0.11231 C5' = 0.15027    L6' = 0.19104     C6' = 0.2797 Using the procedures of Lattice networks, this can be converted to an unbalanced form, to give



Circuits with a cascade of low-order lattices
It is often desirable to decompose a lattice into a cascade of lower order networks, because component tolerances can be relaxed. To carry out the procedure take the three sets of pole-zero data from the table for maximally flat functions, for n = 6, and use the methods in Lattice networks xA = 8.4967  yA  = 1.7350      xB = 7.4714   yB = 5.2525       xC = 5.0319   yC = 8.9854 So for lattice A	C1A = 1/2.xA = 0.05885 = L2A     and     L1A = 2.xA/(xA2 + yA2) = 0.2260 = C2A For lattice B	C1B = 1/2.xB = 0.06692 = L2B     and      L1B = 2.xB/(xB2 + yB2) = 0.1791 = C2B For lattice C	C1C = 1/2.xC = 0.09937 = L2C      and      L1C = 2.xC/(xC2 + yC2) = 0.09489 = C2C

These component values are used in the circuit shown below.



The phase characteristic of this three section cascade is, of course, identical to that of the single complex lattice, given earlier.

This cascade of second order lattices can be converted to an unbalanced configuration by the methods of Lattice networks, and the resulting circuit is shown.



Chebyshev, 4th order with 10% GD ripple
From the tables of Chebyshev data, given above, find the pole-zero positions: xA = 2.459  yA  = 2.739      xB = 2.195   yB = 7.730 So for lattice A	C1A = 1/2.xA = 0.2033 = L2A     and       L1A = 2.xA/(xA2 + yA2) = 0.3630 = C2A For lattice B	C1B = 1/2.xB = 0.2280 = L2B     and      L1B = 2.xB/(xB2 + yB2) = 0.06799 = C2 So use these values in the circuit below.



Circuit for the 4th-order forced ripple approximation
From the tables for power product approximation, given above, find the pole-zero positions: xA = 3.4659  yA  = 2.1027      xB = 2.0857   yB = 6.9997 So for lattice A	C1A = 1/2.xA = 0.1443 = L2A      and      L1A = 2.xA/(xA2 + yA2) = 0.4218 = C2A For lattice B	C1B = 1/2.xB = 0.2397 = L2B     and      L1B = 2.xB/(xB2 + yB2) = 0.07820 = C2B

Use these values in the circuit shown above.

Both 4th order networks can be converted to unbalanced form using the procedures of Lattice networks