Analog Allpass Filters

It turns out that analog allpass filters are considerably simpler mathematically than digital allpass filters (discussed in §B.2). In fact, when working with digital allpass filters, it can be fruitful to convert to the analog case using the bilinear transform (§I.3.1), so that the filter may be manipulated in the analog plane rather than the digital plane. The analog case is simpler because analog allpass filters may be described as having a zero at for every pole at , while digital allpass filters must have a zero at for every pole at . In particular, the transfer function of every first-order analog allpass filter can be written as

where is any constant phase offset. To see why must be allpass, note that its frequency response is given by

which clearly has modulus 1 for all (since ). For real allpass filters, complex poles must occur in conjugate pairs, so that the ``allpass rule'' for poles and zeros may be simplified to state that a zero is required at

and, more generally, every real allpass transfer function can be factored as

This simplified rule works because every complex pole is accompanied by its conjugate for some .

Multiplying out the terms in Eq.(E.12), we find that the numerator polynomial is simply related to the denominator polynomial :

Since the roots of must be in the left-half -plane for stability, must be a

can be seen as a -rotation of in the plane; therefore, its roots must have non-positive real parts, and its coefficients form an alternating sequence.

As an example of the greater simplicity of analog allpass filters
relative to the discrete-time case, the graphical method for computing
phase response from poles and zeros (§8.3) gives immediately
that the phase response of every real analog allpass filter is equal
to *twice* the phase response of its numerator (plus
when
the frequency response is negative at dc). This is because the angle
of a vector from a pole at
to the point
along the
frequency axis is
minus the angle of the vector from a zero at
to the point
.

[How to cite this work] [Order a printed hardcopy] [Comment on this page via email]

Copyright ©

Center for Computer Research in Music and Acoustics (CCRMA), Stanford University