Design of FIR filters in the complex domain

The design of FIR digital filters with a complex-valued desired frequency response using the Chebyshev error is investigated. The complex approximation problem is converted into a real approximation problem which is nearly equivalent to the complex problem. A standard linear programming algorithm for the Chebyshev solution of overdetermined equations is used to solve the real approximation problem. Additional constraints are introduced which allow weighting of the phase and/or group delay of the approximation. Digital filters are designed which have nearly constant group delay in the passbands. The desired constant group delay which gives the minimum Chebyshev error is found to be smaller than that of a linear phase filter of the same length. These filters, in addition to having a smaller, approximately constant group delay, have better magnitude characteristics than exactly linear phase filters with the same length. The filters have nearly equiripple magnitude and group delay.

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

[2]  C. Burrus,et al.  Time domain design of recursive digital filters , 1970 .

[3]  G. Meinardus.  Approximation of Functions: Theory and Numerical Methods , 1967 .

[4]  C. K. Yuen,et al.  Theory and Application of Digital Signal Processing , 1978, IEEE Transactions on Systems, Man, and Cybernetics.

[5]  J. Smith,et al.  The Carathéodory-Fejér method for recursive digital filter design , 1983 .

[6]  F. Brophy,et al.  Recursive digital filter synthesis in the time domain , 1974 .

[7]  Xiangkun Chen.  Design of Optimal Digital Filters , 1986 .

[8]  John David Fisher.  DESIGN OF FINITE-IMPULSE RESPONSE DIGITAL FILTERS , 1974 .

[9]  O. Herrmann,et al.  Design of nonrecursive digital filters with minimum phase , 1970 .

[10]  Jack Williams,et al.  Linear Chebyshev approximation in the complex plane using Lawson’s algorithm , 1976 .

[11]  Martin H. Gutknecht,et al.  Non-strong uniqueness in real and complex Chebyshev approximation , 1978 .

[12]  L. Trefethen.  Near-circularity of the error curve in complex Chebyshev approximation , 1981 .

[13]  T. Parks,et al.  Design of recursive digital filters with optimum magnitude and attenuation poles on the unit circle , 1978 .

[14]  Jr. A. Johnson.  Simultaneous magnitude and phase equalization using digital filters , 1978 .

[15]  Majid Ahmadi,et al.  Direct design of recursive digital filters based on a new stability test , 1984 .

[16]  Jack Williams,et al.  Rational Chebyshev Approximation in the Complex Plane , 1976 .

[17]  Stefano Alliney,et al.  Chebyshev approximation of recursive digital filters having specified amplitude and phase characteristics , 1980 .

[18]  J. McClellan,et al.  A unified approach to the design of optimum FIR linear-phase digital filters , 1973 .

[19]  Ian Barrodale,et al.  Algorithm 495: Solution of an Overdetermined System of Linear Equations in the Chebychev Norm [F4] , 1975, TOMS.

[20]  G. Alistair Watson,et al.  An Algorithm for Minimax Approximation in the Nonlinear Case , 1969, Comput. J..

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

[22]  M. M. Fahmy,et al.  A new design technique for recursive digital filters , 1976 .

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

[24]  T. J. Rivlin.  The Chebyshev polynomials , 1974 .

[25]  H. Watanabe,et al.  An Iterative Chebyshev Approximation Method for Network Design , 1968 .

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

[27]  Albert H. Nuttall,et al.  A Note on the Semi-Infinite Programming Approach to Complex Approximation , 1983 .

[28]  Graham A. Jullien,et al.  A linear programming approach to recursive digital filter design with linear phase , 1982 .

[29]  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.

[30]  Jack Williams,et al.  Characterization and Computation of Rational Chebyshev Approximations in the Complex Plane , 1979 .

[31]  Tapio Saramaki,et al.  Digital filters with equiripple magnitude and group delay , 1984 .

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

[33]  Guido M. Cortelazzo,et al.  Simultaneous design in both magnitude and group-delay of IIR and FIR filters based on multiple criterion optimization , 1984 .

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

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

[36]  Kenji Nakayama.  A simultaneous frequency and time domain approximation method for discrete-time filters , 1982 .

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

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

[39]  Richard S. Varga,et al.  Nonuniqueness of best approximating complex rational functions , 1977 .