Optimal design of FIR filters with the complex Chebyshev error criteria

We present an improved algorithm for an established filter design problem, the design of an FIR filter that best approximates, in the complex Chebyshev sense, a desired complex-valued frequency response. The algorithm is a variant of the simplex algorithm of linear programming, which has an interpretation as an implicit multiple exchange. It is iterative, robust, and exhibits good convergence speed. Global optimum convergence is guaranteed. Both complex and real-valued impulse responses can be designed with it; the design of complex coefficient filters is new. An example is given for each case. The design of noncausal filters is new. In addition to these new applications, we conjecture that this new algorithm may have important advantages over existing techniques, with respect to the maximum filter length possible, speed and stability of convergence, accuracy, and memory requirements. The ability to design long filters is among the more significant improvements over previous work. Filters of length 1000 have been designed with the new method. >

[1]  E. Stiefel.  Note on Jordan elimination, linear programming and Tchebycheff approximation , 1960 .

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

[3]  L. Cuthbert.  Optimizing non-recursive digital filters to non-liner phase characteristics , 1974 .

[4]  Kevin G. Christian,et al.  Design and characterization of optimal FIR filters with arbitrary phase , 1993, IEEE Trans. Signal Process..

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

[6]  Soo-Chang Pei,et al.  Eigen-approach for designing FIR filters and all-pass phase equalizers with prescribed magnitude and phase response , 1992 .

[7]  Gene H. Golub,et al.  The simplex method of linear programming using LU decomposition , 1969, Commun. ACM.

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

[9]  G. Dantzig.  Programming of Interdependent Activities: II Mathematical Model , 1949 .

[10]  David C. Munson,et al.  Design of sparse FIR filters using linear programming , 1993, 1993 IEEE International Symposium on Circuits and Systems.

[11]  J. McClellan,et al.  Complex Chebyshev approximation for FIR filter design , 1995 .

[12]  Chris Phillips,et al.  An Improved Algorithm for Discrete Chebyshev Linear Approximation , 1974 .

[13]  Kenneth Steiglitz,et al.  Design of FIR digital phase networks , 1981 .

[14]  C. Sidney Burrus,et al.  Efficient computation of the DFT with only a subset of input or output points , 1993, IEEE Trans. Signal Process..

[15]  Matthias Schulist.  FIR filter design with additional constraints using complex Chebyshev approximation , 1993, Signal Process..

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

[17]  Thomas W. Parks,et al.  Accelerated design of FIR filters in the complex domain , 1993, 1993 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[18]  M. Schulist.  Complex approximation with additional constraints , 1992, [Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[19]  I. Barrodale,et al.  Algorithms for bestL1 andL∞ linear approximations on a discrete set , 1966 .

[20]  L. M. Delves,et al.  Linear Chebyshev approximation of complex-valued functions , 1978 .

[21]  P. Gill,et al.  A numerically stable form of the simplex algorithm , 1973 .

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

[23]  L. Veidinger,et al.  On the numerical determination of the best approximations in the Chebyshev sense , 1960 .

[24]  T. W. Parks,et al.  Fourier Analysis of Linear Periodic Systems and Multirate Filter Design , 1992, The Digital Signal Processing workshop.

[25]  Thomas W. Parks,et al.  Linear periodic systems and multirate filter design , 1994, IEEE Trans. Signal Process..

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

[27]  K. Preuss.  A novel approach for complex Chebyshev-approximation with FIR filters using the Remez exchange algorithm , 1987, ICASSP '87. IEEE International Conference on Acoustics, Speech, and Signal Processing.

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

[29]  Ju-Hong Lee,et al.  Minimax design of two-dimensional FIR digital filters by using an interior-point algorithm , 1993, 1993 IEEE International Symposium on Circuits and Systems.

[30]  W W Cooper,et al.  DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES. , 1962, Proceedings of the National Academy of Sciences of the United States of America.

[31]  Donald Goldfarb,et al.  A practicable steepest-edge simplex algorithm , 1977, Math. Program..

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

[33]  E. Anderson.  Linear Programming In Infinite Dimensional Spaces , 1970 .

[34]  Roy L. Streit,et al.  ALGORITHM 635: an algorithm for the solution of systems of complex linear equations in the L∞ norm with constraints on the unknowns , 1985, TOMS.

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

[36]  K. Steiglitz.  Optimal design of FIR digital filters with monotone passband response , 1979 .

[37]  R. Bartels.  A stabilization of the simplex method , 1971 .

[38]  Ching-Yih Tseng.  Further results on complex Chebyshev FIR filter design using a multiple exchange algorithm , 1993, 1993 IEEE International Symposium on Circuits and Systems.

[39]  Robert E. Bixby,et al.  Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods , 1992, Oper. Res..

[40]  Gene H. Golub,et al.  Numerical Analysis: Stable numerical methods for obtaining the Chebyshev solution to an overdetermined system of equations , 1968, Commun. ACM.

[41]  D. Kodek.  Design of optimal finite wordlength FIR digital filters using integer programming techniques , 1980 .

[42]  Jae S. Lim,et al.  Design of FIR filters by complex Chebyshev approximation , 1991, [Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing.

[43]  Paula M. J. Harris.  Pivot selection methods of the Devex LP code , 1973, Math. Program..

[44]  G. A. Watson,et al.  A Multiple Exchange Algorithm for Multivariate Chebyshev Approximation , 1975 .

[45]  C.-Y. Tseng.  A numerical algorithm for complex Chebyshev FIR filter design , 1992, [Proceedings] 1992 IEEE International Symposium on Circuits and Systems.