### 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) |
---|---|

Title of host publication | IEEE Digital Signal Processing Workshop |

Editors | Anon |

Publisher | IEEE |

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 |

### Fingerprint

### ASJC Scopus subject areas

- Signal Processing
- Electrical and Electronic Engineering

### Cite this

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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

}

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 -