Journal on Communications
Previous Articles Next Articles
Online:
Published:
Abstract: The l0 and l1 norm constrained least mean square (LMS) algorithm can effectively improve the performance of the sparse channel estimation, but the convergence performance of such algorithms will considerably vary when the channel exhibits different sparisity. A novel p-norm like constraint LMS algorithm to accommodate the various sparisity of the channels through the introducing of the variable p-value was presented. Furthermore, the gradient guided optimization of the p-value was derived. Numerical simulation results are given to demonstrate the superiority of the new algorithm.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.infocomm-journal.com/txxb/EN/
https://www.infocomm-journal.com/txxb/EN/Y2014/V35/I7/21