These coefficients are scaled by 1000 to get integer values. Thus coefficient value becomes: -27, -13, 4, 12, 12, 4, -13 and -27. Distributed arithmetic look up table values (total 256 values) are generated by the executable program ‘’ provided with [2]. | Chapter 6 Bessel Filters Bessel filters are designed to have maximally flat group-delay characteristics. As a consequence there is no ringing in the impulse and step responses. Transfer Function The general expression for the transfer function of an nth-order Bessel lowpass filter is given by H s A- Qn s where qn s X bksk k 1 2n k k 2n k kl n ky. The following recursion can be used to determine qn s from Jn ifs and Q -2 s q 2n-l qn_1 s2 7 _2 Table lists qn s for n 2 through n 8. These values were generated by the C function besselCoefficients provided in Listini . This function is used by other Bessel filter routines presented later in this section. Unlike the transfer function for Butterworth and Chebyshev filters Eq. does not provide an explicit expression for the poles of the Bessel filter. The numerator of will be a polynomial in s upon which numerical root-finding methods such as Algorithm must be used to determine the pole locations for H s . Table lists approximate pole locations for n 2 through n 8. 109 110 Chapter Six table Denominator Polynomials for Transfer Functions of Bessel Filters Normalized to Have Unit Delay at ai 0 n q s 2 s2 3s 3 3 s3 6s2 15s 15 4 s4 10s3 45s2 105s 105 5 s6 15s4 105s3 420s2 945s 945 6 s6 21s6 210s4 1260s3 4725s2 10 395s 10 395 7 s7 28s6 378s6 3150s4 17 325s3 62 370s2 135 135s 135 135 8 s8 36s7 630s6 6930s6 9450s4 270 270s3 945 945s2 2 027 025s 2 027 025 TABLE Poles of Bessel Filter Normalized to Have Unit Delay at co 0 n Pole values 2 3 4 5 6 7 8 The transfer functions given by are for Bessel filters normalized to have unit delay at co 0. The poles pk and denominator coefficients bk can be renormalized for a 3-dB frequency of co 1
