WA N et al.: SEMIBLIND SPARSE CHANNEL ESTIMATION FOR MIMO-OFDM SYSTEMS 2571
spatiotemporally uncorrelated noise with zero mean and vari-
ance σ
2
v
. The aforementioned channel and signal models will be
used in the next section to develop a semiblind sparse channel
estimation algorithm.
B. Linear-Prediction-Based Semiblind MIMO-OFDM
Channel Estimation
We now briefly review our previous work on the linear-
prediction-based semiblind MIMO-OFDM channel estimation
[19]. The key is to employ the second-order statistics-based
MIMO linear prediction method to obtain a blind constraint on
the channel vector, i.e.,
h
Δ
=
h
T
1
,...,h
T
N
R
T
where h
i
R
Δ
=[h
i
R
,1
(0),...,h
i
R
,1
(L−1),...,h
i
R
,N
T
(L−1)]
T
.
By defining
y(n)
Δ
=[y
1
(n),...,y
N
R
(n)]
T
(3)
y
P
(n − 1)
Δ
=
y
T
(n − 1),...,y
T
(n − P )
T
(4)
we have the autocorrelation matrix of y
P
(n − 1) and the cross-
correlation matrix of y
P
(n − 1) and y(n) as
˜
R
n−1
Δ
=E
y
P
(n − 1)y
H
P
(n − 1)
(5)
¨
R
n
Δ
=E
y(n)y
H
P
(n − 1)
. (6)
Then, the MIMO linear predictor can be written as [19], [32]
P
P
Δ
=[P
P
(1), P
P
(2),...,P
P
(P )] =
¨
R
n
˜
R
−1
n−1
(7)
where P is the length of linear predictor, and P
P
(n), n =
1,...,P,isanN
R
× N
R
matrix that represents the nth tap of
the prediction filter. In the aforementioned equations, the index
m has been omitted for notational convenience. By using the
properties of the MIMO linear predictor, a blind constraint for
the channel vector h can be derived as [19]
B =(I ⊗ P
Σ
)E
P
(8)
where E
P
is a known permutation matrix, and P
Σ
is a matrix
that is determined by a block Toeplitz matrix that consists of
P
P
(n), n =1,...,P, and the null subspace of H(0), which
can be estimated from the covariance matrix of the prediction
error δ
2
˜
y,P
= R(0) − P
P
¨
R
H
n
.
By combining the blind constraint with a training-based
LS criterion, a semiblind channel estimation problem can be
formulated as
min
ˆ
h
Δ=Y
pilot
−
˜
A
ˆ
h
2
F
+ α
ˆ
B
ˆ
h
2
F
(9)
where
˜
A is a pilot signal matrix that can be constructed as
shown in [30, Sec. IV], Y
pilot
is the corresponding received
signal vector,
ˆ
B is an estimate of the blind constraint, and α>0
is a weighting factor. The solution to this optimization problem
is given by
ˆ
h =(
˜
A
H
˜
A + α
ˆ
B
H
ˆ
B)
†
˜
A
H
Y
pilot
(10)
where the value of α can be determined using the scheme
proposed in [19]. In the aforementioned semiblind approach
and in several existing MIMO-OFDM channel estimation meth-
ods, e.g., the techniques proposed in [2], [3], [5], [8], [9],
and [20], the sparse case of the wireless channel has not
been considered. Thus, the semiblind solution obtained is not
efficient when the channel is sparse. In the next section, we will
propose a new semiblind algorithm for the estimation of sparse
channels that contain only a small number of significant or non-
zero taps.
III. P
ROPOSED SEMIBLIND SPARSE CHANNEL
ESTIMATION ALGORITHM
A. Second-Order Statistics of the Signal Received Through
Sparse MIMO
It is known that a wireless channel can very often be modeled
as a sparse channel that contains several zero taps in the uniform
delay line [21]–[29]. In this paper, we consider point-to-point
MIMO systems, in which the transmit and receive antennas are
colocated. In this case, the propagation delay is roughly the
same for all transmit–receive antenna pairs [33], [34], which
has been considered in the generations of multipath MIMO
channels in practical channel models, e.g., the spatial channel
model (SCM) [35]. Because the delay in the FIR channel is
uniquely determined by the propagation delay of the multi-
paths, when the channel is sparse, the MSTs of the channel
should happen at the same positions for all transmit–receive
antenna pairs [33]. Therefore, the MIMO channel matrix with
respect to the dth (d =0, 1,...,D− 1) MST can be ex-
pressed as
Z(d)=H(l
d
) (11)
where l
d
(d =0, 1,...,D− 1) are integers, with 0=l
0
<
l
1
< ···<l
D−1
, and H(l
d
) is, in general, considered Rayleigh
distributed. To distinguish from H(l), Z(d) is referred to as the
effective channel matrix throughout this paper.
The correlation matrix of the received signal vector y(n) can
be, in general, defined as
R(l)
Δ
=E
y(n)y
H
(n − l)
, (l =0, 1,...,P). (12)
Obviously, (12) includes the autocorrelation matrix of y(n) as a
special case when l =0. It has been proved in [30] that, for the
noise-free case, R(l) can be expressed in terms of the effective
sparse channel matrix Z(d), d =0, 1,...,D− 1. Using (2),
(3), and (11) in (12), we obtain
R(l)=Z
A
R
x,D
(l)Z
H
A
(13)
where
Z
A
Δ
=[Z(0) Z(1) ··· Z(D−1) ] (14)
R
x,D
(l)
Δ
=E
⎧
⎪
⎪
⎪
⎨
⎪
⎪
⎪
⎩
⎡
⎢
⎢
⎣
x(n)
x(n−l
1
)
.
.
.
x(n−l
D−1
)
⎤
⎥
⎥
⎦
⎡
⎢
⎢
⎣
x(n−l)
x(n−l
1
−l)
.
.
.
x(n−l
D−1
−l)
⎤
⎥
⎥
⎦
H
⎫
⎪
⎪
⎪
⎬
⎪
⎪
⎪
⎭
(15)