Fast sequential algorithms for least squares FIR filters with linear phase

Author

Kalouptsidis, N. ; Theodoridis, S.

Author_Institution

Dept. of Phys., Athens Univ., Greece

Volume

35

Issue

4

fYear

1988

fDate

4/1/1988 12:00:00 AM

Firstpage

425

Lastpage

432

Abstract

Two algorithms are presented that adaptively compute the coefficients of a finite-input response (FIR) transversal filter with linear (affine) phase. The first algorithm is of the least-squares covariance type with a computational complexity of 18.5 m MADS (multiplications and additions), m being the order of the filter. The second one corresponds to the sliding-memory case and requires 24 m MADS. The prewindowed algorithm, a special case of the covariance type algorithm is also discussed and requires 10.5 m MADS. The algorithms are derived for the general multichannel case. The task of initialization is also considered

Keywords

computational complexity; digital filters; filtering and prediction theory; least squares approximations; computational complexity; digital filters; finite-input response; general multichannel case; initialization; least squares FIR filters; least-squares covariance type; linear phase; prewindowed algorithm; sliding-memory case; transversal filter; Band pass filters; Capacitors; Circuits; Finite impulse response filter; Frequency; Least squares methods; Low pass filters; Nonlinear filters; Physics; Signal processing algorithms;

fLanguage

English

Journal_Title

Circuits and Systems, IEEE Transactions on

Publisher

ieee

ISSN

0098-4094

Type

jour

DOI

10.1109/31.1758

Filename

1758