by Wikibooks, open books for an open world
Available in 123 free installments
Owner:
The Chebyshev algorithm is an alternative to the Butterworth algorithm. For the Chebyshev response, the maximally-flat passband restriction is abandoned. Now, a ripple, or fluctuation is allowed in the pass band. This allows a steeper transition or roll-off to occur. In this type of application, the low-frequency response of the loudspeaker can be extended beyond what can be achieved by Butterworth-type filters. An example plot of a Chebyshev high-pass response with 0.5 dB of ripple against a Butterworth high-pass response for the same ?3dB is shown below.

Figure 6: Chebyshev vs. Butterworth High-Pass Response.
The Chebyshev response is defined by [4]:

Cn(?) is called the Chebyshev polynomial and is defined by [4]:
![]() |
cos[ncos ? 1(?)] | | ? | < 1 |
| cosh[ncosh ? 1(?)] | | ? | > 1 |
Fortunately, Chebyshev polynomials satisfy a simple recursion formula [4]:
| C0(x) = 1 | C1(x) = x | Cn(x) = 2xCn ? 1 ? Cn ? 2 |
For more information on Chebyshev polynomials, see the Wolfram Mathworld: Chebyshev Polynomials page.
When applying the high-pass transformation to the 4th order form of
, the desired response has the form [1]:

The parameter ? determines the ripple. In particular, the magnitude of the ripple is 10log[1 + ?2] dB and can be chosen by the designer, similar to B in the quasi-Butterworth case. Using the recursion formula for Cn(x),

Applying this equation to | H(j?) | 2 [1],
![]() |
|
![]() |
![]() |
Thus, the design equations become [1]:
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |