Variable step-size l<inf>0</inf>-norm NLMS algorithm for sparse channel estimation

Abstract

Wireless communication systems often require accurate channel state information (CSI) at the receiver side. Typically, the CSI can be obtained from channel impulse response (CIR). Measurements have shown that the CIR of wideband channels are often sparse. To this end, the least mean square (LMS)-based algorithms have been used to estimate the CIR at the receiver side, which unfortunately is not able to accurately estimate sparse channels. In this paper, we propose a variable step-size l <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub> -norm normalized LMS (NLMS) algorithm. The step-size is varied with respect to changes in the mean square error (MSE), allowing the filter to track changes in the system as well as produce smaller steady-state errors. We present simulation results and compare the performance of the new algorithm with the invariable step-size NLMS (ISS-NLMS), variable step-size NLMS (VSS-NLMS) and the invariable step-size l <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub> -NLMS (ISS-l <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub> -NLMS) algorithms. The results show that the proposed algorithm improves the identification of sparse systems.