Block-sparsity-aware LMS algorithm for network echo cancellation

Block-sparsity-aware LMS algorithm for network echo cancellation

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Network echo path impulse response is single-block-sparse in nature. In order to obtain a single-block-sparse estimate of the unknown echo path, a new least mean squares (LMS) algorithm is proposed by introducing the penalty of single block sparsity, which is the difference between the mixed norm and norm of the uniformly partitioned filter tap-weight vector, into the original mean-square-error cost function. This is motivated by the fact that the difference between the mixed norm and norm of a vector is minimised only when there is at most one non-zero block in the vector. Numerical simulation results show that the proposed algorithm can effectively estimate and track the unknown echo path, outperforming existing block-sparsity-induced LMS algorithms.


    1. 1)
    2. 2)
      • 2. Digital network echo cancellers’, International Telecommunication Union (ITU-T) Recommendation G.168, 2012.
    3. 3)
    4. 4)
      • 4. Chen, Y., Gu, Y., Hero, A.O.: ‘Regularized least-mean-square algorithms’, arXiv preprint arXiv:1012.5066, 2010.
    5. 5)
    6. 6)
    7. 7)
      • 7. Gu, Y., Chen, Y., Tang, K.: ‘Network echo canceller with active taps stochastic localization’, Proc. IEEE ISCIT, 2005, 1, pp. 556559.

Related content

This is a required field
Please enter a valid email address