论文信息 - Design and characterization of optimal FIR filters with arbitrary phase

Design and characterization of optimal FIR filters with arbitrary phase

An algorithm for designing a Chebyshev optimal FIR filter that approximates an arbitrary complex-valued frequency response is presented. This algorithm computes the optimal filter by solving the dual to the filter design problem. It is guaranteed to converge theoretically and requires O(N/sup 2/) computations per iteration for a filter of length N. For the first time, properties of the optimal filter are derived, and the case where the desired filter has arbitrary constant group delay is studied in detail. >

[1] P. Tang. A fast algorithm for linear complex Chebyshev approximations , 1988 .

[2] H. S. Shapiro,et al. A Unified Approach to Certain Problems of Approximation and Minimization , 1961 .

[3] A. H. Nuttall,et al. A general Chebyshev complex function approximation procedure and an application to beamforming , 1982 .

[4] Klaus Glashoff,et al. Linear Optimization and Approximation , 1983 .

[5] Gene H. Golub,et al. Matrix computations , 1983 .

[6] Matthias Schulist,et al. Improvements of a complex FIR filter design algorithm , 1990 .

[7] J. McClellan,et al. Chebyshev Approximation for Nonrecursive Digital Filters with Linear Phase , 1972 .

[8] Thomas W. Parks,et al. Design of FIR filters in the complex domain , 1987, IEEE Trans. Acoust. Speech Signal Process..

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

[10] K. Glashoff,et al. A new method for Chebyshev approximation of complex-valued functions , 1981 .

[11] T. W. Parks,et al. Digital Filter Design , 1987 .

[12] Klaus Preuss,et al. On the design of FIR filters by complex Chebyshev approximation , 1989, IEEE Trans. Acoust. Speech Signal Process..

[13] G. Lorentz. Approximation of Functions , 1966 .

[14] J. Markel,et al. FFT pruning , 1971 .

[15] John S. D. Mason,et al. Complex Chebyshev approximation for FIR digital filters , 1991, IEEE Trans. Signal Process..