论文信息 - Equiripple and minimax (Chebyshev) approximations for recursive digital filters

Equiripple and minimax (Chebyshev) approximations for recursive digital filters

The problem of designing recursive digital filters whose frequency response approximates an arbitrarily prescribed function in the Chebyshev sense on a single interval is considered. Certain degenerate cases where the best Chebyshev approximation is not equiripple are studied in detail, and an algorithm is given for determining the best Chebyshev as well as the best equiripple approximation. Finally, a number of examples illustrating applications of this algorithm are given.

A. Deczky

[1] J. Rice. The approximation of functions , 1964 .

[2] E. Cheney. Introduction to approximation theory , 1966 .

[3] R. Crane,et al. All-Pass Network Synthesis , 1968 .

[4] A. Deczky. General expression for the group delay of digital filters , 1969 .

[5] H. Helms. Digital filters with equiripple or minimax responses , 1971 .

[6] J.-P. Thiran. Equal-ripple delay recursive digital filters , 1971 .

[7] A. Deczky. Synthesis of recursive digital filters using the minimum p-error criterion , 1972 .

[8] B. Rakovich,et al. Chebyshev approximation of a constant group delay with constraints at the origin , 1972 .

[9] Andrew Gustav Deczky. Computer aided synthesis of digital filters in the frequency domain , 1973 .