A novel variable tap-length learning algorithm for low complexity, fast converging stereophonic acoustic echo cancellation
by Asutosh Kar; Mahesh Chandra
International Journal of Information and Communication Technology (IJICT), Vol. 6, No. 3/4, 2014

Abstract: An advanced low complexity, fast converging variable tap-length (VT) learning algorithm for stereophonic acoustic echo cancellation (SAEC) based on multiple sub-filters (MSF) approach is designed and analysed in this paper. The proposed algorithm retains advantage of both VT different error algorithm (DEA) and common error algorithm (CEA). A systematic procedure is presented to set key variables that affect the structure adaptation to provide the best performance when compared to the existing stereophonic echo cancellers. The convergence performance of the MSF-based parallel structure is studied, for the designed dynamic structure and improvements are addressed over the VT-single long filter, VT-CEA, VT-DEA. A VT-selective coefficient update method to reduce the computational cost of adaptive design is discussed in context with the proposed design. It leads to the closest possible performance to the full update algorithm. Simulated results are shown to make a comparison of the proposed design with existing SAEC algorithms.

Online publication date: Sat, 26-Jul-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Communication Technology (IJICT):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com