Design and Characterization of Optimal FIR Filters with Arbitrary Phase

IEEE Transactions on Signal Processing

Volumn 41, Issue 2, 1993, Pages 559-572

  Alkhairy, Ashraf S ^a   Christian, Kevin G ^a   Lim, Jae S ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHEBYSHEV APPROXIMATION; ITERATIVE METHODS; OPTIMIZATION; SIGNAL FILTERING AND PREDICTION;

CHEBYSHEV OPTIMAL FIR FILTER; CONSTANT GROUP DELAY; DUALITY THEORY;

DIGITAL FILTERS;

EID: 0027539472     PISSN: 1053587X     EISSN: 19410476     Source Type: Journal    
DOI: 10.1109/78.193198     Document Type: Article

References (20)

1. X. Chen and T. W. Parks, “Design of FIR filters in the complex domain,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-35, no. 2, pp. 144-153, Feb. 1987.
2. T. W. Parks and C. S. Burrus, Digital Filter Design. New York: Wiley, 1987.
3. H. W. Schussler and P. Steffen, “Some advanced topics in filter design,” in Advanced Topics in Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, 1988, Chapter 8.
4. K. Preuss, “On the design of FIR filters by complex Chebyshev approximation,” IEEE Trans. Acoust., Speech, Signal Processing, vol. 37, no. 5, pp. 702-712, May 1989.
5. M. Schulist, “Improvements of a complex FIR filter design algorithm,” Signal Processing, vol. 20, no. 1, pp. 81-90, May 1990.
6. R. L. Streit and A. H. Nuttall, “A general Chebyshev complex function approximation procedure and an application to beamforming,” J. Acoust. Soc. Amer., vol. 72, no. 1, pp. 181-190, July 1982.
7. N. N. Chit and J. S. Mason, “Complex Chebyshev approximation for FIR digital filters,” IEEE Trans. Signal Processing, vol. 39, no. 1, pp. 49-54, Jan. 1991.
8. E. W. Cheney, Introduction to Approximation Theory, second ed. New York: Chelsea Publishing Co., 1982.
9. G. G. Lorentz, Approximation of Functions. New York: Chelsea Publishing Co., 1986.
10. J. R. Rice, The Approximation of Functions, vol. I. Reading, MA: Addison-Wesley, 1964.
11. T. J. Rivlin and H. S. Shapiro, “A unified approach to certain problems of approximation and minimization,” J. Soc. Indust. Appl. Math., vol. 9, no. 4, pp. 670-699, Dec. 1961.
12. K. Glashoff and K. Roleff, “A new method for Chebyshev approximation of complex valued functions,” Math. Comp., vol. 36, pp. 233-239, 1981.
13. K. Glashoff and S. Gustafson, Linear Optimization and Approximations. New York: Springer-Verlag, 1983.
14. P. P. Tang, “A fast algorithm for linear complex Chebyshev approximations,” Math. Comp., vol. 51, no. 184, pp. 721-739, Oct. 1988.
15. P. P. Tang, “Chebyshev approximations on the complex plane,” Ph. D. Dissertation, Univ. of California, Berkeley, CA, 1987.
16. G. H. Golub and C. F. Van Loan, Matrix Computation. Baltimore, The Johns Hopkins University Press, 1982.
17. T. Press, Numerical Recipes in C. New York: Cambridge University Press, 1988.
18. J. D. Markel, “FFT pruning,” IEEE Trans. Audio Electroacoust., vol. AU-19, pp. 305-311, Dec. 1971.
19. A. V. Oppenheim and R. W. Schaefer, Discrete Time Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, 1989.
20. T. W. Parks and J. H. McClellan, “Chebyshev approximation for nonrecursive digital filters with linear phase,” IEEE Trans. Circuit Theory, vol. CT-19, 2, pp. 189-194, Mar. 1972.