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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
