Sign Function Based Sparse Adaptive Filtering Algorithms for Robust Channel Estimation under Non-Gaussian Noise Environments

Abstract

Robust channel estimation is required for coherent demodulation in multipath fading wireless communication systems which are often deteriorated by non-Gaussian noises. Our research is motivated by the fact that classical sparse least mean square error (LMS) algorithms are very sensitive to impulsive noise while standard SLMS algorithm does not take into account the inherent sparsity information of wireless channels. This paper proposes a sign function based sparse adaptive filtering algorithm for developing robust channel estimation techniques. Specifically, sign function based least mean square error (SLMS) algorithms to remove the non-Gaussian noise that is described by a symmetric α-stable noise model. By exploiting channel sparsity, sparse SLMS algorithms are proposed by introducing several effective sparse-promoting functions into the standard SLMS algorithm. The convergence analysis of the proposed sparse SLMS algorithms indicates that they outperform the standard SLMS algorithm for robust sparse channel estimation, which can be also verified by simulation results.

1. Introduction

Broadband signal transmission is considered an indispensable technique in next-generation dependable wireless communication systems [1,2,3]. It is well known that both multipath fading and additive noises are major determinants that impair the system performance. In such circumstances, either coherence detection or demodulation needs to estimate channel state information (CSI) [1]. In the framework of a Gaussian noise model, some effective channel estimation techniques have been studied [4,5,6,7,8,9,10]. In the assumptions of the non-Gaussian impulsive noise model, however, existing estimation techniques do not perform robustly due to heavy tailed impulsive interference. Generally speaking, impulsive noise is used to generate natural or man-made electromagnetic waves that are different from the conventional Gaussian noise model [11]. For example, a second-order statistics-based least mean square error (LMS) algorithm [4] cannot be directly applied in broadband channel estimation [12]. To solve this problem, selecting a suitable noise model is necessary to devise a stable channel estimation that can combat the harmful impulsive noises.

The aforementioned non-Gaussian noise can be modeled by the symmetric alpha-stable (SαS) distribution [13]. Based on the SαS noise model, several adaptive filtering based robust channel estimation techniques have been developed [14,15,16]. These techniques are based on the channel model assumption of dense finite impulse response (FIR), which may not suitable in broadband channel estimation because the channel vector is supported only by a few dominant coefficients [17,18].

Considering the sparse structure in a wireless channel, this paper proposes a kind of sparse SLMS algorithm with different sparse norm constraint functions. Specifically, we adopt five sparse constraint functions as follows: zero-attracting (ZA) [7] and reweighted ZA (RZA) [7], reweighted ${\ell }_1$-norm (RL1) [19], ${\ell }_p$-norm (LP), and ${\ell }_0$-norm (L0) [20], to take advantage of sparsity and to mitigate non-Gaussian noise interference. It is necessary to state that the short versions of the proposed algorithms were initially presented in a conference but we did not give a performance analysis [21]. In this paper, we first propose five sparse SLMS algorithms for channel estimation. To verify the stability of the proposed SLMS algorithms, convergence analysis is derived with respect to mean and excess mean square error (MSE) performance. Finally, numerical simulations are provided to verify the effectiveness of the proposed algorithms.

The rest of the paper is organized as follows. Section 2 introduces an alpha-stable impulsive noise based sparse system model and traditional channel estimation technique. Based on the sparse channel model, we propose five sparse SLMS algorithms in Section 3. To verify the proposed sparse SLMS algorithms, convergence analysis is derived in Section 4. Later, computer simulations are provided to validate the effectiveness of the propose algorithms in Section 5. Finally, Section 6 concludes the paper and proposes future work.

2. Traditional Channel Estimation Technique

An input–output wireless system under the SαS noise environment is considered. The wireless channel vector is described by N-length FIR sparse vector $w={[w_0,w_1,\dots ,w_{N-1}]}^T$ at discrete time-index $n$. The received signal is obtained as

$$d(n)=w^{T}x(n)+z(n)$$

(1)

where $x(n)={[x(n),x(n-1),\cdots ,x(n-N+1)]}^T$ is the input signal vector of the $N$ most recent input samples with distribution of $\mathcal{C}\mathcal{N}\left(0,{\mathsf{\sigma }}_x^2\right)$ and $z(n)\sim \mathsf{\varphi }\left(\mathsf{\alpha },\mathsf{\beta },\mathsf{\gamma },\mathsf{\delta }\right)$ denotes a SαS noise variable. To understand the characteristic function of SαS noise, here we define it as

$$p(t)=\exp \left\{j\mathsf{\delta }t-{\mathsf{\gamma }}^{\mathsf{\alpha }}{\left|t\right|}^{\mathsf{\alpha }}\left[1-j\mathsf{\beta }\mathrm{sgn}(t)\mathsf{\varphi }\left(t,\mathsf{\alpha }\right)\right]\right\}$$

(2)

where

$$0<\mathsf{\alpha }\le 2,-1\le \mathsf{\beta }\le 1,\mathsf{\gamma }>0,-\infty <\mathsf{\delta }<\infty$$

(3)

$$\mathrm{sgn}(t)=\{\begin{array}{cc}1,& t>0\\ 0,& t=0\\ -1,& t<0\end{array}$$

(4)

$$\mathsf{\varphi }\left(t,\mathsf{\alpha }\right)=\{\begin{array}{cc}\tan (\mathsf{\alpha }\mathsf{\pi }/2),& \mathsf{\alpha }\ne 1\\ -\log (|t|),& \mathsf{\alpha }=1\end{array}$$

(5)

In Equation (2), $\mathsf{\alpha }\in (0,2]$ controls the tail heaviness of SαS noise. Since when $\mathsf{\alpha }<1$ is rare to happen SαS noise in practical systems, $\mathsf{\alpha }\in (1,2]$ is considered throughout this paper [11]. $\mathsf{\gamma }>0$ denotes the dispersive parameter, which can perform a similar role to Gaussian distribution; $\mathsf{\beta }\in [-1,1]$ stands for the symmetrical parameter. To have a better understanding of the alpha-stable noise, its probability density function (PDF) curves are depicted in Figure 1 and Figure 2 as examples. Figure 1a shows that the PDF curve of symmetric alpha-stable noise changes with the parameter $\mathsf{\alpha }$, i.e., a smaller $\mathsf{\alpha }$ produces a larger PDF of the alpha-stable noise model and vice versa. In other words, $\mathsf{\alpha }$ controls the strength of the impulsive noise. Similarly, Figure 1b shows that the PDF curve of skewed α-stable noise model also changes simultaneously with $\mathsf{\alpha }$ and $\mathsf{\beta }$. Since the skewed noise model may not exist in practical wireless communication systems, the symmetrical α-stable noise model is used in this paper; the characteristic function of α-stable process reduces as

$$p(t)=\exp \left(-\mathsf{\gamma }{\left|t\right|}^{\mathsf{\alpha }}\right)$$

(6)

For convenience, symmetric α-stable noise variance is defined by

$${\mathsf{\sigma }}_z^2={\mathsf{\gamma }}^{2/\mathsf{\alpha }}$$

(7)

and the generalized received signal noise ratio (GSNR) is defined by

$$E_s/N_0\left(\mathrm{dB}\right)\triangleq 10\times {\log }_{10}\left\{P_0/{\mathsf{\gamma }}^{2/\mathsf{\alpha }}\right\}$$

(8)

where $P_0$ denotes the received signal power while ${\mathsf{\sigma }}_z^2={\mathsf{\gamma }}^{2/\mathsf{\alpha }}$ plays the same role as the noise variance.

The objective of adaptive channel estimation is to perform adaptive estimate of $w(n)$ with limited complexity and memory given sequential observation $\{d(n),x(n)\}$ in the presence of additive noise $z(n)$. That is to say, the estimate observation signal $y(n)$ is given as

$$y(n)=w^T(n)x(n)$$

(9)

where $w(n)$ denotes channel estimator. By combining (1) and (4), the estimation error $e(n)$ is

$$e(n)=d(n)-y(n)=z(n)-x^T(n)v(n)$$

(10)

where $v(n)=w(n)-w$ is the updating error of $w(n)$ at iteration $n$. The cost function of standard LMS was written as

$$G_{LMS}\left(w(n)\right)=\left(1/2\right)e^2(n)$$

(11)

Using Equation (11), the standard LMS algorithm was derived as

$$\begin{array}{cc}\hfill w(n+1)& =w(n)+\mathsf{\mu }\frac{\partial G\left(w(n)\right)}{\partial w(n)}\hfill \\ & =w(n)+\mathsf{\mu }e(n)x(n)\hfill \end{array}$$

(12)

where $\mathsf{\mu }$ denotes a step-size that controls the gradient descend speed of the LMS. Letting $R=E[x(n)x^T(n)]$ denotes the covariance matrix of input signal $x(n)$ and ${\mathsf{\lambda }}_{\max }$ as its maximum eigenvalue. The well-known stable convergence condition of the SLMS is

$$0<{\mathsf{\mu }}_{LMS}<1/{\mathsf{\lambda }}_{\max }$$

(13)

In order to remove SαS noise, the traditional SLMS algorithm [14] was first proposed as

$$w(n+1)=w(n)+\mathsf{\mu }\mathrm{sgn}\left(e(n)\right)x(n)$$

(14)

To ensure the stability of SLMS, $\mathsf{\mu }$ should be chosen as

$$0<\mathsf{\mu }<\sqrt{2\mathsf{\pi }}{\mathsf{\sigma }}_e(n)/{\mathsf{\lambda }}_{\max }$$

(15)

where ${\mathsf{\sigma }}_e(n)$ denotes the unconditional variance of estimation error $e(n)$. For later theoretical analysis, the ${\mathsf{\sigma }}_e^2$ is conditioned by

$$\begin{array}{cc}\hfill E\left\{e^2(n)|v(n)\right\}& \approx E\left\{e^2(n)\right\}={\mathsf{\sigma }}_e^2(n)\hfill \\ & =E\left\{{\left[z(n)-v^T(n)x(n)\right]}^T\left[z(n)-v^T(n)x(n)\right]\right\}\hfill \\ & ={\mathsf{\gamma }}^{2/\mathsf{\alpha }}+\mathrm{Tr}\left\{RC(n)\right\}\hfill \end{array}$$

(16)

where $C(n)=E\left\{v(n)v^T(n)\right\}$ denotes the second-order moment matrix of channel estimation error vector $v(n)$.

3. Proposed Sparse SLMS Algorithms

By incorporating sparsity-aware function into the cost function of the standard SLMS in Equation (6), sparse SLMS algorithms could be developed to take advantage of sparse structure information, to mitigate SαS noise as well as to reconstruct channel FIR. First of all, this section proposes five effective sparse SLMS algorithms with different sparse constraints. These proposed algorithms are SLMS-ZA, SLMS-RZA, SLMS-RL1, SLMS-LP, and SLMS-L0. Later, performance analysis will be given to confirm the effectiveness of the proposed algorithms.

3.1. First Proposed Algorithm: SLMS-ZA

The cost function of the LMS-ZA algorithm [7] was developed as

$$G_{ZA}\left(w(n)\right)=\left(1/2\right)e^2(n)+{\mathsf{\lambda }}_{ZA}{\Vert w(n)\Vert }_1$$

(17)

where ${\mathsf{\lambda }}_{ZA}$ stands for a positive parameter to trade off instantaneous estimation square error and sparse penalty of $w(n)$. It is worth noting that the optimal selection of ${\mathsf{\lambda }}_{ZA}$ is very difficult due to the fact that ${\mathsf{\lambda }}_{ZA}$ depends on many variables such as channel sparsity, instantaneous updating error $e(n)$, SNR, and so on. Throughout this paper, the regularization parameter will be selected empirically via the Monte Carlo method. According to Equation (17), the LMS-ZA algorithm was developed as

$$\begin{array}{cc}\hfill w(n+1)& =w(n)-\mathsf{\mu }\frac{\partial G_{ZA}\left(w(n)\right)}{\partial w(n)}\hfill \\ & =w(n)+\mathsf{\mu }e(n)x(n)-{\mathsf{\rho }}_{ZA}\mathrm{sgn}\left(w(n)\right)\hfill \end{array}$$

(18)

where ${\mathsf{\rho }}_{ZA}=\mathsf{\mu }\cdot {\mathsf{\lambda }}_{ZA}$ depends the $\mathsf{\mu }$ and ${\mathsf{\lambda }}_{ZA}$. To mitigate the SαS noises, by constraining sign function on $e(n)$, the SLMS-ZA algorithm is developed as

$$w(n+1)=w(n)+\mathsf{\mu }\mathrm{sgn}\left(e(n)\right)x(n)-{\mathsf{\rho }}_{ZA}\mathrm{sgn}\left(w(n)\right)$$

(19)

where the first $\mathrm{sgn}(\cdot )$ function is utilized to remove impulsive noise in $e(n)$ while the second one acts as a sparsity-inducing function to exploit channel sparsity in $w(n)$. Please note that the steady-state mean square error (MSE) performance of the proposed SLMS-ZA depends highly on ${\mathsf{\rho }}_{ZA}$.

3.2. Second Proposed Algorithm: SLMS-RZA

A stronger sparse penalty function can obtain more accurate sparse information [19]. By devising an improved sparse penalty function RZA, we can develop an improved LMS-RZA algorithm. Its cost function can be constructed as

$$G_{RZA}\left(w_i(n)\right)=\frac{1}{2}{e}^2(n)+{\mathsf{\lambda }}_{RZA}{\displaystyle \sum _{i=0}^{N-1}\log \left(1+{\mathsf{\epsilon }}_{RZA}\left|w_i(n)\right|\right)}$$

(20)

where ${\mathsf{\lambda }}_{RZA}>0$ is a positive parameter. By deriving Equation (20), the update equation of SLMS-RZA is obtained as

$$\begin{array}{cc}\hfill w_i(n+1)& =w_i(n)+\mathsf{\mu }\frac{\partial G_{RZA}\left(w_i(n)\right)}{\partial w_i(n)}\hfill \\ & =w_i(n)+\mathsf{\mu }e(n)x(n-i)-\frac{{\mathsf{\rho }}_{RZA}\mathrm{sgn}\left(w_i(n)\right)}{1+{\mathsf{\epsilon }}_{RZA}\left|w_i(n)\right|}\hfill \end{array}$$

(21)

where ${\mathsf{\rho }}_{RZA}=\mathsf{\mu }{\mathsf{\lambda }}_{RZA}{\mathsf{\epsilon }}_{RZA}$. By collecting all of the coefficients as the matrix-vector form, Equation (21) can be expressed as

$$w(n+1)=w(n)+\mathsf{\mu }e(n)x(n)-\frac{{\mathsf{\rho }}_{RZA}\mathrm{sgn}\left(w(n)\right)}{1+{\mathsf{\epsilon }}_{RZA}\left|w(n)\right|}$$

(22)

where ${\mathsf{\epsilon }}_{RZA}=20$ [7] denotes reweighted factor. By inducing sign function to constraint $e(n)$ in Equation (22), the stable SLMS-RZA algorithm is proposed as

$$w(n+1)=w(n)+\mathsf{\mu }\mathrm{sgn}\left(e(n)\right)x(n)-\frac{{\mathsf{\rho }}_{RZA}\mathrm{sgn}\left(w(n)\right)}{1+{\mathsf{\epsilon }}_{RZA}\left|w(n)\right|}$$

(23)

3.3. Third Proposed Algorithm: SLMS-RL1

In addition to the RZA in (23), RL1 function was also considered as an effective sparse constraint in the field of compressive sensing (CS) [19]. By choosing a suitable reweighted factor, ${\mathsf{\delta }}_{RL1}$, RL1 could approach the optimal ${\ell }_0$-norm (L0) constraint. Hence, the LMS-RL1 algorithm has been considered an attractive application of sparse channel estimation. The LMS-RL1 algorithm [5] was developed as

$$G_{RL1}\left(w(n)\right)=\left(1/2\right)e^2(n)+{\mathsf{\lambda }}_{RL1}{\Vert f(n)w(n)\Vert }_1$$

(24)

where ${\mathsf{\lambda }}_{RL1}$ denotes positive regularization parameter and $f(n)$ is defined as

$${[f(n)]}_i=\frac{1}{{\mathsf{\delta }}_{RL1}+\left|{[w(n-1)]}_i\right|},i=0,1,\cdots ,N-1$$

(25)

where ${\mathsf{\delta }}_{RL1}>0$ and then ${[f(n)]}_i>0$. By taking the derivation of Equation (24), the LMS-RL1 algorithm was updated as

$$\begin{array}{cc}\hfill w(n+1)& =w(n)+\mathsf{\mu }\frac{\partial G_{RL1}\left(w(n)\right)}{\partial w(n)}\hfill \\ & =w(n)+\mathsf{\mu }e(n)x(n)-{\mathsf{\rho }}_{RL1}\mathrm{sgn}\left(f(n)w(n)\right)f^T(n)\hfill \\ & =w(n)+\mathsf{\mu }e(n)x(n)-{\mathsf{\rho }}_{RL1}\mathrm{sgn}\left(w(n)\right)f^T(n)\hfill \\ & =w(n)+\mathsf{\mu }e(n)x(n)-\frac{{\mathsf{\rho }}_{RL1}\mathrm{sgn}\left(w(n)\right)}{{\mathsf{\delta }}_{RL1}+\left|w(n-1)\right|}\hfill \end{array}$$

(26)

where ${\mathsf{\rho }}_{RL1}=\mathsf{\mu }{\mathsf{\lambda }}_{RL1}$. The third step of derivation can be obtained since $\mathrm{sgn}\left(f(n)\right)=1_{1\times N}$ and then $\mathrm{sgn}\left(f(n)w(n)\right)=\mathrm{sgn}\left(w(n)\right)$. Here the cost function $G_{RL1}(n)$ is convex due to the fact that it does not depend on $w(n)$. Likewise, sign function is adopted for constraint $e(n)$ and then robust SLMS-RL1 algorithm is obtained as

$$w(n+1)=w(n)+\mathsf{\mu }\mathrm{sgn}\left(e(n)\right)x(n)-\frac{{\mathsf{\rho }}_{RL1}\mathrm{sgn}\left(w(n)\right)}{{\mathsf{\delta }}_{RL1}+\left|w(n-1)\right|}$$

(27)

3.4. Fourth Proposed Algorithm: SLMS-LP

${\ell }_p$-norm sparse penalty is a nonconvex function to exploit sparse prior information. In [5], LMS-LP based channel estimation algorithms was developed as

$$G_{LP}\left(w(n)\right)=\left(1/2\right)e^2(n)+{\mathsf{\lambda }}_{LP}{\Vert w(n)\Vert }_p$$

(28)

where ${\mathsf{\lambda }}_{LP}>0$ is a positive parameter. The update function of LMS-LP is given as

$$\begin{array}{cc}\hfill w(n+1)& =w(n)-\mathsf{\mu }\frac{\partial G_{LP}\left(w(n)\right)}{\partial w(n)}\hfill \\ & =w(n)+\mathsf{\mu }e(n)x(n)-\frac{{\mathsf{\rho }}_{LP}{\Vert w(n)\Vert }_p^{1-p}\mathrm{sgn}\left(w(n)\right)}{{\mathsf{\epsilon }}_{LP}+{\left|w(n)\right|}^{1-p}}\hfill \end{array}$$

(29)

where ${\mathsf{\epsilon }}_{LP}>0$ is a threshold parameter and ${\mathsf{\rho }}_{LP}=\mathsf{\mu }{\mathsf{\lambda }}_{LP}$. To remove the SαS noise, SLMS-LP based robust adaptive channel estimation is written as

$$w(n+1)=w(n)+\mathsf{\mu }\mathrm{sgn}\left(e(n)\right)x(n)-\frac{{\mathsf{\rho }}_{LP}{\Vert w(n)\Vert }_p^{1-p}\mathrm{sgn}\left(w(n)\right)}{{\mathsf{\epsilon }}_{LP}+{\left|w(n)\right|}^{1-p}}$$

(30)

3.5. Fifth Proposed Algorithm: SLMS-L0

It is well known that the ${\ell }_0$-norm penalty can exploit the sparse structure information. Hence, the L0-LMS algorithm is constructed as

$$G_{L0}\left(w(n)\right)=\frac{1}{2}{e}^2(n)+{\mathsf{\lambda }}_{L0}{\Vert w(n)\Vert }_0$$

(31)

where ${\mathsf{\lambda }}_{L0}>0$ and ${\Vert w(n)\Vert }_0$ stands for optimal ${\ell }_0$-norm function. However, it is a NP-hard problem to solve the ${\ell }_0$-norm sparse minimization [22]. The NP-hard problem in Equation (31) can be solved by an approximate continuous function:

$${\Vert w(n)\Vert }_0\approx {\displaystyle {\sum }_{i=0}^{N-1}\left(1-e^{-\theta \left|w_i(n)\right|}\right)}$$

(32)

Then, the previous cost function (29) is changed to

$$G_{L0}\left(w(n)\right)=\frac{1}{2}{e}^2(n)+{\mathsf{\lambda }}_{L0}{\displaystyle {\sum }_{i=0}^{N-1}\left(1-e^{-\mathsf{\theta }\left|w_i(n)\right|}\right)}$$

(33)

The first-order Taylor series expansion of exponential function $e^{-\mathsf{\theta }\left|w_i(n)\right|}$ can be expressed as

$$e^{-\mathsf{\theta }\left|w_i(n)\right|}\approx \{\begin{array}{cc}1-\mathsf{\theta }\left|w_i(n)\right|,& when\left|w_i(n)\right|\le 1/\mathsf{\theta }\\ 0,& others\end{array}$$

(34)

Then, the LMS-L0 based robust adaptive sparse channel estimation algorithm is given as

$$w(n+1)=w(n)+\mathsf{\mu }e(n)x(n)-{\mathsf{\rho }}_{L0}\mathrm{sgn}\left(w(n)\right)e^{-\mathsf{\theta }\left|w(n)\right|}$$

(35)

where ${\mathsf{\rho }}_{L0}={\mathsf{\mu }\mathsf{\lambda }}_{L0}$. In Equation (35), the exponential function still exhausts high computational resources. To further reduce it, a simple approximation function $\mathsf{\zeta }\left(w(n)\right)$ is proposed in [20]. By introducing sign function into Equation (35), the SLMS-L0 based robust channel estimation algorithm is written as

$$w(n+1)=w(n)+\mathsf{\mu }\mathrm{sgn}\left(e(n)\right)x(n)-{\mathsf{\rho }}_{L0}\mathsf{\zeta }\left(w(n)\right)$$

(36)

where ${\mathsf{\rho }}_{L0}={\mathsf{\mu }\mathsf{\lambda }}_{L0}$ and $\mathsf{\zeta }\left(w_i(n)\right)$ are defined as

$$\mathsf{\zeta }\left(w_i(n)\right)=\{\begin{array}{cc}2{\mathsf{\theta }}^2{w}_i(n)-2\mathsf{\theta }\mathrm{sgn}\left(w_i(n)\right),& when\left|w_i(n)\right|\le 1/\mathsf{\theta }\\ 0,& others\end{array}$$

(37)

for $\mathsf{\zeta }\left(w(n)\right)={\left[\mathsf{\zeta }\left(w_0(n)\right),\mathsf{\zeta }\left(w_1(n)\right),\dots ,\mathsf{\zeta }\left(w_{N-1}(n)\right)\right]}^T$.

4. Convergence Analysis of the Proposed Algorithms

Unlike the standard SLMS algorithm, the proposed sparse SLMS algorithms can further improve estimation accuracy by exploiting channel sparsity. For convenience of theoretical analysis without loss of generality, the above proposed sparse SLMS algorithms are generalized as

$$w(n+1)=w(n)+\mathsf{\mu }\mathrm{sgn}\left(e(n)\right)x(n)-\mathsf{\rho }f\left(w(n)\right)$$

(38)

where $f\left(w(n)\right)$ denotes sparsity constraint function and $\mathsf{\rho }$ denotes the regularization parameter. Throughout this paper, our analysis is based on independent assumptions as below:

$$E\left(z(n)x(n)\right)=0$$

(39)

$$E\left[z(n)x(n)v^T(n)\right]=0$$

(40)

$$E\left[z(n)v(n)x^T(n)\right]=0$$

(41)

$$E\left[z(n)f\left(w(n)\right)x^T(n)\right]=0$$

(42)

$$E\left[z(n)x(n)f^T\left(w(n)\right)\right]=0$$

(43)

Theorem 1. 

If $\mu$ satisfies (15), the mean coefficient vector $E\left\{w(n)\right\}$ approaches

$$w(\infty )=w-\sqrt{\mathsf{\pi }/2}{\mathsf{\mu }}^{-1}\mathsf{\rho }{R}^{-1}{\mathsf{\gamma }}^{1/\mathsf{\alpha }}f\left(w(\infty )\right)$$

(44)

Proof. 

By subtracting $w$ from both sides of (35), the mean estimation error $E\left\{v(n+1)\right\}$ is derived as

$$\begin{array}{cc}\hfill E\left\{v(n+1)\right\}& =E\left\{v(n)\right\}+\mathsf{\mu }E\left\{\mathrm{sgn}(e(n))x(n)\right\}-\mathsf{\rho }f\left(w(n)\right)\hfill \\ & \approx E\left\{v(n)\right\}+\mathsf{\mu }E\left\{\mathrm{sgn}\left(e(n)\right)x(n)|v(n)\right\}-\mathsf{\rho }f\left(w(n)\right)\hfill \\ & =E\left\{v(n)\right\}+\sqrt{2/\mathsf{\pi }}\mathsf{\mu }{\mathsf{\sigma }}_e^{-1}(n)E\left\{e(n)x(n)\right\}-\mathsf{\rho }f\left(w(n)\right)\hfill \\ & =\left\{I-\sqrt{2/\mathsf{\pi }}\mathsf{\mu }{\mathsf{\sigma }}_e^{-1}(n)R\right\}E\left\{v(n)\right\}-\mathsf{\rho }f\left(w(n)\right)\hfill \end{array}$$

(45)

It is worth mentioning that vector $\mathsf{\rho }f\left(w(n)\right)$ is bounded for all sparse constraints. For example, if $f(w(n))=\mathrm{sgn}(w(n))$, then the bound is between $-\mathsf{\rho }{I}_N$ and $\mathsf{\rho }{I}_N$, where $I_N$ is an $N$-length identity vector. For $n\to \infty$, Equation (45) can be rewritten as

$$\begin{array}{cc}\hfill E\left\{v(\infty )\right\}& =\left\{I-\sqrt{2/\mathsf{\pi }}\mathsf{\mu }{\mathsf{\sigma }}_e^{-1}(\infty )R\right\}E\left\{v(\infty )\right\}-\mathsf{\rho }f\left(w(\infty )\right)\hfill \\ & \approx \left\{I-\sqrt{2/\mathsf{\pi }}\mathsf{\mu }{\mathsf{\gamma }}^{-1/\mathsf{\alpha }}R\right\}E\left\{v(\infty )\right\}-\mathsf{\rho }f\left(w(\infty )\right)\hfill \end{array}$$

(46)

where $\mathrm{Tr}\left(RC(\infty )\right)={\mathsf{\sigma }}_x^{2}c(\infty )\ll {\mathsf{\gamma }}^{1/\mathsf{\alpha }}$ and

$${\mathsf{\sigma }}_e^2(\infty )={\lim }_{n\to \infty }{\mathsf{\sigma }}_e^2(n)={\mathsf{\gamma }}^{2/\mathsf{\alpha }}+\mathrm{Tr}\left(RC(\infty )\right)\approx {\mathsf{\gamma }}^{2/\mathsf{\alpha }}$$

(47)

are utilized in the above equation. Since $E\left\{w(\infty )\right\}=w-E\left\{v(\infty )\right\}$, according to Equation (47), one can easily get Theorem 1.

Theorem 2. 

Let $\mathrm{\Omega }$ denotes the index set of nonzero taps, i.e., $w_i\ne 0$ for $i\in \mathrm{\Omega }$. Assuming $\rho$ is sufficiently small so that for every $i\in \mathrm{\Omega }$, the excess MSE of sparse SLMS algorithms is

$$P_{ex}(\infty )=\frac{\mathsf{\mu }{\mathsf{\gamma }}^{1/\mathsf{\alpha }}{\mathsf{\phi }}_2}{\sqrt{2\mathsf{\pi }}{\mathsf{\phi }}_1}+\frac{\mathsf{\rho }{\mathsf{\gamma }}^{1/\mathsf{\alpha }}{\mathsf{\eta }}_1^{\prime }}{\sqrt{2\mathsf{\pi }}\mathsf{\mu }{\mathsf{\phi }}_1}\left(\mathsf{\rho }-\frac{{\mathsf{\eta }}_2^{\prime }}{{\mathsf{\eta }}_1^{\prime }}\right)$$

(48)

where ${\phi }_1$, ${\phi }_2$, ${\eta }_1^{\prime }$ and ${\eta }_2^{\prime }$ are defined as:

$${\mathsf{\phi }}_1=\mathrm{Tr}[{(I-\sqrt{2/\mathsf{\pi }}\mathsf{\mu }{\mathsf{\sigma }}_e^{-1}R)}^{-1}]$$

(49)

$${\mathsf{\phi }}_2=\mathrm{Tr}[R{(I-\sqrt{2/\mathsf{\pi }}\mathsf{\mu }{\mathsf{\sigma }}_e^{-1}R)}^{-1}]⊲$$

(50)

$${\mathsf{\eta }}_1^{\prime }\triangleq \frac{N}{1-\sqrt{2/\mathsf{\pi }}\mathsf{\mu }{\mathsf{\gamma }}^{-1/\mathsf{\alpha }}{\mathsf{\lambda }}_{\max }}$$

(51)

$${\mathsf{\eta }}_2^{\prime }\triangleq 2E\left\{\text{Tr}\left[w(\infty )f^T\left(w(\infty )\right)\right]\right\}-2E\left\{\text{Tr}\left[w{f}^T\left(w(\infty )\right)\right]\right\}$$

(52)

Proof. 

By using the above independent assumptions in Equations (49)–(52), the second moment $C(n+1)$ of the weight error vector $v(n+1)$ can be evaluated recursively as

$$\begin{array}{cc}\hfill C(n+1)& =E\left\{v(n+1)v^T(n+1)\right\}\hfill \\ & =E\left\{\left[v(n)+\mathsf{\mu }\mathrm{sgn}(e(n))x(n)-\mathsf{\rho }f\left(w(n)\right)\right]{\left[v(n)+\mathsf{\mu }\mathrm{sgn}(e(n))x(n)-\mathsf{\rho }f\left(w(n)\right)\right]}^T\right\}\hfill \\ & =E\left\{v(n)v^T(n)\right\}+{\mathsf{\mu }}^{2}E\left\{x(n)x^T(n)\right\}\hfill \\ & +\underset{A_1(n)}{\underbrace{\mathsf{\mu }\left\{E\left[\mathrm{sgn}\left(e(n)\right)v(n)x^T(n)\right]+E\left[\mathrm{sgn}\left(e(n)\right)x(n)v^T(n)\right]\right\}}}\hfill \\ & -\underset{A_2(n)}{\underbrace{\mathsf{\mu }\mathsf{\rho }\left\{E\left[\mathrm{sgn}\left(e(n)\right)x(n)f^T\left(w(n)\right)\right]+E\left[\mathrm{sgn}\left(e(n)\right)f\left(w(n)\right)x^T(n)\right]\right\}}}\hfill \\ & -\underset{A_3(n)}{\underbrace{\mathsf{\rho }\left\{E\left[v(n)f^T\left(w(n)\right)\right]+E\left[f\left(w(n)\right)v^T(n)\right]\right\}}}+\underset{A_4(n)}{\underbrace{{\mathsf{\rho }}^{2}E\left\{f\left(w(n)\right)f^T\left(w(n)\right)\right\}}}\hfill \\ & =C(n)+{\mathsf{\mu }}^{2}R+A_1(n)-\underset{A_5(n)}{\underbrace{\left(A_2(n)+A_3(n)\right)}}+A_4(n)\hfill \end{array}$$

(53)

where $A_1(n)$, $A_2(n)$, and $A_5(n)$ are further derived as

$$\begin{array}{cc}\hfill A_1(n)& \approx \mathsf{\mu }E\left\{\mathrm{sgn}\left(e(n)\right)v(n)x^T(n)|v(n)\right\}+\mathsf{\mu }E\left\{\mathrm{sgn}\left(e(n)\right)x(n)v^T(n)|v(n)\right\}\hfill \\ & =-\sqrt{\mathsf{\pi }/2}\mathsf{\mu }{\mathsf{\sigma }}_e^{-1}(n)\left\{E\left[v(n)E\left[e(n)x^T(n)|v(n)\right]\right]+E\left[E\left[e(n)x(n)|v(n)\right]v^T(n)\right]\right\}\hfill \\ & =-\sqrt{\mathsf{\pi }/2}\mathsf{\mu }{\mathsf{\sigma }}_e^{-1}(n)\left\{E\left[v(n)v^T(n)\right]R+RE\left[v(n)v^T(n)\right]\right\}\hfill \\ & =-\sqrt{\mathsf{\pi }/2}\mathsf{\mu }{\mathsf{\sigma }}_e^{-1}(n)\left[C(n)R+RC(n)\right]\hfill \end{array}$$

(54)

$$\begin{array}{cc}\hfill A_2(n)& =\mathsf{\mu }\mathsf{\rho }\left\{E\left[\mathrm{sgn}\left(e(n)\right)x(n)f^T\left(w(n)\right)\right]+E\left[\mathrm{sgn}\left(e(n)\right)f\left(w(n)\right)x^T(n)\right]\right\}\hfill \\ & \approx \mathsf{\mu }\mathsf{\rho }E\left\{E\left[\mathrm{sgn}\left(e(n)\right)x(n)f^T\left(w(n)\right)|v(n)\right]+E\left[\mathrm{sgn}\left(e(n)\right)f\left(w(n)\right)x^T(n)|v(n)\right]\right\}\hfill \\ & =-\sqrt{2/\mathsf{\pi }}\mathsf{\mu }\mathsf{\rho }{\mathsf{\sigma }}_e^{-1}E\left\{E\left[x(n)e(n)|v(n)\right]f^T\left(w(n)\right)+f\left(w(n)\right)E\left[e(n)x^T(n)|v(n)\right]\right\}\hfill \\ & =-\sqrt{2/\mathsf{\pi }}\mathsf{\mu }\mathsf{\rho }{\mathsf{\sigma }}_e^{-1}\left\{RE\left[v(n)f^T\left(w(n)\right)\right]+E\left[f\left(w(n)\right)v^T(n)\right]R\right\}\hfill \end{array}$$

(55)

$$\begin{array}{cc}\hfill A_5(n)& \triangleq A_2(n)+A_3(n)\hfill \\ & =-\sqrt{2/\mathsf{\pi }}\mathsf{\mu }\mathsf{\rho }{\mathsf{\sigma }}_e^{-1}\left\{RE\left[v(n)f^T\left(w(n)\right)\right]+E\left[f\left(w(n)\right)v^T(n)\right]R\right\}\hfill \\ & +\mathsf{\rho }\left\{E\left[v(n)f^T\left(w(n)\right)\right]+E\left[f\left(w(n)\right)v^T(n)\right]\right\}\hfill \\ & =\mathsf{\rho }\left(I-\sqrt{2/\mathsf{\pi }}\mathsf{\mu }{\mathsf{\sigma }}_e^{-1}R\right)E\left[v(n)f^T\left(w(n)\right)\right]+\mathsf{\rho }E\left[f\left(w(n)\right)v^T(n)\right]\left(I-\sqrt{2/\mathsf{\pi }}\mathsf{\mu }{\mathsf{\sigma }}_e^{-1}R\right)\hfill \end{array}$$

(56)

By substituting Equations (54) and (56) into Equation (53), we obtain

$$\begin{array}{cc}\hfill C(n+1)& =C(n)+{\mathsf{\mu }}^{2}R+A_1(n)-A_5(n)+A_4(n)\hfill \\ & =C(n)+{\mathsf{\mu }}^{2}R-\sqrt{2/\mathsf{\pi }}\mathsf{\mu }{\mathsf{\sigma }}_e^{-1}(n)\left[C(n)R+RC(n)\right]-A_5(n)+A_4(n)\hfill \end{array}$$

(57)

Letting $n\to \infty$ and using Equation (47), Equation (57) is further rewritten as

$$C(\infty )R+RC(\infty )\approx \sqrt{2/\mathsf{\pi }}\mathsf{\mu }{\mathsf{\gamma }}^{1/\mathsf{\alpha }}R+\sqrt{2/\mathsf{\pi }}{\mathsf{\mu }}^{-1}{\mathsf{\gamma }}^{1/\mathsf{\alpha }}\underset{n\to \infty }{\lim }\left[A_4(n)-A_5(n)\right]$$

(58)

Multiplying both sides of Equation (58) by ${\left(I-\sqrt{2/\mathsf{\pi }}\mathsf{\mu }{\mathsf{\sigma }}_e^{-1}R\right)}^{-1}$ from right, the following can be derived as

$$\begin{array}{cc}\hfill \left[C(\infty )R+RC(\infty )\right]{\left(I-\sqrt{2/\mathsf{\pi }}\mathsf{\mu }{\mathsf{\sigma }}_e^{-1}R\right)}^{-1}& \approx \sqrt{2/\mathsf{\pi }}\mathsf{\mu }{\mathsf{\gamma }}^{1/\mathsf{\alpha }}R{\left(I-\sqrt{2/\mathsf{\pi }}\mathsf{\mu }{\mathsf{\sigma }}_e^{-1}R\right)}^{-1}\hfill \\ & +\sqrt{2/\mathsf{\pi }}{\mathsf{\mu }}^{-1}{\mathsf{\gamma }}^{1/\mathsf{\alpha }}\underset{n\to \infty }{\underset{n\to \infty }{\lim }{A}_4(n){\left(I-\sqrt{2/\mathsf{\pi }}\mathsf{\mu }{\mathsf{\sigma }}_e^{-1}R\right)}^{-1}}\hfill \\ & -\sqrt{2/\mathsf{\pi }}{\mathsf{\mu }}^{-1}{\mathsf{\gamma }}^{1/\mathsf{\alpha }}\underset{n\to \infty }{\lim }{A}_5(n){\left(I-\sqrt{2/\mathsf{\pi }}\mathsf{\mu }{\mathsf{\sigma }}_e^{-1}R\right)}^{-1}\hfill \end{array}$$

(59)

Taking the trace of the two sides of Equation (59), since $\mathrm{Tr}\left(C(\infty )R\right)=\mathrm{Tr}\left(RC(\infty )\right)$, the excess MSE is derived as

$$\begin{array}{cc}\hfill P_{ex}(\infty )& =\mathrm{Tr}\left[RC(\infty )\right]\hfill \\ & =\frac{\sqrt{2/\mathsf{\pi }}\mathsf{\mu }{\mathsf{\gamma }}^{1/\mathsf{\alpha }}}{2{\mathsf{\phi }}_1}\underset{{\mathsf{\phi }}_2}{\underbrace{\mathrm{Tr}\left[R{\left(I-\sqrt{2/\mathsf{\pi }}\mathsf{\mu }{\mathsf{\sigma }}_e^{-1}R\right)}^{-1}\right]}}\hfill \\ & +\frac{\sqrt{2/\mathsf{\pi }}{\mathsf{\mu }}^{-1}{\mathsf{\gamma }}^{1/\mathsf{\alpha }}}{2{\mathsf{\phi }}_1}\underset{n\to \infty }{\lim }\underset{{\mathsf{\eta }}_1(n)}{\underbrace{\mathrm{Tr}\left[A_4(n){\left(I-\sqrt{2/\mathsf{\pi }}\mathsf{\mu }{\mathsf{\sigma }}_e^{-1}R\right)}^{-1}\right]}}\hfill \\ & -\frac{\sqrt{2/\mathsf{\pi }}{\mathsf{\mu }}^{-1}{\mathsf{\gamma }}^{1/\mathsf{\alpha }}}{2{\mathsf{\phi }}_1}\underset{n\to \infty }{\lim }\underset{{\mathsf{\eta }}_2(n)}{\underbrace{\mathrm{Tr}\left[A_5(n){\left(I-\sqrt{2/\mathsf{\pi }}\mathsf{\mu }{\mathsf{\sigma }}_e^{-1}R\right)}^{-1}\right]}}\hfill \end{array}$$

(60)

The matrix $(I-\sqrt{2/\mathsf{\pi }}\mathsf{\mu }{\mathsf{\gamma }}^{-1/\mathsf{\alpha }}R)$ is symmetric, and its eigenvalue decomposition can be written as

$$I-\sqrt{2/\mathsf{\pi }}\mathsf{\mu }{\mathsf{\gamma }}^{-1/\mathsf{\alpha }}R=UV{U}^T$$

(61)

with $U$ being the orthonormal matrix of eigenvectors and $V$ being a diagonal matrix of eigenvalues. Therefore, $\left(I-\sqrt{2/\mathsf{\pi }}\mathsf{\mu }{\mathsf{\sigma }}_e^{-1}R\right)=U{V}^{-1}{U}^T$. Let ${\mathsf{\lambda }}_{\max }$ be the largest eigenvalue of the covariance matrix $R$ and $\mathsf{\mu }$ be small enough such that ${(1-\sqrt{2/\mathsf{\pi }}\mathsf{\mu }{\mathsf{\gamma }}^{-1/\mathsf{\alpha }}{\mathsf{\lambda }}_{\max })}^{-1}>0$ under certain noise cases. Since $V^{-1}$ is a diagonal matrix, elements are all non-negative and less than or equal to ${(1-\sqrt{2/\mathsf{\pi }}\mathsf{\mu }{\mathsf{\gamma }}^{-1/\mathsf{\alpha }}{\mathsf{\lambda }}_{\max })}^{-1}$, hence, ${\mathsf{\eta }}_1\triangleq {\lim }_{n\to \infty } {\mathsf{\eta }}_1(n)$ and ${\mathsf{\eta }}_2\triangleq {\lim }_{n\to \infty } {\mathsf{\eta }}_2(n)$ are further derived as

$$\begin{array}{cc}\hfill {\mathsf{\eta }}_1& \triangleq \underset{n\to \infty }{\lim }\mathsf{\eta }(n)=\underset{n\to \infty }{\lim }\mathrm{Tr}\left\{A_4{\left(I-\sqrt{2/\mathsf{\pi }}\mathsf{\mu }{\mathsf{\sigma }}_e^{-1}R\right)}^{-1}\right\}\hfill \\ & =\underset{n\to \infty }{\lim }{\mathsf{\rho }}^{2}E\left\{\mathrm{Tr}\left[f\left(w(n)\right){\left(I-\sqrt{2/\mathsf{\pi }}\mathsf{\mu }{\mathsf{\gamma }}^{1/\mathsf{\alpha }}R\right)}^{-1}{f}^T\left(w(n)\right)\right]\right\}\hfill \\ & =\underset{n\to \infty }{\lim }{\mathsf{\rho }}^{2}E\left\{\mathrm{Tr}\left[f\left(w(n)\right)U{V}^{-1}{U}^T{f}^T\left(w(n)\right)\right]\right\}\hfill \\ & =\underset{n\to \infty }{\lim }{\mathsf{\rho }}^{2}E\left\{\mathrm{Tr}\left[V^{-1}{U}^{T}f\left(w(n)\right)f^T\left(w(n)\right)U\right]\right\}\hfill \\ & \le \underset{n\to \infty }{\lim }\frac{{\mathsf{\rho }}^2}{1-\sqrt{2/\mathsf{\pi }}\mathsf{\mu }{\mathsf{\gamma }}^{-1/\mathsf{\alpha }}{\mathsf{\lambda }}_{\max }}E\left\{\mathrm{Tr}\left[U^{T}f\left(w(n)\right)f^T\left(w(n)\right)U\right]\right\}\hfill \\ & =\frac{{\mathsf{\rho }}^2}{1-\sqrt{2/\mathsf{\pi }}\mathsf{\mu }{\mathsf{\gamma }}^{-1/\mathsf{\alpha }}{\mathsf{\lambda }}_{\max }}E\left\{\mathrm{Tr}\left[f^T\left(w(\infty )\right)U{U}^{T}f\left(w(\infty )\right)\right]\right\}\hfill \\ & \le \frac{{\mathsf{\rho }}^2}{1-\sqrt{2/\mathsf{\pi }}\mathsf{\mu }{\mathsf{\gamma }}^{-1/\mathsf{\alpha }}{\mathsf{\lambda }}_{\max }}E\left\{f^T\left(w(\infty )\right)f\left(w(\infty )\right)\right\}\le \frac{N{\mathsf{\rho }}^2}{1-\sqrt{2/\mathsf{\pi }}\mathsf{\mu }{\mathsf{\gamma }}^{-1/\mathsf{\alpha }}{\mathsf{\lambda }}_{\max }}\hfill \end{array}$$

(62)

$$\begin{array}{cc}\hfill {\mathsf{\eta }}_2& \triangleq \underset{n\to \infty }{\lim }{\mathsf{\eta }}_2(n)=\underset{n\to \infty }{\lim }\text{Tr}\left\{A_5{\left(I-\sqrt{2/\mathsf{\pi }}\mathsf{\mu }{\mathsf{\sigma }}_e^{-1}R\right)}^{-1}\right\}\hfill \\ & =\underset{n\to \infty }{\lim }\mathsf{\rho }E\left\{\text{Tr}\left[v(n)f^T\left(w(n)\right)+f\left(w(n)\right)v^T(n)\right]\right\}\hfill \\ & =\underset{n\to \infty }{\lim }2\mathsf{\rho }E\left\{\text{Tr}\left[v(n)f^T\left(w(n)\right)\right]\right\}\hfill \\ & =\underset{n\to \infty }{\lim }2\mathsf{\rho }E\left\{\text{Tr}\left[w(n)f^T\left(w(n)\right)\right]\right\}-2\mathsf{\rho }E\left\{\text{Tr}\left[w{f}^T\left(w(n)\right)\right]\right\}\hfill \\ & =2\mathsf{\rho }E\left\{\text{Tr}\left[w(\infty )f^T\left(w(\infty )\right)\right]\right\}-2\mathsf{\rho }E\left\{\text{Tr}\left[w{f}^T\left(w(\infty )\right)\right]\right\}\hfill \end{array}.$$

(63)

Substituting Equations (62) and (63) into Equation (60), the excess MSE is finally derived as

$$P_{ex}(\infty )=\frac{\mathsf{\mu }{\mathsf{\gamma }}^{1/\mathsf{\alpha }}{\mathsf{\phi }}_2}{\sqrt{2\mathsf{\pi }}{\mathsf{\phi }}_1}+\frac{\mathsf{\rho }{\mathsf{\gamma }}^{1/\mathsf{\alpha }}{\mathsf{\eta }}_1^{\prime }}{\sqrt{2\mathsf{\pi }}\mathsf{\mu }{\mathsf{\phi }}_1}\left(\mathsf{\rho }-\frac{{\mathsf{\eta }}_2^{\prime }}{{\mathsf{\eta }}_1^{\prime }}\right)$$

(64)

where ${\mathsf{\eta }}_1^{\prime }\triangleq {{\mathsf{\eta }}_1/\mathsf{\rho }}^2$ and ${\mathsf{\eta }}_2^{\prime }\triangleq {{\mathsf{\eta }}_2/\mathsf{\rho }}^2$. According to Equation (62), one can find that ${\mathsf{\eta }}_1^{\prime }$ is bound as

$$0<{\mathsf{\eta }}_2^{\prime }\le \frac{N}{1-\sqrt{2/\mathsf{\pi }}\mathsf{\mu }{\mathsf{\gamma }}^{-1/\mathsf{\alpha }}{\mathsf{\lambda }}_{\max }}$$

(65)

The excess MSE of sparse SLMS in Equation (65) implies that choosing suitable $\mathsf{\rho }<{\mathsf{\eta }}_1^{\prime }/{\mathsf{\eta }}_2^{\prime }$ can lead to smaller excess MSE than standard SLMS algorithm.

5. Numerical Simulations and Discussion

To evaluate the proposed robust channel estimation algorithms, we compare these algorithms in terms of channel sparsity and non-Gaussian noise level. A typical broadband wireless communication system is considered in computer simulations [3]. The baseband bandwidth is assigned as 60 MHz and the carrier frequency is set as 2.1 GHz. Signal multipath transmission causes the $1.06\mathsf{\mu }\mathrm{s}$ delay spread. According to the Shannon sampling theory, the channel length is equivalent to n = 128. In addition, average mean square error (MSE) is adopted for evaluate the estimation error. The MSE is defined as

$$\text{MSE}\left\{w(n)\right\}(\text{dB})\triangleq 10{\log }_{10}\left(1/M\right){\displaystyle {\sum }_{m=1}^M{║w(n)-w║}_2^2/{║w║}_2^2}$$

(66)

where $w$ and denote actual channel and estimator, respectively. $M=1000$ independent runs are adopted for Monte Carlo simulations. The nonzero channel taps are generated to satisfy random Gaussian distribution as $\mathcal{C}\mathcal{N}\left(\mathit{0},{\mathsf{\sigma }}_w^{2}I\right)$ and all of these positions are randomly allocated within $w$, which is normalized as $E\{\Vert w{\Vert }_2^2\}=1$. All of the simulation parameters are listed in

Table 1. List of computer simulation parameters in robust adaptive sparse channel estimation.

Parameters	Values
Training sequence	Pseudo-random binary sequence
Non-Gaussian noise level	$\mathsf{\alpha }\in \left\{1.0,1.2,1.4,,1.6,1.8,2.0\right\}$, $\mathsf{\beta }=0,\mathsf{\gamma }\in \left\{0.5,1.0,1.5,2.0,2.5\right\}$, $\mathsf{\delta }=0$
Channel length	$\mathrm{N}=128$
No. of nonzero coefficients	$\mathrm{K}\in \left\{2,4,8,16\right\}$
Distribution of nonzero coefficient	Random Gaussian $\mathcal{C}\mathcal{N}\left(0,1\right)$
Received SNR	$5\mathrm{dB}~30\mathrm{dB}$
Gradient descend step size	$\mathsf{\mu }=0.005$
Sparsity-aware positive parameters (i.e., ${\mathsf{\rho }}_{ZA}={\mathsf{\mu }\mathsf{\lambda }}_{ZA}$)	${\mathsf{\rho }}_{ZA}=2\times {10}^{-4}$, ${\mathsf{\rho }}_{RZA}=2\times {10}^{-3}$ ${\mathsf{\rho }}_{RL1}=5\times {10}^{-5}$, ${\mathsf{\rho }}_{LP}=5\times {10}^{-6}$, ${\mathsf{\rho }}_{LP}=2\times {10}^{-4}$
Reweight parameter of (S)LMS-RZA	${\mathsf{\epsilon }}_{RZA}=20$
Threshold parameter of (S)LMS-RL1	${\mathsf{\delta }}_{RL1}=0.05$
Threshold parameter of (S)LMS-LP	${\mathsf{\epsilon }}_{LP}=0.05$
Approximate parameters of (S)LMS-L0	$\mathsf{∆}=4$, $Q=10$

.

5.1. Experiment 1. MSE Curves of Proposed Algorithms vs. Different Alpha-Stable Noise

The proposed robust adaptive sparse channel estimation algorithms are evaluated with respect to $\alpha$ in the scenarios of $K=8$ and SNR = 10 dB, as shown in Figure 2. Under different alpha-stable noise regimes, i.e., $\mathsf{\alpha }\in \left\{1.0,1.2,1.4,1.6,1.8\right\}$, our proposed algorithms can achieve much better MSE performance than standard SLMS. With different sparsity constraint functions, i.e., ZA, RZA, LP, RL1, and L0, different performance gain could be obtained. Since L0-norm constraint exploits channel sparsity most efficiently in these sparse constraint functions, Figure 2 shows that the lowest MSE of SLMS-L0 results in the lowest MSE. Indeed, Figure 2 implies that taking more channel sparse structure information can obtain more performance gain. Hence, selecting an efficient sparse constraint function is an important step in devising sparse SLMS algorithms. In addition, it is worth noting that the convergence speed of SLMS-RZA is slightly slower than other sparse SLMS algorithms while its steady-state MSE performance as good as SLMS-LP. According to Figure 2, proposed SLMS algorithms are confirmed by simulation results in different impulsive noise cases.

5.2. Experiment 2. MSE Curves of Proposed Algorithms vs. Channel Sparsity

Our proposed channel estimation algorithms are evaluated with channel sparsity $K\in \left\{2, 4, 8, 16\right\}$ in the scenarios of $\mathsf{\alpha }=1.2$, $\mathsf{\gamma }=1.0$, $K=8$ and $SNR=10\mathrm{dB}$, as shown in Figure 3. We can find that the proposed sparse SLMS algorithms depend on channel sparsity $K$, i.e., our proposed algorithms obtained correspondingly better MSE performance in a scenario of sparser channels. In other words, exploiting more channel sparsity information could produce more performance gain and vice versa. Hence, the proposed methods are effective to exploit channel sparsity as well as remove non-Gaussian α-stable noise.

5.3. Experiment 3. MSE Curves of Proposed Algorithms vs. Characteristic Exponent

The average MSE curves of the proposed algorithm with respect to characteristic exponent $\mathsf{\alpha }\in \left\{0.8,1.0,1.2,1.4,1.6,1.8,2.0\right\}$ in scenarios of dispersion parameter $\mathsf{\gamma }=1.0$, channel length $N=128$, channel sparsity $K=8$ and $SNR=10\mathrm{dB}$, are depicted as shown in Figure 4. The proposed algorithm is very stable for the different strengths of impulsive noises that are controlled by the characteristic exponent $\mathsf{\alpha }$. In addition, it is very interesting that the convergence speed of the proposed SLMS algorithms may be reduced by the relatively small $\mathsf{\alpha }$. The main reason the proposed SLMS algorithm is utilized is that the sign function is stable at different values of $\mathsf{\alpha }$. Hence, the proposed algorithm can mitigate non-Gaussian α-stable noise.

5.4. Experiment 4. MSE Curves of Proposed Algorithms vs. Dispersive Parameter

Dispersive distribution of $\mathsf{\alpha }$-stable noise has harmful effects. This experiment evaluates the MSE performance of proposed SLMS algorithms in different dispersive parameters $\mathsf{\gamma }\in \left\{0.5,1.0,1.5,2.0,2.5\right\}$ in the scenarios of $\mathsf{\alpha }=1.2$, $K=8,$ and SNR = 10 dB, as shown in Figure 5. Larger $\mathsf{\gamma }$ means more serious dispersion of α-stable noise and a worse performance for the proposed algorithm and vice versa. Figure 5 implies that the proposed SLMS algorithms are deteriorated by $\mathsf{\gamma }$ rather than $\mathsf{\alpha }$. The main reason is that the proposed SLMS algorithm can mitigate the amplitude effect of the $\mathsf{\alpha }$-stable noise due to the fact that the sign function is utilized in the proposed SLMS algorithms.

5.5. Experiment 5. MSE Curves of Proposed Algorithms vs. SNR

In the different SNR regimes, the average MSE curves of the proposed algorithms are demonstrated in Figure 6 in the scenarios of characteristic exponent $\mathsf{\alpha }=1.2$, dispersive parameter $\mathsf{\gamma }=1.0$, channel length $N=128$, and channel sparsity $K=8$. The purpose of directing figures in Figure 6 is to further confirm the effectiveness of the proposed algorithms under different SNR regimes.

6. Conclusions

Based on SαS noise model, we have proposed five sparse SLMS algorithms for robust channel estimation in this paper by introducing sparsity-inducing penalty functions into the standard SLMS algorithm so that channel sparsity can be exploited to improve the channel estimation performance. Theoretical analysis verified the convergence of the proposed algorithms in terms of mean and excess MSE. Numerical simulations were provided to validate the performance gain of our proposed algorithm.