Optimal Design of FIR Filters with the Complex Chebyshev Error Criteria

IEEE Transactions on Signal Processing

Volumn 43, Issue 3, 1995, Pages 605-616

  Burnside, Daniel ^a   Parks, Thomas W ^a  

^a Department of Obstetrics Gynecology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CHEBYSHEV APPROXIMATION; COMPUTATIONAL COMPLEXITY; CONVERGENCE OF NUMERICAL METHODS; ELECTRIC NETWORK SYNTHESIS; ERROR ANALYSIS; FREQUENCY RESPONSE; LEAST SQUARES APPROXIMATIONS; LINEAR PROGRAMMING; NONLINEAR EQUATIONS; OPTIMIZATION;

COMPLEX CHEBYSHEV ERROR CRITERIA; ERROR FUNCTION; REAL ROTATION THEOREM;

DIGITAL FILTERS;

EID: 0029274190     PISSN: 1053587X     EISSN: 19410476     Source Type: Journal    
DOI: 10.1109/78.370616     Document Type: Article

References (61)

1. X. Chen and T. W. Parks, “Design of FIR filters in the complex domain,” IEEE Trans. Acoust. Speech Signal Processing, vol. ASSP-35, pp. 144-153, Feb. 1987.
2. K. Preuss, “On the design of FIR filters by complex Chebyshev approximation,” IEEE Trans. Acoust. Speech Signal Processing, vol. 37, pp. 702-712, May 1989.
3. R. L. Streit and A. H. Nuttall, “A general Chebyshev complex function approximation procedure and an application to beamforming,” J. Acoust. Soc. Amer., vol. 71, no. 1, 181-190, 1982.
4. _, “Linear Chebyshev complex function approximation,” Tech. Rep. 6403, Naval Underwater Syst. Center, New London, CT, Feb. 1981.
5. K. P. Preuss, “A novel approach for complex Chebyshev approximation with FIR filters using the Remez exchange algorithm,” in Proc. IEEE ICASSP, 1987, pp. 872-875.
6. M. Schulist, “Improvements of a complex FIR filter design problem,” Signal Processing, vol. 20, no. 1, pp. 81-90, May 1990.
7. A. Alkairy, K. Christian, and J. Lim, “Design of FIR filters by complex Chebyshev approximation,” in Proc. IEEE ICASSP, 1991, pp. 1985-1988.
8. M. Schulist, “Complex approximation with additional constraints,” in Proc. IEEE ICASSP, 1992, pp. 101-104.
9. A. Alkairy, K. Christian, and J. Lim, “Design and characterization of optimal FIR filters with arbitrary phase,” IEEE Trans. Acoust. Speech Signal Processing, vol. 41, pp. 559-572, Feb. 1993.
10. C.-Y. Tseng, “A numerical algorithm for complex Chebyshev FIR filter design,” in Proc. IEEE ISC AS, May 1992, pp. 549-552.
11. _,”Further results on complex Chebyshev FIR filter design using a multiple exchange algorithm,” in Proc. IEEE ISC AS, May 3-6, 1993, pp. 343-346.
12. D. Burnside and T. W. Parks, “Accelerated design of FIR filters in the complex domain,” in Proc. IEEE ICASSP, Apr. 27-30, 1993, vol. 3, pp. 81-84.
13. J. H. Webb and D. C. Munson, Jr., “Design of sparse FIR filters using linear programming,” in Proc. IEEE ISCAS, May 3-6, 1993, pp. 339-342.
14. S.-C. Pei and J.-J. Shyu, “Eigen-approach for designing FIR filters and all-pass phase equalizers with prescribed magnitude and phase response,” IEEE Trans. Circ. Syst. II, vol. 39, pp. 137-146, Mar. 1992.
15. T. W. Parks and C. S. Burrus, Digital Filter Design New York: Wiley, 1987, 1st ed, (Topics in Digital Signal Processing).
16. E. Stiefel, “Note on Jordan elimination, linear programming, and Tchebycheff approximation,” Numerische Mathematik, vol. 2, pp. 1-17, 1960.
17. E. W. Cheney, Introduction to Approximation Theory. Chelsea, 1966.
18. A. Charnes, W. W. Cooper, and K. Kortanek, “Duality, Haar programs, and finite sequence spaces,” Proc. Nat. Acad. Sci., vol. 48, pp. 783-786, 1962.
19. E. J. Anderson and P. Nash, Linear Programming in Infinite-Dimensional Spaces. New York: Wiley, 1987, ch. 3-4, pp. 35-90.
20. T. J. Rivlin and H. S. Shapiro, “A unified approach to certain problems of approximation and minimization,” J. Soc. Indust. Appl. Math, vol. 9, pp. 670-699, 1961.
21. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization. Englewood Cliffs, NJ: Prentice-Hall, 1982, 1st ed.
22. I. Barrodale, L. M. Delves, and J. C. Mason, “Linear Chebyshev approximation of complex-valued functions,” Math. Comp., vol. 32, no. 143, pp. 853-863, 1978.
23. G. B. Dantzig, Linear Programming and Extensions. Princeton, NJ: Princeton University Press, 1963.
24. K. G. Murty, Linear Programming. New York: Wiley, 1976.
25. E. Remez, General Computational Methods for Tchebyshev Approximation Problems with Real Parameters Entering Linearly. Kiev, USSR: Izdat. Akad. Nauk Ukraninsk SSR, 1957 (in Russian).
26. L. Veidinger, “On the numerical determination of the best approximations in the Chebyshev sense,” Numerische Mathematik, vol. 2, pp. 99-105, 1960.
27. T. W. Parks and J. H. McClellan, “Chebyshev approximation for nonrecursive digital filters with linear phase,” IEEE Trans. Circ. Theory, vol. CT-19, pp. 189-194, Mar. 1972.
28. P. T. P. Tang, “A fast algorithm for linear complex Chebyshev approximations,” Math. Comp., vol. 51, no. 3, pp. 721-739, 1988.
29. G. B. Dantzig, “Programming of interdependent activities,” Econometrics, vol. 17, no. 3-4, pp. 200-211, July/Oct. 1949.
30. K. G. Murty, Linear and Combinatorical Programming. Kreiger, 1985.
31. L. G. Cuthbert, “Optimizing non-recursive digital filters to non-linear phase characteristics,” Radio Elect. Eng., vol. 44, no. 12, pp. 645-651, Dec. 1974.
32. K. Steiglitz, “Optimal design of FIR digital filters with monotone passband response,” IEEE Trans. Acoust. Speech Sig. Process., vol. ASSP-27, pp. 643-649, Dec. 1979.
33. _, “Design of FIR digital phase networks,” IEEE Trans. Acoust. Speech Signal Processing, vol. ASSP-29, pp. 171-176, Apr. 1981.
34. M. Schulist, “A complex Remez algorithm with good initial solutions,” submitted to Signal Processing, 1992.
35. I. Barrodale and A. Young, “Algorithms for best L1 and L∞linear approximations on a discrete set,” Numerische Mathematik, vol. 8, pp. 295-306, 1966.
36. I. Barrodale and C. Phillips, “An improved algorithm for discrete Chebyshev linear approximation,” in Proc. Fourth Manitoba Conf. Numer. Math., Winnipeg, Canada, Univ. of Manitoba, 1974, pp. 177-190.
37. G. A. Watson, “A multiple exchange algorithm for multivariate Chebyshev approximation,” SIAM J. Num. Math., vol. 12, no. 1, pp. 46-52, Mar. 1975.
38. D. Goldfarb and J. K. Reid, “A practicable steepest-edge simplex algorithm,” Math. Program., vol. 12, pp. 361-371, 1977.
39. P. M. J. Harris, “Pivot selection methods of the Devex LP code,” Math. Program., vol. 5, pp. 1-28, 1973.
40. G. H. Golub and C. F. Van Loan, Matrix Computations Baltimore, MD: Johns Hopkins Univ. Press, 1983, 1st ed.
41. R. H. Bartels, “A stabilization of the simplex method,” Numerische Mathematik, vol. 16, pp. 414-434, 1971.
42. R. H. Bartels and G. H. Golub, “Stable numerical methods for obtaining the Chebyshev solution to an overdetermined system of equations,” Commun. ACM, vol. 11, no. 6, pp. 401-406, June 1968.
43. _, “The simplex method of linear programming using LU decomposition,” Commun. ACM, vol. 12, no. 5, pp. 275-278, May 1969.
44. P. E. Gill and W. Murray, “A numerically stable form of the simplex algorithm,” J. Linear Algebra Appl., vol. 7, pp. 99-138, 1973.
45. H. V. Sorenson and C. S. Burrus, “Efficient computation of the DFT with only a subset of input or output points,” IEEE Trans. Acoust. Speech Signal Processing, vol. 41, no. 3, pp. 1184-1200, Mar. 1993.
46. R. L. Streit, “Algorithm 635: An algorithm for the solution of systems of complex linear equations in the L∞ norm with constraints on the unknowns,” ACM Trans. Math. Soft., vol. 11, no. 3, pp. 242-249, Sept. 1985.
47. M. Schulist, “FIR filter design with additional constraints using complex Chebychev approximation,” accepted for publication in Signal Processing, 1993.
48. L. J. Karam and J. H. McClellan, “Complex Chebychev approximation for FIR filter design,” submitted to IEEE Trans. Circ. Syst. II, Aug. 1993.
49. A. Potchinkov and R. Reemtsen, “The design of FIR filters in the complex domain by a semi-infinite optimization method,” unpublished, 1992.
50. C. L. Lawson, “Contributions to the theory of linear least maximum approximations,” Ph.D. dissertation, Univ. of California, Los Angeles, 1961.
51. J. R. Rice, The Approximation of Functions, Vol. 1: Linear Theory of Computer Science and Information Processing. Reading, MA: Addison-Wesley, 1969.
52. D. Burnside and T. W. Parks, “Optimal design of two-dimensional FIR filters,” submitted to IEEE Trans. Signal Processing, Sept. 1994.
53. D. J. Burnside, “Optimal design of FIR filters,” Ph.D. dissertation, Cornell Univ., Ithaca, NY, Jan. 1995.
54. R. E. Bixby, J. W. Gregory, I. J. Lustig, R. E. Marsten, and D. F. Shanno, “Very large-scale linear programming: A case study in combining interior point and simplex methods,” Tech. Rep. SOR 91-08, Princeton Univ., May 1991.
55. I. J. Lustig, R. E. Marsten, and D. F. Shanno, “Interior point methods for linear programming: Computational state of the art,” Tech. Rep. SOR 92-17, Princeton Univ., Dec. 1992.
56. J.-H. Lee and C.-K. Chen, “Minimax design of two-dimensional FIR digital filters by using an interior point algorithm,” in Proc. IEEE ISCAS, May 3-6, 1993, pp. 894-897.
57. R. G. Shenoy, D. Burnside, and T. W. Parks, “Fourier analysis of linear periodic systems and multirate filter design,” in Proc. 5th Digital Signal Processing Workshop, Starved Rock, IL, Sept. 1992.
58. R. G. Shenoy, D. Burnside, and T. W. Parks, “Linear periodic systems and multirate filter design,” Research note GEO-002 92 16b, Schlumberger-Doll Research, 1992.
59. R. G. Shenoy, D. Burnside, and T. W. Parks, “Linear periodic systems and multirate filter design,” in Proc. Conf. Inform. Sci. Syst., Baltimore, MD, Johns Hopkins Univ., Mar. 24-26, 1993.
60. _, “Linear periodic systems and multirate filter design,” IEEE Trans. Signal Processing, Sept. 1994.
61. D. M. Kodek, “Design of optimal finite wordlength FIR digital filters using integer programming techniques,” IEEE Trans. Acoust. Speech Signal Processing, vol. ASSP-28, pp. 304-308, June 1980.