Magnitude squared design of recursive filters with the chebyshev norm using a constrained rational Remez algorithm

I. W. Selesnick, M. Lang, C. S. Burrus

Research output: Contribution to conferencePaper

Abstract

We describe a Remez type exchange algorithm for the design of stable recursive filters for which the Chebyshev norm of H(ω) - F(ω) is minimized, where H(ω) and F(ω) are the realized and desired magnitude squared frequency responses. The number of poles and zeros can be chosen arbitrarily and the zeros do not have to lie on the unit circle. The algorithm allows us to design filters with non-conventional frequency responses with arbitrary weighting functions. It also gives optimal minimum phase FIR filters and Elliptic recursive filters as special cases. We discuss three main difficulties in the use of the Remez algorithm for recursive filter design and give ways to overcome them.

Original languageEnglish (US)
Pages23-26
Number of pages4
StatePublished - 1994
EventProceedings of the 1994 6th IEEE Digital Signal Processing Workshop - Yosemite, CA, USA
Duration: Oct 2 1994Oct 5 1994

Other

OtherProceedings of the 1994 6th IEEE Digital Signal Processing Workshop
CityYosemite, CA, USA
Period10/2/9410/5/94

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Magnitude squared design of recursive filters with the chebyshev norm using a constrained rational Remez algorithm'. Together they form a unique fingerprint.

  • Cite this

    Selesnick, I. W., Lang, M., & Burrus, C. S. (1994). Magnitude squared design of recursive filters with the chebyshev norm using a constrained rational Remez algorithm. 23-26. Paper presented at Proceedings of the 1994 6th IEEE Digital Signal Processing Workshop, Yosemite, CA, USA, .