Abstract

AbstractSince the transfer function of a two‐stage adaptive filter combining a lattice predictor and a FIR filter includes the reflection coefficients and the filter coefficients, a conventional learning algorithm does not integrate the updates of the reflection coefficients and the filter coefficients. Therefore, error reduction could not be guaranteed. To solve this problem, we proposed a learning algorithm that corrects the coefficients of the adaptive filter synchronized to updating the reflection coefficients. The filter coefficients w(n + 1) are corrected so that the transfer function based on the filter coefficients w(n + 1) updated by using the reflection coefficients k(n) updated at sample time n is identical for the reflection coefficients k(n + 1) updated at sample time n + 1, and the filter coefficients w(n + 1) are used in the output calculation for sample n + 1. The computational complexity required for updating is 2 (prediction order × filter order). We conducted a simulation to estimate an unknown system by using white noise, colored noise, and speech as the input signal and compared the performance to a conventional method. We verified the following. The conventional method that does not correct the filter coefficients in response to fluctuations in the reflection coefficients cannot adequately reduce the estimation errors. The proposed method converges 4 to 5 times faster than NLMS for speech input, and its errors are equivalent to those of RLS. When the prediction order ≪ the filter order, the computational complexity can be substantially less than RLS. © 2003 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 87(2): 67–78, 2004; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.10088

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 call

Disclaimer: 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.