Regularization Selection Method for LMS-Type
Sparse Multipath Channel Estimation
Zhengxing Huang⋆, Guan Gui †, Anmin Huang ‡, Dong Xiang⋆, and Fumiyki Adachi †
⋆ Department of Software Engineering, Tsinghua University, Beijing, China
† Department of Communication Engineering, Tohoku University, Sendai, Japan
‡ Department of Electronics and Information Engineering, Jinggangshan University, Jian, China
Abstract—Least mean square (LMS)-type adaptive sparse
algorithms have been attracting much attention on sparse
multipath channel estimation (SMPC) due to their two
advantages: low computational complexity and reliability. By
introducing
-norm sparse constraint function into LMS
algorithm, both zero-attracting least mean square (ZA-LMS) and
reweighted zero-attracting least mean square (RZA-LMS) have
been proposed for SMPC. It is well known that the performance
of the SMPC is decided by regularization parameter which
balances channel estimation error and sparse penalty strength.
However, optimal regularization parameter selection has not yet
considered in the two proposed algorithms. Based on the
compressive sensing theory, in this paper, we explain the
mathematical relationship between Lasso and LMS-type adaptive
sparse algorithms. Later, an approximate optimal regulation
parameter selection method is proposed for ZA-LMS and RZA-
LMS, respectively. Monte Carlo based computer simulations are
presented to show the effectiveness of our propose method.
Keywords—regularization parameter selection, least mean
square (LMS); adaptive sparse channel estimation; zero-attracting
least mean square (ZA-LMS); reweighted zero-attracting least
mean square (RZA-LMS).
I. INTRODUCTION
The demand for high-speed data services is getting more
insatiable due to the number of wireless subscribers roaring
increase in the next generation wireless communication
systems. Various portable wireless devices, e.g., smart phones
and laptops, have generated rising massive data traffic [1]. It is
well known that the broadband transmission is an
indispensable technique for realizing Gigabit wireless
communication [2][3]. However, the broadband signal is
susceptible to interference by frequency-selective channel
fading. In the sequel, the broadband channel is described by a
sparse channel model in which multipath taps are widely
separated in time, thereby create a large delay spread [4]. In
other words, unknown channel impulse response (CIR) in
broadband wireless communication system is often described
by sparse channel model, supporting by a few large
coefficients. In other words, most of channel coefficients are
zero or close to zero while only a few channel coefficients are
dominant (large value) to support the channel. A typical
example of sparse channel is shown in Fig. 1, where the
number of dominant channel taps is 4 while the length of
channel is 16.
Traditional least mean square (LMS) algorithm is one of the
most popular methods for adaptive system identification [5],
e.g. channel estimation. Indeed, LMS-based adaptive channel
estimation can be easily implemented by LMS-based filter due
to its low computational complexity or fast convergence speed.
However, the standard LMS-based method never takes
advantage of channel sparse structure as prior information and
then it may loss some estimation performance.
Recently, many algorithms have been proposed to take
advantage of sparse structure of the channel. For example,
based on the theory of compressive sensing (CS) [6], [7],
various sparse channel estimation methods have been
proposed in [8–13]. For one thing, these CS-based sparse
channel estimation methods require that the training signal
matrices satisfy the restricted isometry property (RIP) [14].
However, design these kinds of training matrices is non-
deterministic polynomial-time (NP) hard problem [21]. For
another thing, some of these methods achieve robust
estimation at the cost of high computational complexity, e.g.,
sparse channel estimation using least-absolute shrinkage and
selection operator (LASSO) [15]. To avoid the high
computational complexity on sparse channel estimation, a
variation of the LMS algorithm with ℓ
1
-norm penalty term in
the LMS cost function has also been developed in [16], [17].
The ℓ
1
-norm penalty was incorporated into the cost function
Fig. 1. A typical example of sparse multipath channel.
978-1-4673-6050-0/13/$31.00 ©2013 IEEE
The 19th Asia-Pacific Conference on Communications (APCC2013), Bali - Indonesia
655