The Nehari shuffle: FIR(q) filter design with guaranteed error bounds

Author

Kootsookos, Peter J. ; Bitmead, Robert R. ; Green, Michael

Author_Institution

Dept. of Syst. Eng., Australian Nat. Univ., Canberra, ACT, Australia

Volume

40

Issue

8

fYear

1992

fDate

8/1/1992 12:00:00 AM

Firstpage

1876

Lastpage

1883

Abstract

An approach to the problem of designing a finite impulse response filter of specified length q which approximates in uniform frequency (L_∞) norm a given desired (possibly infinite impulse response) causal, stable filter transfer function is presented. An algorithm-independent lower bound on the achievable approximation error is derived, and an approximation method that involves the solution of a fixed number of all-pass (Nehari) extension problems (and is therefore called the Nehari shuffle) is presented. Upper and lower bounds on the approximation error are derived for the algorithm. Examples indicate that the method closely approaches the derived global lower bound. The method is compared with the Preuss (complex Remez exchange) algorithm in some examples

Keywords

approximation theory; digital filters; filtering and prediction theory; FIR filter design; Nehari shuffle; Preuss algorithm; achievable approximation error; algorithm-independent lower bound; complex Remez exchange; error bounds; finite impulse response filter; stable filter transfer function; Approximation algorithms; Approximation error; Approximation methods; Delay; Finite impulse response filter; Frequency response; IIR filters; Systems engineering and theory; Transfer functions; Upper bound;

fLanguage

English

Journal_Title

Signal Processing, IEEE Transactions on

Publisher

ieee

ISSN

1053-587X

Type

jour

DOI

10.1109/78.149990

Filename

149990