TY - JOUR
T1 - Improved least mean square algorithm with application to adaptive sparse channel estimation
AU - Gui, Guan
AU - Adachi, Fumiyuki
N1 - Funding Information:
The authors would like to thank Dr. Koichi Adachi of the Institute for Infocomm Research for his valuable comments and suggestions as well as for the improvement of the English expression of this paper. The authors would like to extend their appreciation to the anonymous reviewers for their constructive comments. This work was supported by a grant-in-aid for the Japan Society for the Promotion of Science (JSPS) fellows (grant number 24∙02366).
PY - 2013/12
Y1 - 2013/12
N2 - Least mean square (LMS)-based adaptive algorithms have attracted much attention due to their low computational complexity and reliable recovery capability. To exploit the channel sparsity, LMS-based adaptive sparse channel estimation methods have been proposed based on different sparse penalties, such as ℓ1-norm LMS or zeroattracting LMS (ZA-LMS), reweighted ZA-LMS, and ℓp-norm LMS. However, the aforementioned methods cannot fully exploit channel sparse structure information. To fully take advantage of channel sparsity, in this paper, an improved sparse channel estimation method using ℓ0-norm LMS algorithm is proposed. The LMS-type sparse channel estimation methods have a common drawback of sensitivity to the scaling of random training signal. Thus, it is very hard to choose a proper learning rate to achieve a robust estimation performance. To solve this problem, we propose several improved adaptive sparse channel estimation methods using normalized LMS algorithm with different sparse penalties, which normalizes the power of input signal. Furthermore, Cramer-Rao lower bound of the proposed adaptive sparse channel estimator is derived based on prior information of channel taps' positions. Computer simulation results demonstrate the advantage of the proposed channel estimation methods in mean square error performance.
AB - Least mean square (LMS)-based adaptive algorithms have attracted much attention due to their low computational complexity and reliable recovery capability. To exploit the channel sparsity, LMS-based adaptive sparse channel estimation methods have been proposed based on different sparse penalties, such as ℓ1-norm LMS or zeroattracting LMS (ZA-LMS), reweighted ZA-LMS, and ℓp-norm LMS. However, the aforementioned methods cannot fully exploit channel sparse structure information. To fully take advantage of channel sparsity, in this paper, an improved sparse channel estimation method using ℓ0-norm LMS algorithm is proposed. The LMS-type sparse channel estimation methods have a common drawback of sensitivity to the scaling of random training signal. Thus, it is very hard to choose a proper learning rate to achieve a robust estimation performance. To solve this problem, we propose several improved adaptive sparse channel estimation methods using normalized LMS algorithm with different sparse penalties, which normalizes the power of input signal. Furthermore, Cramer-Rao lower bound of the proposed adaptive sparse channel estimator is derived based on prior information of channel taps' positions. Computer simulation results demonstrate the advantage of the proposed channel estimation methods in mean square error performance.
KW - ℓ0-Norm normalized least mean square
KW - ℓp-Norm normalized least mean square
KW - Adaptive sparse channel estimation
KW - Compressive sensing
KW - Least mean square
KW - Normalized LMS
UR - http://www.scopus.com/inward/record.url?scp=84894118306&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84894118306&partnerID=8YFLogxK
U2 - 10.1186/1687-1499-2013-204
DO - 10.1186/1687-1499-2013-204
M3 - Article
AN - SCOPUS:84894118306
SN - 1687-1472
VL - 2013
JO - Eurasip Journal on Wireless Communications and Networking
JF - Eurasip Journal on Wireless Communications and Networking
IS - 1
M1 - 204
ER -