### 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 language | English (US) |
---|---|

Pages | 23-26 |

Number of pages | 4 |

State | Published - 1994 |

Event | Proceedings of the 1994 6th IEEE Digital Signal Processing Workshop - Yosemite, CA, USA Duration: Oct 2 1994 → Oct 5 1994 |

### Other

Other | Proceedings of the 1994 6th IEEE Digital Signal Processing Workshop |
---|---|

City | Yosemite, CA, USA |

Period | 10/2/94 → 10/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

*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, .