Abstract
A simplified algorithm is presented for computing the gradient in adaptive IIR (infinite impulse response) lattice filters. For a filter with N zeros and N poles, this algorithm requires only order N computations. Several computer simulations were performed to compare the performance of the proposed O(N) formulation and the conventional O(N/sup 2/) formulation, and no difference in their behavior was found. In these simulations the full Hessian and the diagonal Hessian adaptive algorithms were used in a system-identification configuration. It is concluded that the proposed method allows the development of robust adaptive IIR algorithms with a cost proportional to the filter order.< <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.
