A new approximated memory improved proportionate affine projection algorithm for block sparse echo cancellation is proposed. This contribution presents a fast recursive implementation combined with the use of dichotomous coordinate descent iterations. It is shown that the proposed algorithm has superior convergence speed and tracking abilities for echo path changes in the context of acoustic and network echo cancellation applications. Also it is proved that these achievements are obtained while having a reduced numerical complexity than competing algorithms.
Click to purchase paper as a non-member or login as an AES member. If your company or school subscribes to the E-Library then switch to the institutional version. If you are not an AES member and would like to subscribe to the E-Library then Join the AES!
This paper costs $33 for non-members and is free for AES members and E-Library subscribers.
The Engineering Briefs at this Convention were selected on the basis of a submitted synopsis, ensuring that they are of interest to AES members, and are not overly commercial. These briefs have been reproduced from the authors' advance manuscripts, without editing, corrections, or consideration by the Review Board. The AES takes no responsibility for their contents. Paper copies are not available, but any member can freely access these briefs. Members are encouraged to provide comments that enhance their usefulness.