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

Ivan Selesnick, M. Lang, C. S. Burrus

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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)
Title of host publicationIEEE Digital Signal Processing Workshop
Editors Anon
PublisherIEEE
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

Fingerprint

Frequency response
Poles and zeros
FIR filters

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

Selesnick, I., Lang, M., & Burrus, C. S. (1994). Magnitude squared design of recursive filters with the chebyshev norm using a constrained rational Remez algorithm. In Anon (Ed.), IEEE Digital Signal Processing Workshop (pp. 23-26). IEEE.

Magnitude squared design of recursive filters with the chebyshev norm using a constrained rational Remez algorithm. / Selesnick, Ivan; Lang, M.; Burrus, C. S.

IEEE Digital Signal Processing Workshop. ed. / Anon. IEEE, 1994. p. 23-26.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Selesnick, I, Lang, M & Burrus, CS 1994, Magnitude squared design of recursive filters with the chebyshev norm using a constrained rational Remez algorithm. in Anon (ed.), IEEE Digital Signal Processing Workshop. IEEE, pp. 23-26, Proceedings of the 1994 6th IEEE Digital Signal Processing Workshop, Yosemite, CA, USA, 10/2/94.
Selesnick I, Lang M, Burrus CS. Magnitude squared design of recursive filters with the chebyshev norm using a constrained rational Remez algorithm. In Anon, editor, IEEE Digital Signal Processing Workshop. IEEE. 1994. p. 23-26
Selesnick, Ivan ; Lang, M. ; Burrus, C. S. / Magnitude squared design of recursive filters with the chebyshev norm using a constrained rational Remez algorithm. IEEE Digital Signal Processing Workshop. editor / Anon. IEEE, 1994. pp. 23-26
@inproceedings{ebc94793a3a145e8956a43789f9a9000,
title = "Magnitude squared design of recursive filters with the chebyshev norm using a constrained rational Remez algorithm",
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.",
author = "Ivan Selesnick and M. Lang and Burrus, {C. S.}",
year = "1994",
language = "English (US)",
pages = "23--26",
editor = "Anon",
booktitle = "IEEE Digital Signal Processing Workshop",
publisher = "IEEE",

}

TY - GEN

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

AU - Selesnick, Ivan

AU - Lang, M.

AU - Burrus, C. S.

PY - 1994

Y1 - 1994

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0028742745&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028742745&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0028742745

SP - 23

EP - 26

BT - IEEE Digital Signal Processing Workshop

A2 - Anon, null

PB - IEEE

ER -