A tree-structured piecewise linear adaptive filter

Author

Gelfand, Saul B. ; Ravishankar, C.S. ; Delp, Edward J.

Author_Institution

Sch. of Electr. Eng., Purdue Univ., West Lafayette, IN, USA

fYear

1991

fDate

14-17 Apr 1991

Firstpage

2141

Abstract

The idea of a tree-structured piecewise linear adaptive filter is proposed. The tree-structured filter is constructed as follows. Each node in a binary tree is associated with a linear filter restricted to a polygonal domain, and this is done in such a way that each subtree is associated with a piecewise linear filter. A training sequence is used to adaptively update the filter coefficients and domains at each node, and to select the best subtree and the corresponding piecewise linear filter. The authors summarize the derivation and analysis of the tree-structured piecewise linear adaptive filter. They then investigate the performance of the tree-structured filter as an adaptive echo canceler and compare it with that of linear and truncated Volterra series adaptive echo cancelers through computer simulations

Keywords

adaptive filters; digital filters; echo suppression; piecewise-linear techniques; trees (mathematics); adaptive echo canceler; binary tree; computer simulations; filter coefficients; linear Volterra series; piecewise linear adaptive filter; polygonal domain; subtree; training sequence; tree-structured filter; truncated Volterra series; Adaptive filters; Binary trees; Computer simulation; Convergence; Equalizers; Nonlinear filters; Piecewise linear approximation; Piecewise linear techniques; Tree graphs;

fLanguage

English

Publisher

ieee

Conference_Titel

Acoustics, Speech, and Signal Processing, 1991. ICASSP-91., 1991 International Conference on

Conference_Location

Toronto, Ont.

ISSN

1520-6149

Print_ISBN

0-7803-0003-3

Type

conf

DOI

10.1109/ICASSP.1991.150836

Filename

150836