# Sparse Adaptive Channel Estimation Based onl

Authors: Yingsong Li; Wenxing Li; Wenhua Yu; Jian Wan; Zhiwei Li
Journal: International Journal of Antennas and Propagation
 (2014)

---

## Abstract

We propose anl
p-norm-penalized affine projection algorithm (LP-APA) for broadband multipath adaptive channel estimations. The proposed LP-APA is realized by incorporating an l
p-norm into the cost function of the conventional affine projection algorithm (APA) to exploit the sparsity property of the broadband wireless multipath channel, by which the convergence speed and steady-state performance of the APA are significantly improved. The implementation of the LP-APA is equivalent to adding a zero attractor to its iterations. The simulation results, which are obtained from a sparse channel estimation, demonstrate that the proposed LP-APA can efficiently improve channel estimation performance in terms of both the convergence speed and steady-state performance when the channel is exactly sparse.


---

## Body

## 1. Introduction

Recently, with the fast increasing demand for high data rate and wide bandwidth in wireless mobile communication, the use of broadband signal transmission has become an important technique for next-generation wireless communication systems, for instance, 3GPP long-term evolution (LTE) and worldwide interoperability for microwave access (WiMAX) [1–3]. Coherent detection and equalization in broadband communication systems require perfect channel state information [4], which is not known at the receiver. Therefore, the achievable performance of coherent detection for such broadband communication system relies heavily on the accuracy of the channel estimation [2–7], which can help to improve the communication quality. Fortunately, the accurate channel estimation can be obtained by means of the adaptive filter algorithms, such as least mean square (LMS), recursive least squares (RLS), and affine projection algorithm (APA) [8, 9]. On the other hand, normalized LMS (NLMS) algorithm, which is an improved LMS algorithm, has been widely studied and applied in channel estimation owing to its low complexity, high stability, and easy implementation. However, NLMS algorithm converges slowly, making it difficult to track the rapid time-varying channels. Consequently, the APA with an acceptable computational complexity between the NLMS and RLS algorithms has been deeply developed and applied in echo cancellation and channel estimations [9, 10].On the other hand, the measurement results of the broadband channel showed that the wireless multipath channel consists of only a few dominant active propagation paths whose magnitudes are nonzero, even though they have large propagation delays [5, 11, 12]. Thus, these channels can be regarded as a sparse channel with a few nonzero taps which are dominant, while other inactive taps are zero or close to zero because of the noise in the channel. However, the classical adaptive channel estimation algorithms, such as NLMS algorithm and APA, may perform poorly when the channel is exactly sparse [13]. As a consequence, a great number of sparse signal estimation algorithms have been presented to improve the estimation performance for sparse channels, such as compressed sensing (CS) [5, 14–16] and zero-attracting adaptive channel estimation algorithms [13, 17–23]. However, these CS reconstruction algorithms are sensitive to the noise in the channel estimation and have high computational complexity [19].Other effective adaptive channel estimation algorithms, denoted as zero-attracting algorithms, have been reported by the combination of the CS theory [15, 16] and the LMS algorithm [8], which are famous as zero-attracting LMS (ZA-LMS) and reweighted ZA-LMS (RZA-LMS) algorithms [13]. Recently, these zero-attracting (ZA) techniques have been expanded to the APA in order to improve the convergence speed of the zero-attracting LMS algorithms [20], which are denoted as zero-attracting APA (ZA-APA) and reweighted ZA-APA (RZA-APA). As a result, the zero-attracting APAs converge faster than those of the ZA LMSs due to the reuse data scheme in the APA. However, these previously proposed zero-attracting algorithms, which include the ZA-LMS algorithm and the ZA-APA, are realized by integrating an l
1-norm into the cost functions of the standard LMS and APA, respectively. Moreover, these l
1-norm-penalized algorithms impose a condition that the number of the active taps must be very small as compared to the number of inactive channel taps.In this paper, we proposed anl
p-norm-penalized APA (LP-APA) that incorporates an l
p-norm into the cost function of the conventional APA on the basis of the concepts of zero-attracting algorithm proposed in [13, 17–23], by which the convergence speed and steady-state performance of the conventional APA can be significantly improved when the channel is exactly sparse. Moreover, the proposed LP-APA has an extra parameter p, which is more flexible than the previously proposed zero-attracting APAs [20–22]. The LP-APA is realized by introducing a zero attractor in its iterations, which is used to attract the inactive taps to zero quickly. In other words, our proposed LP-APA can inherit the benefits of both the conventional APA and the past zero-attracting algorithms and, hence, it can achieve faster convergence speed and smaller steady-state error in comparison with the conventional APA. In this study, our proposed LP-APA is implemented over a sparse multipath channel in single antenna systems in order to verify the channel estimation performance in comparison with the NLMS, APA, ZA-APA, and RZA-APA. Computer simulation results demonstrate that the proposed LP-APA achieves better estimation performance in terms of both the convergence speed and steady-state behavior for sparse channel estimation.The remainder of this paper is organized as follows. In Section2, we briefly discuss the previously proposed conventional APA, ZA-APA, and RZA-APA based on a sparse multipath communication system. In Section 3, we mathematically propose the LP-APA by the use of an l
p-norm-penalty in the cost function of the conventional APA. Furthermore, the update function of the LP-APA is obtained by using Lagrange multiplier method. In Section 4, the channel estimation performance of the proposed LP-APA is experimentally investigated over a sparse channel and compared with those of the ZA-APA, RZA-APA, APA, and NLMS algorithms. Finally, Section 5 draws a conclusion for this paper.


## 2. Conventional Channel Estimation Algorithms

In this section, a sparse multipath communication system shown in Figure1 is employed in order to illustrate the conventional channel estimation algorithms, namely, APA, ZA-APA, and RZA-APA. The input signal x
(
n
)
=
[
x
(
n
)
,
x
(
n
-
1
)
,
…
,
x
(
n
-
N
+
1
)
]
T, which contains the N most recent samples, is transmitted over an unknown finite impulse response (FIR) channel with channel impulse response (CIR) h
=
[
h
0
,
h
1
,
…
,
h
N
-
1
]
T, where (
·
)
T is the transposition operation. The input signal x
(
n
) is also an input of the channel estimator h
^
(
n
) with N coefficients to generate an estimation output y
^
(
n
), and the desired signal d
(
n
), which is obtained at the receiver, is composed of the channel output y
(
n
) and the noise v
(
n
) in the channel. The purpose of the channel estimation is to estimate the unknown channel h by using the APA, ZA-APA, and RZA-APA.Figure 1
Typical sparse multipath communication system.


### 2.1. Review of Conventional APA

The APA adopts multiple projection scheme by utilizing past vectors from time iterationn to time iteration (
n
-
Q
+
1
), where Q is defined as the affine projection order. In the APA, we assume that the last Q input signal vectors are organized as a matrix as follows:
(1)
U
(
n
)
=
[
x
T
(
n
)
x
T
(
n
-
1
)
⋮
x
T
(
n
-
Q
+
1
)
]
,
where x
(
n
) is the input signal. We also define the following useful vectors to further describe the APA, such as the desired signal d
(
n
), the estimation output of the APA filter y
^
(
n
), and the additive white Gaussian noise v
(
n
):
(2)
y
^
(
n
)
=
[
y
^
(
n
)
y
^
(
n
-
1
)
⋯
y
^
(
n
-
Q
+
1
)
]
T
,
d
(
n
)
=
[
d
(
n
)
d
(
n
-
1
)
⋯
d
(
n
-
Q
+
1
)
]
T
,
v
(
n
)
=
[
v
(
n
)
v
(
n
-
1
)
⋯
v
(
n
-
Q
+
1
)
]
T
.For channel estimation, the APA is used to minimize(3)
∥
h
^
(
n
+
1
)
-
h
^
(
n
)
∥
2
subject
to:
d
(
n
)
-
U
(
n
)
h
^
(
n
+
1
)
=
0
.Here, the Lagrange multiplier method is employed in order to find out the solutions that minimize the cost functionJ
APA
(
n
+
1
) of the APA and J
APA
(
n
+
1
) is given by
(4)
J
APA
(
n
+
1
)
=
∥
h
^
(
n
+
1
)
-
h
^
(
n
)
∥
2
+
[
d
(
n
)
-
U
(
n
)
h
^
(
n
+
1
)
]
T
λ
APA
,
where λ
APA is a Q
×
1 Lagrange multiplier vector with λ
APA
=
[
λ
0
λ
1
⋯
λ
Q
-
1
]
T. By calculating the gradient of J
APA
(
n
+
1
), we have
(5)
∂
J
APA
(
n
+
1
)
∂
h
^
(
n
+
1
)
=
0
,
∂
J
APA
(
n
+
1
)
∂
λ
=
0
,
(6)
h
^
(
n
+
1
)
=
h
^
(
n
)
+
U
T
(
n
)
[
U
(
n
)
U
T
(
n
)
]
-
1
e
(
n
)
=
h
^
(
n
)
+
U
+
(
n
)
e
(
n
)
,
where U
+
(
n
)
=
U
T
(
n
)
[
U
(
n
)
U
T
(
n
)
]
-
1. In order to balance the convergence speed and the steady-state performance, a step size μ
APA is introduced into (6), and hence, the update function (6) of the APA can be modified to
(7)
h
^
(
n
+
1
)
=
h
^
(
n
)
+
μ
APA
U
+
(
n
)
e
(
n
)
.It is worthwhile to note that the APA is a NLMS algorithm when the affine projection orderQ is set to one.


### 2.2. Review of the ZA-APA and RZA-APA

In this subsection, we briefly review the ZA-APA and RZA-APA. On the basis of the past studies, we know that the cost function of the ZA-APA is defined by combining the cost functionJ
APA
(
n
+
1
) of the standard APA with an l
1-norm-penalty of the channel estimator and is expressed as
(8)
J
ZA
(
n
+
1
)
=
∥
h
^
(
n
+
1
)
-
h
^
(
n
)
∥
2
+
[
d
(
n
)
-
U
(
n
)
h
^
(
n
+
1
)
]
T
λ
ZA
+
γ
ZA
∥
h
^
(
n
+
1
)
∥
1
,
where λ
ZA is the Lagrange multiplier vector with a size of Q
×
1, while γ
ZA is a regularization parameter which is used to balance the estimation error and the sparse l
1-norm-penalty of h
^
(
n
+
1
). To minimize the cost function of the ZA-APA, we use the Lagrange multiplier method on J
ZA
(
n
+
1
), and we obtain
(9)
∂
J
ZA
(
n
+
1
)
∂
h
^
(
n
+
1
)
=
2
h
^
(
n
+
1
)
-
2
h
^
(
n
)
-
U
T
(
n
)
λ
ZA
+
γ
ZA
sgn
⁡
[
h
^
(
n
+
1
)
]
,
where sgn
⁡
[
x
] is a component-wise sign function defined as follows:
(10)
sgn
⁡
[
x
]
=
{
x
|
x
|
,
x
≠
0
0
,
x
=
0
.In order to get the minimization of (9), the left-hand side (LHS) of (9) is set to zero. Therefore, we have
(11)
h
^
(
n
+
1
)
=
h
^
(
n
)
+
1
2
U
T
(
n
)
λ
ZA
-
1
2
γ
ZA
sgn
⁡
[
h
^
(
n
+
1
)
]
.Then, by multiplyingU
(
n
) on both sides of (11) and using the e
(
n
)
=
d
(
n
)
-
U
(
n
)
h
^
(
n
), we can get
(12)
λ
ZA
=
2
e
(
n
)
+
γ
ZA
U
(
n
)
sgn
⁡
[
h
^
(
n
+
1
)
]
U
(
n
)
U
T
(
n
)
.Substituting (12) into (11), assuming sgn
⁡
[
h
^
(
n
+
1
)
]
≈
sgn
⁡
[
h
^
(
n
)
] at the steady stage, and introducing a step-size μ
ZA to balance the convergence speed and the steady-state performance, we can obtain the update function of the ZA-APA
(13)
h
^
(
n
+
1
)
=
h
^
(
n
)
+
μ
ZA
U
+
(
n
)
e
(
n
)
+
1
2
γ
ZA
U
+
(
n
)
U
(
n
)
sgn
⁡
[
h
^
(
n
)
]
-
1
2
γ
ZA
sgn
⁡
[
h
^
(
n
)
]
.From the update equation (13) of the ZA-APA, we find that there are two additional terms in comparison with the update equation (7) of the conventional APA, which attract the inactive taps to zero when the tap magnitudes of the sparse channel are zero or close to zero. These two additional terms are regarded as zero attractors whose zero-attracting strengths are controlled by the regularization parameter γ
ZA. In a word, the zero attractor can speed up the convergence of the ZA-APA when the majority of taps of the channel h are inactive ones, such as sparse channel.Unfortunately, the ZA-APA cannot distinguish the active taps and the inactive taps of the sparse channel so that it exerts the same penalty to all the channel taps, which forces all the channel taps to zero uniformly [13, 20]. Therefore, the performance of the ZA-APA might be degraded for less sparse channel. In order to improve the estimation performance of the ZA-APA, a heuristic method first investigated in [24] and used in [20] to reinforce the zero attractor was proposed, which was denoted as RZA-APA. In the RZA-APA, ∑
i
=
1
N
log
⁡
(
1
+
ε
RZA
|
h
^
i
(
n
)
|
)
(
i
=
1,2
,
…
,
N
) is adopted instead of ∥
h
^
(
n
)
∥
1 used in ZA-APA. Thus, the cost function of the RZA-APA can be written as
(14)
J
RZA
(
n
+
1
)
=
∥
h
^
(
n
+
1
)
-
h
^
(
n
)
∥
2
+
[
d
(
n
)
-
U
(
n
)
h
^
(
n
+
1
)
]
T
λ
RZA
+
γ
RZA
∑
i
=
1
N
‍
log
⁡
(
1
+
ε
RZA
|
h
^
i
(
n
+
1
)
|
)
,
where γ
RZA is a regularization parameter for balancing the estimation error and the strength of the zero attractor, ε
RZA
>
0 is a positive threshold which is set to  10 in [13, 20] to obtain optimal performance, and λ
RZA is a vector of the Lagrange multiplier with size of Q
×
1. We use the Lagrange multiplier to the cost function of the RZA-APA and assume sgn
⁡
[
h
^
(
n
+
1
)
]
/
(
1
+
ε
RZA
|
h
^
(
n
+
1
)
|
)
≈
sgn
⁡
[
h
^
(
n
)
]
/
(
1
+
ε
RZA
|
h
^
(
n
)
|
) in the steady stage. Then, we can get the update equation of the RZA-APA by taking the statistical property of the channel
(15)
h
^
(
n
+
1
)
=
h
^
(
n
)
+
μ
RZA
U
+
(
n
)
e
(
n
)
+
1
2
γ
RZA
U
+
(
n
)
U
(
n
)
sgn
⁡
[
h
^
(
n
)
]
1
+
ε
RZA
|
h
^
(
n
)
|
-
1
2
γ
RZA
sgn
⁡
[
h
^
(
n
)
]
1
+
ε
RZA
|
h
^
(
n
)
|
,
where μ
RZA is the step size of the RZA-APA.


## 2.1. Review of Conventional APA

The APA adopts multiple projection scheme by utilizing past vectors from time iterationn to time iteration (
n
-
Q
+
1
), where Q is defined as the affine projection order. In the APA, we assume that the last Q input signal vectors are organized as a matrix as follows:
(1)
U
(
n
)
=
[
x
T
(
n
)
x
T
(
n
-
1
)
⋮
x
T
(
n
-
Q
+
1
)
]
,
where x
(
n
) is the input signal. We also define the following useful vectors to further describe the APA, such as the desired signal d
(
n
), the estimation output of the APA filter y
^
(
n
), and the additive white Gaussian noise v
(
n
):
(2)
y
^
(
n
)
=
[
y
^
(
n
)
y
^
(
n
-
1
)
⋯
y
^
(
n
-
Q
+
1
)
]
T
,
d
(
n
)
=
[
d
(
n
)
d
(
n
-
1
)
⋯
d
(
n
-
Q
+
1
)
]
T
,
v
(
n
)
=
[
v
(
n
)
v
(
n
-
1
)
⋯
v
(
n
-
Q
+
1
)
]
T
.For channel estimation, the APA is used to minimize(3)
∥
h
^
(
n
+
1
)
-
h
^
(
n
)
∥
2
subject
to:
d
(
n
)
-
U
(
n
)
h
^
(
n
+
1
)
=
0
.Here, the Lagrange multiplier method is employed in order to find out the solutions that minimize the cost functionJ
APA
(
n
+
1
) of the APA and J
APA
(
n
+
1
) is given by
(4)
J
APA
(
n
+
1
)
=
∥
h
^
(
n
+
1
)
-
h
^
(
n
)
∥
2
+
[
d
(
n
)
-
U
(
n
)
h
^
(
n
+
1
)
]
T
λ
APA
,
where λ
APA is a Q
×
1 Lagrange multiplier vector with λ
APA
=
[
λ
0
λ
1
⋯
λ
Q
-
1
]
T. By calculating the gradient of J
APA
(
n
+
1
), we have
(5)
∂
J
APA
(
n
+
1
)
∂
h
^
(
n
+
1
)
=
0
,
∂
J
APA
(
n
+
1
)
∂
λ
=
0
,
(6)
h
^
(
n
+
1
)
=
h
^
(
n
)
+
U
T
(
n
)
[
U
(
n
)
U
T
(
n
)
]
-
1
e
(
n
)
=
h
^
(
n
)
+
U
+
(
n
)
e
(
n
)
,
where U
+
(
n
)
=
U
T
(
n
)
[
U
(
n
)
U
T
(
n
)
]
-
1. In order to balance the convergence speed and the steady-state performance, a step size μ
APA is introduced into (6), and hence, the update function (6) of the APA can be modified to
(7)
h
^
(
n
+
1
)
=
h
^
(
n
)
+
μ
APA
U
+
(
n
)
e
(
n
)
.It is worthwhile to note that the APA is a NLMS algorithm when the affine projection orderQ is set to one.


## 2.2. Review of the ZA-APA and RZA-APA

In this subsection, we briefly review the ZA-APA and RZA-APA. On the basis of the past studies, we know that the cost function of the ZA-APA is defined by combining the cost functionJ
APA
(
n
+
1
) of the standard APA with an l
1-norm-penalty of the channel estimator and is expressed as
(8)
J
ZA
(
n
+
1
)
=
∥
h
^
(
n
+
1
)
-
h
^
(
n
)
∥
2
+
[
d
(
n
)
-
U
(
n
)
h
^
(
n
+
1
)
]
T
λ
ZA
+
γ
ZA
∥
h
^
(
n
+
1
)
∥
1
,
where λ
ZA is the Lagrange multiplier vector with a size of Q
×
1, while γ
ZA is a regularization parameter which is used to balance the estimation error and the sparse l
1-norm-penalty of h
^
(
n
+
1
). To minimize the cost function of the ZA-APA, we use the Lagrange multiplier method on J
ZA
(
n
+
1
), and we obtain
(9)
∂
J
ZA
(
n
+
1
)
∂
h
^
(
n
+
1
)
=
2
h
^
(
n
+
1
)
-
2
h
^
(
n
)
-
U
T
(
n
)
λ
ZA
+
γ
ZA
sgn
⁡
[
h
^
(
n
+
1
)
]
,
where sgn
⁡
[
x
] is a component-wise sign function defined as follows:
(10)
sgn
⁡
[
x
]
=
{
x
|
x
|
,
x
≠
0
0
,
x
=
0
.In order to get the minimization of (9), the left-hand side (LHS) of (9) is set to zero. Therefore, we have
(11)
h
^
(
n
+
1
)
=
h
^
(
n
)
+
1
2
U
T
(
n
)
λ
ZA
-
1
2
γ
ZA
sgn
⁡
[
h
^
(
n
+
1
)
]
.Then, by multiplyingU
(
n
) on both sides of (11) and using the e
(
n
)
=
d
(
n
)
-
U
(
n
)
h
^
(
n
), we can get
(12)
λ
ZA
=
2
e
(
n
)
+
γ
ZA
U
(
n
)
sgn
⁡
[
h
^
(
n
+
1
)
]
U
(
n
)
U
T
(
n
)
.Substituting (12) into (11), assuming sgn
⁡
[
h
^
(
n
+
1
)
]
≈
sgn
⁡
[
h
^
(
n
)
] at the steady stage, and introducing a step-size μ
ZA to balance the convergence speed and the steady-state performance, we can obtain the update function of the ZA-APA
(13)
h
^
(
n
+
1
)
=
h
^
(
n
)
+
μ
ZA
U
+
(
n
)
e
(
n
)
+
1
2
γ
ZA
U
+
(
n
)
U
(
n
)
sgn
⁡
[
h
^
(
n
)
]
-
1
2
γ
ZA
sgn
⁡
[
h
^
(
n
)
]
.From the update equation (13) of the ZA-APA, we find that there are two additional terms in comparison with the update equation (7) of the conventional APA, which attract the inactive taps to zero when the tap magnitudes of the sparse channel are zero or close to zero. These two additional terms are regarded as zero attractors whose zero-attracting strengths are controlled by the regularization parameter γ
ZA. In a word, the zero attractor can speed up the convergence of the ZA-APA when the majority of taps of the channel h are inactive ones, such as sparse channel.Unfortunately, the ZA-APA cannot distinguish the active taps and the inactive taps of the sparse channel so that it exerts the same penalty to all the channel taps, which forces all the channel taps to zero uniformly [13, 20]. Therefore, the performance of the ZA-APA might be degraded for less sparse channel. In order to improve the estimation performance of the ZA-APA, a heuristic method first investigated in [24] and used in [20] to reinforce the zero attractor was proposed, which was denoted as RZA-APA. In the RZA-APA, ∑
i
=
1
N
log
⁡
(
1
+
ε
RZA
|
h
^
i
(
n
)
|
)
(
i
=
1,2
,
…
,
N
) is adopted instead of ∥
h
^
(
n
)
∥
1 used in ZA-APA. Thus, the cost function of the RZA-APA can be written as
(14)
J
RZA
(
n
+
1
)
=
∥
h
^
(
n
+
1
)
-
h
^
(
n
)
∥
2
+
[
d
(
n
)
-
U
(
n
)
h
^
(
n
+
1
)
]
T
λ
RZA
+
γ
RZA
∑
i
=
1
N
‍
log
⁡
(
1
+
ε
RZA
|
h
^
i
(
n
+
1
)
|
)
,
where γ
RZA is a regularization parameter for balancing the estimation error and the strength of the zero attractor, ε
RZA
>
0 is a positive threshold which is set to  10 in [13, 20] to obtain optimal performance, and λ
RZA is a vector of the Lagrange multiplier with size of Q
×
1. We use the Lagrange multiplier to the cost function of the RZA-APA and assume sgn
⁡
[
h
^
(
n
+
1
)
]
/
(
1
+
ε
RZA
|
h
^
(
n
+
1
)
|
)
≈
sgn
⁡
[
h
^
(
n
)
]
/
(
1
+
ε
RZA
|
h
^
(
n
)
|
) in the steady stage. Then, we can get the update equation of the RZA-APA by taking the statistical property of the channel
(15)
h
^
(
n
+
1
)
=
h
^
(
n
)
+
μ
RZA
U
+
(
n
)
e
(
n
)
+
1
2
γ
RZA
U
+
(
n
)
U
(
n
)
sgn
⁡
[
h
^
(
n
)
]
1
+
ε
RZA
|
h
^
(
n
)
|
-
1
2
γ
RZA
sgn
⁡
[
h
^
(
n
)
]
1
+
ε
RZA
|
h
^
(
n
)
|
,
where μ
RZA is the step size of the RZA-APA.


## 3. Proposed LP-APA Sparse Channel Estimation Algorithm

On the basis of the conventional APA and the zero-attracting techniques used in the ZA-APA and RZA-APA, we proposed anl
p-norm-penalized affine projection algorithm (LP-APA) by integrating an l
p-norm into the cost function of the conventional APA in order to design a zero attractor. The proposed LP-APA is also a zero-attracting algorithm, which can further exploit the sparsity property of the wireless multipath channel. In the LP-APA, an l
p-norm is employed to replace the l
1-norm in the ZA-APA. As for channel estimation, the objective of the LP-APA is to minimize
(16)
∥
h
^
(
n
+
1
)
-
h
^
(
n
)
∥
2
+
γ
LP
∥
h
^
(
n
+
1
)
∥
p
subject
to:
d
(
n
)
-
U
(
n
)
h
^
(
n
+
1
)
=
0
,
where γ
LP is a very small constant that is used to balance the estimator error and the l
p-norm-penalized h
^
(
n
+
1
) and ∥
·
∥
p is the l
p-norm with 0
<
p
<
1. It is found that an extra tunable parameter p in the l
p-norm can provide a flexible penalty for the proposed LP-APA in comparison with the fixed l
1-norm in ZA-APA. In order to minimize (16), the Lagrange multiplier method is employed and the cost function of the LP-APA can be written as
(17)
J
LP
(
n
+
1
)
=
∥
h
^
(
n
+
1
)
-
h
^
(
n
)
∥
2
+
[
d
(
n
)
-
U
(
n
)
h
^
(
n
+
1
)
]
T
λ
LP
+
γ
LP
∥
h
^
(
n
+
1
)
∥
p
,
where λ
LP is the Lagrange multiplier vector.By calculating the gradient of the cost functionJ
LP
(
n
+
1
) of the LP-APA, we have
(18)
∂
J
LP
(
n
+
1
)
∂
h
^
(
n
+
1
)
=
0
,
∂
J
LP
(
n
+
1
)
∂
λ
LP
=
0
.Then, by solving (18), we get
(19)
h
^
(
n
+
1
)
=
h
^
(
n
)
+
1
2
U
T
(
n
)
λ
LP
-
1
2
γ
LP
∥
h
^
(
n
)
∥
p
1
-
p
sgn
⁡
(
h
^
(
n
)
)
|
h
^
(
n
)
|
1
-
p
.In order to avoid dividing by zero, which is a case for a sparse channel at initialization stage, we introduce a small positive constant into the denominator of the last term of (19). Then, (19) can be further modified to
(20)
h
^
(
n
+
1
)
=
h
^
(
n
)
+
1
2
U
T
(
n
)
λ
LP
-
1
2
γ
LP
∥
h
^
(
n
)
∥
p
1
-
p
sgn
⁡
(
h
^
(
n
)
)
|
h
^
(
n
)
|
1
-
p
+
ε
p
.By multiplying both sides of (20) by U
(
n
), we obtain
(21)
U
(
n
)
h
^
(
n
+
1
)
=
U
(
n
)
h
^
(
n
)
+
1
2
U
(
n
)
U
T
(
n
)
λ
LP
-
1
2
γ
LP
U
(
n
)
∥
h
^
(
n
)
∥
p
1
-
p
sgn
⁡
(
h
^
(
n
)
)
|
h
^
(
n
)
|
1
-
p
+
ε
p
.Taking (18) and (21) into consideration, we have
(22)
d
(
n
)
=
U
(
n
)
h
^
(
n
)
+
1
2
U
(
n
)
U
T
(
n
)
λ
LP
-
1
2
γ
LP
U
(
n
)
∥
h
^
(
n
)
∥
p
1
-
p
sgn
⁡
(
h
^
(
n
)
)
|
h
^
(
n
)
|
1
-
p
+
ε
p
.From the discussion of the APA, ZA-APA, and RZA-APA and consideringe
(
n
)
=
d
(
n
)
-
U
(
n
)
h
^
(
n
), we can get the Lagrange multiplier λ
LP by solving (22)
(23)
λ
LP
=
[
U
(
n
)
U
T
(
n
)
]
-
1
×
{
2
e
(
n
)
+
γ
LP
U
(
n
)
∥
h
^
(
n
)
∥
p
1
-
p
sgn
⁡
(
h
^
(
n
)
)
|
h
^
(
n
)
|
1
-
p
+
ε
p
}
.Substituting (23) into (20), we can get the update equation of the LP-APA
(24)
h
^
(
n
+
1
)
=
h
^
(
n
)
+
U
+
(
n
)
e
(
n
)
+
1
2
γ
LP
U
+
(
n
)
U
(
n
)
∥
h
^
(
n
)
∥
p
1
-
p
sgn
⁡
(
h
^
(
n
)
)
|
h
^
(
n
)
|
1
-
p
+
ε
p
-
1
2
γ
LP
∥
h
^
(
n
)
∥
p
1
-
p
sgn
⁡
(
h
^
(
n
)
)
|
h
^
(
n
)
|
1
-
p
+
ε
p
=
h
^
(
n
)
+
U
+
(
n
)
e
(
n
)
+
1
2
γ
LP
U
+
(
n
)
U
(
n
)
M
(
n
)
-
1
2
γ
LP
M
(
n
)
,
where M
(
n
)
=
(
∥
h
^
(
n
)
∥
p
1
-
p
sgn
⁡
(
h
^
(
n
)
)
)
/
(
|
h
^
(
n
)
|
1
-
p
+
ε
p
). To further balance the convergence speed and the steady-state performance of the LP-APA, a step size μ
LP is introduced into (24) which is similar to APA, ZA-APA, and RZA-APA, and hence, (24) can be modified to
(25)
h
^
(
n
+
1
)
=
h
^
(
n
)
+
μ
LP
U
+
(
n
)
e
(
n
)
+
1
2
ρ
LP
U
+
(
n
)
U
(
n
)
M
(
n
)
-
1
2
ρ
LP
M
(
n
)
,
where ρ
LP
=
μ
LP
γ
LP. It is worthwhile to note that our proposed LP-APA in (25) has two more terms than the standard APA, namely, (
1
/
2
)
ρ
LP
U
+
(
n
)
U
(
n
)
M
(
n
) and (
1
/
2
)
γ
LP
M
(
n
), which are denoted as zero attractors. Therefore, the convergence speed and steady-state performance of the LP-APA are significantly improved due to the zero attractors used in our proposed LP-APA. Moreover, the zero-attracting strengths of the zero attractors are controlled by the parameter ρ
LP. In other words, the zero attractors in our proposed LP-APA exert the l
p-norm-penalty mainly on the inactive taps and hence the convergence speed of these zero taps is significantly increased. In addition, we found that the computational complexity is a little higher than those of the RZA-APA and ZA-APA, which comes from the gradient calculation of the l
p-norm. However, our proposed LP-APA outperforms the RZA-APA, ZA-APA, and APA in terms of the convergence speed and the steady-state performance.


## 4. Results and Discussions

In this section, we use the computer simulation to investigate the channel estimation performance of our proposed LP-APA over a sparse multipath communication system. The simulation results are compared with those of the previously proposed sparsity-aware algorithms including ZA-APA and RZA-APA as well as the standard APA and NLMS algorithms. Here, we consider a sparse channelh whose length N is 32 and whose number of dominant active taps K is set to two different sparsity levels, namely, K
=
1 and 4, similarly to past studies in [13, 17–19]. In all the simulations, the dominant active channel taps are obtained from a Gaussian distribution which is subjected to ∥
h
∥
2
2
=
1, and the positions of these dominant active channel taps are randomly distributed within the length of the channel. The input signal x
(
n
) used in this paper is a Gaussian random signal while the v
(
n
) is an additive zero-mean Gaussian noise with variance δ
v
2, which is independent with the input signal x
(
n
). An example of a typical sparse multipath channel with a channel length of N
=
32 and a sparsity level of K
=
3 is described in Figure 2. In all the simulations, the power of the received signal is E
b
=
1, and hence, the signal-to-noise ratio (SNR) can be defined as SNR = 10
log
⁡
(
E
b
/
δ
v
2
). The difference between the actual and estimated channels based on these sparse adaptive channel estimation algorithms and the sparse channel discussed above is evaluated by using mean square error (MSE) which is defined as follows:
(26)
MSE
(
n
)
=
10
log
⁡
10
E
{
∥
h
-
h
^
(
n
)
∥
2
2
}
(
dB
)
.Figure 2
Typical sparse multipath channel.In this paper, the following parameters are used to obtain the channel estimation performance:μ
NLMS
=
0.73, μ
APA
=
μ
ZA
=
μ
RZA
=
μ
LP
=
0.5, γ
ZA
=
γ
RZA
=
5
×
1
0
-
4, ε
RZA
=
10, p
=
0.5, ρ
LP
=
4
×
1
0
-
5, and ε
p
=
0.05. Here, μ
NLMS is the step size of the NLMS algorithm. In the investigation of the effects on the parameters, we change one of these parameters, while other parameters are invariable.


### 4.1. Effects of Parameters on the Proposed LP-APA

In the proposed LP-APA, two more parameters,p and ρ
LP, are introduced to design the zero attractors compared with the conventional APA. Furthermore, we also investigate the effects on the performance of the LP-APA with different affine projection order Q. Next, we show how these three parameters affect the proposed LP-APA over a sparse channel with channel length N
=
32 and the sparsity level K
=
4. The computer simulation results for different value of p, ρ
LP, and Q are presented and shown in Figures 3, 4, and 5, respectively.Figure 3
Effects ofp on the proposed LP-APA.Figure 4
Effects ofρ
LP on the proposed LP-APA.Figure 5
Effects of affine projection orderQ on the proposed LP-APA.We can see from Figure3 that the steady-state error of the proposed LP-APA is reduced with an increase of p ranging from 0.4 to 0.5. When p
=
0.6, the LP-APA can achieve the same steady-state error as that of p
=
0.5. However, the steady-state performance is becoming worse for p
=
0.8 and 1. In fact, when p
=
1, the proposed LP-APA is the ZA-APA. In addition, we obverse that the LP-APA can achieve the same convergence speed at the early iteration stage; after that, the convergence speed of the LP-APA slows down with increasing of p.Now, we turn to discuss the effects of theρ
LP on the proposed LP-APA. We can see from Figure 4 that the steady-state performance of our proposed LP-APA is improved with a decrease of ρ
LP when ρ
LP is greater than 4
×
1
0
-
5. When ρ
LP continues to decrease, the steady-state error increases again. This is because a small ρ
LP results in a weak zero attracting strength, which consequently reduces the convergence speed and degrades the steady-state performance. According to the discussions of those effects on parameters p and ρ
LP, it is observed that a small p can speed up the convergence and reduce the steady-state error of the LP-APA for 0.5
<
p
<
1. The effect of parameter ρ
LP shown in Figure 4 is similar to the parameter α in ZA-APA [20]. Thus, we can fix the parameter ρ
LP on the basis of investigation of the ZA-APA and select a small p to obtain better performance.Then, we show the channel estimation performance of the LP-APA with different value ofQ. The simulation results are shown in Figure 5. It is found that the convergence speed is significantly improved with the increasing of the parameter Q for the proposed LP-APA and the ZA-APA, while the steady-state errors for both the LP-APA and ZA-APA are increased. This is due to the reuse data scheme in the APAs, which can accelerate their convergence speed. Furthermore, we found that the LP-APA can achieve faster convergence speed than the APA and NLMS algorithms with the same steady-state error floor when Q
=
8. Thus, we can draw a conclusion from the discussions alluded to above that we should carefully select the parameters p, ρ
LP, and Q to balance the convergence speed and steady-state performance for the proposed LP-APA.


### 4.2. Effects of Sparsity LevelK on the Proposed LP-APA

In view of the results discussed above for our proposed LP-APA, we choosep
=
0.5, ρ
LP
=
4
×
1
0
-
5, and Q
=
2 to evaluate the channel estimation performance of the LP-APA over a sparse channel with channel length of N
=
32 and K
=
1 and 4 for which the obtained simulation results are given in Figure 6 at 30 dB. We can see from Figure 6(a) that our proposed LP-APA can achieve the fastest convergence speed and lowest steady-state error when K
=
1 in comparison with the previously proposed ZA-APA, RZA-APA, and the conventional APA and NLMS algorithms. When K
=
4, we can see from Figure 6(b) that our proposed LP-APA still has the highest convergence speed. However, our proposed LP-APA achieves nearly the same steady-state error floor as that of RZA-APA. This is owing to that these sparsity-aware algorithms attract the inactive taps to zero quickly when K
=
1, and hence their convergence speeds are improved so much, while their convergence speed reduced because of the reduction of the zero taps when K
=
4. With the reduction of the sparsity of the sparse channel, the steady-state error floors are deteriorated and the convergence speeds are reduced for all the sparse-aware APAs. Moreover, our proposed LP-APA still has fastest convergence speed from K
=
1 to K
=
4. Thus, we can summarize this discussion by saying that the convergence speed and the steady-state performance of the LP-APA can be improved for sparse channel estimation applications by proper selection of its parameters.Performance of sparse channel estimation with different sparsity levels.
(a)
K
=
1
(b)
K
=
4


## 4.1. Effects of Parameters on the Proposed LP-APA

In the proposed LP-APA, two more parameters,p and ρ
LP, are introduced to design the zero attractors compared with the conventional APA. Furthermore, we also investigate the effects on the performance of the LP-APA with different affine projection order Q. Next, we show how these three parameters affect the proposed LP-APA over a sparse channel with channel length N
=
32 and the sparsity level K
=
4. The computer simulation results for different value of p, ρ
LP, and Q are presented and shown in Figures 3, 4, and 5, respectively.Figure 3
Effects ofp on the proposed LP-APA.Figure 4
Effects ofρ
LP on the proposed LP-APA.Figure 5
Effects of affine projection orderQ on the proposed LP-APA.We can see from Figure3 that the steady-state error of the proposed LP-APA is reduced with an increase of p ranging from 0.4 to 0.5. When p
=
0.6, the LP-APA can achieve the same steady-state error as that of p
=
0.5. However, the steady-state performance is becoming worse for p
=
0.8 and 1. In fact, when p
=
1, the proposed LP-APA is the ZA-APA. In addition, we obverse that the LP-APA can achieve the same convergence speed at the early iteration stage; after that, the convergence speed of the LP-APA slows down with increasing of p.Now, we turn to discuss the effects of theρ
LP on the proposed LP-APA. We can see from Figure 4 that the steady-state performance of our proposed LP-APA is improved with a decrease of ρ
LP when ρ
LP is greater than 4
×
1
0
-
5. When ρ
LP continues to decrease, the steady-state error increases again. This is because a small ρ
LP results in a weak zero attracting strength, which consequently reduces the convergence speed and degrades the steady-state performance. According to the discussions of those effects on parameters p and ρ
LP, it is observed that a small p can speed up the convergence and reduce the steady-state error of the LP-APA for 0.5
<
p
<
1. The effect of parameter ρ
LP shown in Figure 4 is similar to the parameter α in ZA-APA [20]. Thus, we can fix the parameter ρ
LP on the basis of investigation of the ZA-APA and select a small p to obtain better performance.Then, we show the channel estimation performance of the LP-APA with different value ofQ. The simulation results are shown in Figure 5. It is found that the convergence speed is significantly improved with the increasing of the parameter Q for the proposed LP-APA and the ZA-APA, while the steady-state errors for both the LP-APA and ZA-APA are increased. This is due to the reuse data scheme in the APAs, which can accelerate their convergence speed. Furthermore, we found that the LP-APA can achieve faster convergence speed than the APA and NLMS algorithms with the same steady-state error floor when Q
=
8. Thus, we can draw a conclusion from the discussions alluded to above that we should carefully select the parameters p, ρ
LP, and Q to balance the convergence speed and steady-state performance for the proposed LP-APA.


## 4.2. Effects of Sparsity LevelK on the Proposed LP-APA

In view of the results discussed above for our proposed LP-APA, we choosep
=
0.5, ρ
LP
=
4
×
1
0
-
5, and Q
=
2 to evaluate the channel estimation performance of the LP-APA over a sparse channel with channel length of N
=
32 and K
=
1 and 4 for which the obtained simulation results are given in Figure 6 at 30 dB. We can see from Figure 6(a) that our proposed LP-APA can achieve the fastest convergence speed and lowest steady-state error when K
=
1 in comparison with the previously proposed ZA-APA, RZA-APA, and the conventional APA and NLMS algorithms. When K
=
4, we can see from Figure 6(b) that our proposed LP-APA still has the highest convergence speed. However, our proposed LP-APA achieves nearly the same steady-state error floor as that of RZA-APA. This is owing to that these sparsity-aware algorithms attract the inactive taps to zero quickly when K
=
1, and hence their convergence speeds are improved so much, while their convergence speed reduced because of the reduction of the zero taps when K
=
4. With the reduction of the sparsity of the sparse channel, the steady-state error floors are deteriorated and the convergence speeds are reduced for all the sparse-aware APAs. Moreover, our proposed LP-APA still has fastest convergence speed from K
=
1 to K
=
4. Thus, we can summarize this discussion by saying that the convergence speed and the steady-state performance of the LP-APA can be improved for sparse channel estimation applications by proper selection of its parameters.Performance of sparse channel estimation with different sparsity levels.
(a)
K
=
1
(b)
K
=
4


## 5. Conclusion

In this paper, we proposed an LP-APA to exploit the sparsity of the broadband multipath channel and to speed up the convergence of the standard APA. The LP-APA was realized by incorporating anl
p-norm into the cost function of the conventional APA, resulting in a zero attractor in its iterations, which attracted the inactive taps to zero quickly and hence accelerated the convergence speed of the APA. The simulation results showed that our proposed LP-APA with acceptable computational complexity increased the convergence speed and reduced the steady-state error of the APA as well as the ZA-APA and RZA-APA for sparse channel estimation.



---

*Source: 434659-2014-07-06.xml*