Block-sparsity-aware LMS algorithm for network echo cancellation
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 $l_{2\c...
Saved in:
| Published in | Electronics letters Vol. 54; no. 15; pp. 951 - 953 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
The Institution of Engineering and Technology
26.07.2018
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 0013-5194 1350-911X 1350-911X |
| DOI | 10.1049/el.2018.1065 |
Cover
| Summary: | 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 $l_{2\comma 1}$l2,1 norm and $l_2$l2 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 $l_{2\comma 1}$l2,1 norm and $l_2$l2 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. |
|---|---|
| ISSN: | 0013-5194 1350-911X 1350-911X |
| DOI: | 10.1049/el.2018.1065 |