On lattice-form algorithms for adaptive IIR filtering

Author

Shynk, John J.

Author_Institution

Dept. of Electr. & Comput. Eng., California Univ., Santa Barbara, CA, USA

fYear

1988

fDate

11-14 Apr 1988

Firstpage

1554

Abstract

Lattice-form algorithms are described for adaptive IIR (infinite-impulse-response) filtering that are based on the Gauss-Newton search method. Several approximations of the Hessian matrix that have different levels of computational complexity are considered, and the results are compared to a previous IIR lattice algorithm. Computer simulations in a system-identification configuration illustrate their convergence properties. Algorithms for the two-multiplier lattice with distinct coefficients in each section, and the one-multiplier form, are outlined

Keywords

computational complexity; convergence of numerical methods; digital filters; filtering and prediction theory; Gauss-Newton search method; Hessian matrix; adaptive IIR filtering; computational complexity; computer simulations; convergence properties; digital filters; infinite-impulse-response; lattice-form algorithms; one-multiplier form; system-identification configuration; two-multiplier lattice; Adaptive filters; Computational complexity; Computer simulation; Filtering algorithms; IIR filters; Lattices; Least squares methods; Newton method; Recursive estimation; Search methods;

fLanguage

English

Publisher

ieee

Conference_Titel

Acoustics, Speech, and Signal Processing, 1988. ICASSP-88., 1988 International Conference on

Conference_Location

New York, NY

ISSN

1520-6149

Type

conf

DOI

10.1109/ICASSP.1988.196904

Filename

196904