DocumentCode
2042258
Title
Efficient partial update algorithm based on coefficient block for sparse impulse response identification
Author
Deng, Hongyang ; Dyba, Roman
Author_Institution
Freescale Semicond. Inc., Austin, TX
fYear
2008
fDate
19-21 March 2008
Firstpage
233
Lastpage
236
Abstract
Network echo path impulse responses with large echo coverage capacity are sparse. Two coefficient-based sparse partial update adaptive algorithms are described in the work of Deng and Doroslovacki (2004) to achieve fast convergence by taking advantages of the sparseness of the echo path and the partial update technique. In this paper, a novel block sparse partial update normalized least mean square (BSPNLMS) algorithm is proposed. Simulation results show that the proposed algorithm can have better convergence performance than the coefficient-based algorithms with much less computational complexity.
Keywords
adaptive filters; communication complexity; echo suppression; least mean squares methods; adaptive filter; block sparse partial update normalized least mean square algorithm; coefficient block; computational complexity; large echo coverage capacity; network echo cancellation; network echo path impulse response; sparse impulse response identification; sparse partial update adaptive algorithm; Adaptive algorithm; Adaptive filters; Buffer storage; Computational complexity; Convergence; Delay estimation; Digital signal processing; Echo cancellers; Signal processing algorithms; Sorting; Network Echo Cancellation; Partial Update Adaptive Algorithm; Sparse Impulse Response Identification;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Sciences and Systems, 2008. CISS 2008. 42nd Annual Conference on
Conference_Location
Princeton, NJ
Print_ISBN
978-1-4244-2246-3
Electronic_ISBN
978-1-4244-2247-0
Type
conf
DOI
10.1109/CISS.2008.4558527
Filename
4558527
Link To Document