Chebyshev filters are used to separate one band of frequencies from another.
Although they cannot match the performance of the windowed-sinc filter, they are
more than adequate for many applications. The primary attribute of Chebyshev
filters is their speed, typically more than an order of magnitude faster than the
windowed-sinc. This is because they are carried out by recursion rather than
convolution. The design of these filters is based on a mathematical technique
called the z-transform, discussed in Chapter 33. This chapter presents the
information needed to use Chebyshev filters without wading through a mire of
advanced mathematics.
Origin
Chebyshev filters are named after Pafnuti Chebyshev who is most famous for the
theorems named after him like Chebyshev Inequality, Chebyshev Polynomials, and
Chebyshev Bias. This name has been translated from Russian and appears in the
literature with different spellings, such as: Chebychev, Tschebyscheff, Tchebysheff
and Tchebichef.
KI = cosh A
where:
1
A = n sinh-1
Eq. 8-35
10R -1
Eq. 8-36
RdB
10
Eq. 8-37
where:
R=
where:
RdB = pass band ripple in dB
Eq. 8-38
.1dB
.25dB
.5dB
1dB
2
3
4
5
6
7
8
9
10
3.30362
1.87718
1.46690
1.29122
1.19941
1.14527
1.11061
1.08706
1.07033
1.93432
1.38899
1.21310
1.13472
1.09293
1.06800
1.05193
1.04095
1.03313
1.59814
1.25289
1.13977
1.08872
1.06134
1.04495
1.03435
1.02711
1.02194
1.38974
1.16749
1.09310
1.05926
1.04103
1.03009
1.02301
1.01817
1.01471
1.21763
1.09487
1.05300
1.03381
1.02344
1.01721
1.01316
1.01040
1.00842