Professional Documents
Culture Documents
Abstract—This paper deals with the estimation of the channel squared error estimator (MMSEE) is proposed, making use
impulse response (CIR) in orthogonal frequency division multi- of singular value decomposition techniques. The drawback of
plexed (OFDM) systems. In particular, we focus on two pilot-aided this approximation is that it requires knowledge of the channel
schemes: the maximum likelihood estimator (MLE) and the
Bayesian minimum mean square error estimator (MMSEE). The frequency correlation and the operating SNR. In practice, the
advantage of the former is that it is simpler to implement as it system can be designed for fixed values of SNR and channel
needs no information on the channel statistics. On the other hand, correlation at the expense of performance losses. The MMSEE
the MMSEE is expected to have better performance as it exploits studied in [8] exploits channel correlations in time and fre-
prior information about the channel. quency domains. Like the scheme in [7], it needs knowledge
Theoretical analysis and computer simulations are used in the
comparisons. At SNR values of practical interest, the two schemes of the channel statistics and the operating SNR. Although it
are found to exhibit nearly equal performance, provided that the can work in a mismatched mode, its performance degrades if
number of pilot tones is sufficiently greater than the CIRs length. the assumed Doppler frequencies and delay spreads are smaller
Otherwise, the MMSEE is superior. In any case, the MMSEE is than the true ones. In [9], channel estimation is performed by
more complex to implement. two-dimensional interpolation between pilots. Like the method
Index Terms—Channel estimation, maximum likelihood, min- in [8], it is rather robust to Doppler, even though it exhibits
imum mean square error, OFDM. performance degradations with lower Doppler frequencies.
Finally, [10] investigates the maximum likelihood estimator
I. INTRODUCTION (MLE). No information on the channel statistics or the oper-
ating SNR is required in this scheme.
Authorized licensed use limited to: National Cheng Kung University. Downloaded on May 1, 2009 at 02:12 from IEEE Xplore. Restrictions apply.
3066 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 49, NO. 12, DECEMBER 2001
(a)
(b)
Fig. 1. (a) Block diagram of the OFDM transmitter. (b) Block diagram of the OFDM receiver.
Having established that MMSEE can do better than the The OFDM receiver is sketched in Fig. 1(b). After matched
CRLB, we wonder how much better it can do in practice and filtering, the signal is sampled at rate and serial to par-
under which operating conditions. We also wonder about the allel converted. Next, the cyclic prefix is removed, and the re-
price to pay in terms of computational complexity. ceived samples are passed to an -point discrete Fourier trans-
The purpose of this paper is to answer these questions. form (DFT) unit. As in [7], we assume that the channel varia-
The discussion is organized as follows. The next section tions are negligible over one block of data, and we indicate with
describes the signal model and introduces some basic nota- (the superscript
tions. Section III revisits MLE and MMSEE and compares indicates vector transpose) the -spaced samples of the overall
their complexity. Performance is assessed and is compared CIR. Denoting
in Section IV. Section V discusses analytical and simulation
results, and Section VI offers some conclusions.
(2)
II. SIGNAL MODEL
We consider an OFDM system employing subcarriers for the DFT of and dropping the block identifier for simplicity,
the transmission of parallel data symbols. Notice that the output of the DFT unit is found to be [12]
subcarriers (virtual carriers) at the edges of the spectrum are not
(3)
used to avoid aliasing problems at the receiver [11]. The block
diagram of the OFDM transmitter is shown in Fig. 1(a). The where int , and int means integer part of
stream of data (belonging to a PSK or QAM constellation) the enclosed quantity. In (3), the are the useful data sym-
is serial to parallel (S/P) converted and partitioned into adjacent bols, and is the channel noise, which is modeled as a
blocks of length . After insertion of zeros, white Gaussian process with zero mean and variance
the th OFDM block .
Coherent detection requires knowledge of the sampled
channel frequency response . In this study, we as-
(1) sume that some known symbols (pilots) are multiplexed
is fed to an -point inverse discrete Fourier transform (IDFT) into the data stream, and channel estimation is performed
unit that produces the -dimensional vector of time-domain by interpolation between pilots. A total of pilots
samples. In order to eliminate any interference between adja- are inserted in the OFDM block
cent OFDM symbols, an -point cyclic prefix (longer than at known locations . Denoting by
the overall channel impulse response) is appended to . The the -dimensional
resulting extended vector drives a linear modulator with impulse vector containing the DFT output at the pilot locations, from
response and signaling interval , where (2) and (3), we have
is the OFDM symbol duration. In the following, we assume
that is a root-raised-cosine function with rolloff . (4)
Authorized licensed use limited to: National Cheng Kung University. Downloaded on May 1, 2009 at 02:12 from IEEE Xplore. Restrictions apply.
MORELLI AND MENGALI: COMPARISON OF PILOT-AIDED CHANNEL ESTIMATION METHODS 3067
where is a diagonal matrix Note that (13) can be written in scalar form as
(5)
(16)
and is an matrix with entries
Hence, substituting into (12) yields
(6)
Vector has a Gaussian distribution with zero mean and covari- (17)
ance matrix
(7) with
From the invariance property of MLE [13, p. 185] and MMSEE where
[13, p. 349], it follows that if is the estimate of (either ML or
MMSE), then the corresponding estimate of can be computed (23)
as
(12)
C. Remarks
i) Equation (13) indicates that MLE requires the invert-
A. Maximum Likelihood Estimator ibility of . Such a condition is met if and only if is
The MLE is based on the assumption that is a deterministic full rank and . This means that the number of pi-
but unknown vector. The estimate of is derived from the linear lots must be not smaller than the number of channel taps.
model (8) and is given by [13, p. 186] On the other hand, from (19), we see that MMSEE re-
quires the invertibility of . For this to hold, however,
(13) need not be full rank. Thus, the MMSEE can exist even
if .
where is a square matrix
ii) If is a square matrix , from (13) and (14), it
(14) is seen that reduces to the channel estimator pro-
posed by Negi and Cioffi [10]
whose entries are computed from (6)
(24)
(15) iii) From (19), it is clear that MMSEE is linear in the ob-
served vector . This is a consequence of the Gaussian
Authorized licensed use limited to: National Cheng Kung University. Downloaded on May 1, 2009 at 02:12 from IEEE Xplore. Restrictions apply.
3068 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 49, NO. 12, DECEMBER 2001
assumption on . It follows that MMSEE coincides with or total mean square error
the maximum a posteriori (MAP) estimator [13, p. 485].
iv) Comparing (19) and (20) with (13) and (14), it is seen
(28)
that MMSEE reduces to MLE at high SNRs (i.e., when
or if no prior information on is given (i.e.,
when being the null matrix).
v) Comparing (17) and (22), it appears that MLE and A. Performance of MLE
MMSEE have the same form With the MLE, the vector is a constant, and the expectation
in (27) is taken over the thermal noise. In Appendix A, it is
(25) shown that MLE is unbiased, i.e.,
(29)
which amounts to an interpolation between the samples
. Equations (14) and (18) indicate that the coef- and the individual MSE is given by
ficients in the MLE depend only on the
pilot symbols’ locations, which are known. Hence, the (30)
can be precomputed and stored. On the
contrary, from (20) and (23), it is seen that the coeffi-
cients in the MMSEE also depend on Substituting (30) into (28) yields
the channel covariance matrix and the noise variance
. Thus, suitable schemes must be found to estimate (31)
these parameters. Furthermore, even assuming that
estimates of and are available, the computation
of still requires inverting and . In where
conclusion, the MMSEE is much more complex than
(32)
the MLE.
vi) MLE and MMSEE can be implemented in two different
ways. In Appendix A, it is also shown that (31) coincides with the
CRLB.
a) Compute from (25).
Although the MLE is derived for a deterministic , it can also
b) Compute first from (13) or (19) and then derive
be applied with a random CIR. In other words, the deterministic
as the DFT of .
assumption is made to derive the MLE, which is then used with
Procedure a) requires storing the coefficients
a random channel. In this context, it makes sense to consider the
and performing real multiplications and
average of MSE taken over the CIR realizations. However, since
real additions. In writing these figures, we
does not depend on , it is clear that individual and
have borne in mind that a complex multiplication corresponds
total errors are not affected by the averaging operation. Thus,
to four real multiplications and two real additions, whereas a
they coincide with the Bayesian mean square errors.
complex addition is equivalent to two real additions. Procedure
b) requires storing for the MLE and for the B. Performance of the MMSEE
MMSEE. Furthermore, use of the fast Fourier transform (FFT)
involves real multiplications and With the MMSEE, the expectation in (27) is taken over the
real additions. In these fig- noise and the CIR probability density function. The covariance
ures, is the pruning factor [14] and represents the computa- matrix
tional saving obtained in the FFT calculation by eliminating the (33)
operations on zeros. It turns out that is given by
can be written as [13, p. 391]
(26)
(34)
A comparison between the computational load in the two pro-
where is defined in (20). Then, substituting (12) into (27) and
cedures is tricky because many parameters are involved, and dif-
(28) and bearing in mind (34) yields the individual and total
ferent answers may be given, depending on the operating condi-
BMSE
tions. In any case, procedure a) requires more memory storage
than b) since in many practical situations.
(35)
IV. PERFORMANCE ANALYSIS
The performance of MLE and MMSEE can be expressed ei- (36)
ther in terms of individual mean square error
Authorized licensed use limited to: National Cheng Kung University. Downloaded on May 1, 2009 at 02:12 from IEEE Xplore. Restrictions apply.
MORELLI AND MENGALI: COMPARISON OF PILOT-AIDED CHANNEL ESTIMATION METHODS 3069
C. Performance Comparison
From (31) and (32) and (35) and (36), it is seen that the esti-
mation accuracy of MLE and MMSEE depends on
i) the noise variance ;
ii) the number of channel taps ;
iii) the DFT size ;
iv) the number of modulated subcarriers ;
v) the number and locations of the pilots (through );
vi) the prior channel covariance matrix (only for
MMSEE).
Given and , it would be interesting to determine
the optimal pilots’ locations that minimize the total BMSE. The
solution to this problem is given in [10] for MLE when there are
no suppressed carriers. It is found that the best performance is
achieved by resorting to uniformly spaced pilots with separation
interval , i.e.,
(37) Fig. 2. BMSE versus subcarrier index n with uniformly spced pilots.
Correspondingly, reduces to
(38)
and becomes
(39)
(40)
where is defined as
(41)
Fig. 3. BMSE versus subcarrier index n with nonuniformly spced pilots.
and is less than unity. Notice that and
are independent of the subcarrier index and coincide with the iv) Twenty eight uniformly spaced pilot tones, i.e.,
total estimation errors and . As is intuitively ex-
pected, (39) and (40) say that the estimation accuracy degrades (42)
as the number of channel taps increases and the number of pilots v) SNR dB.
decreases.
It is worth noting that (37) is not met here since the number of
Equation (37) indicates the optimal pilots’ locations when
suppressed carriers is greater than .
there are no virtual carriers. Unfortunately, such a condition is
It is seen that and are flat in the
not always met in practice. When some carriers at the edges of
middle of the signal bandwidth, but grows rapidly
the spectrum are suppressed, the only way to determine the op-
at the edges. This implies a reduced reliability of the data at
timal pilots’ locations is through exhaustive search. However,
the boundaries of the spectrum. A simple way to alleviate this
some qualitative conclusions can be drawn by inspection of
drawback is to decrease the pilots’ distance at the edges, as
Figs. 2 and 3, which show the BMSE for MLE and MMSEE
indicated in Fig. 3. In conclusion, in the presence of suppressed
as a function of the subcarrier index. Solid lines represent the-
carriers, the minimum BMSE can be achieved with nonuni-
oretical results as given by (30) and (35), whereas vertical bars
formly spaced pilots.
indicate the pilots’ locations. The operating conditions in Fig. 2
Fig. 4 shows the total BMSE versus for MLE with
are as follows.
and SNR dB. The upper curve corre-
i) The channel has an exponential power delay profile sponds to 28 pilots at the locations in (42), whereas the lower
, with . curve corresponds to 44 pilots at
ii) DFT size .
iii) Modulated subcarriers . (43)
Authorized licensed use limited to: National Cheng Kung University. Downloaded on May 1, 2009 at 02:12 from IEEE Xplore. Restrictions apply.
3070 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 49, NO. 12, DECEMBER 2001
Fig. 4. 0 versus the channel length L with N = 28, 44. Fig. 5. 0 versus the channel length L with N = 28, 44.
Authorized licensed use limited to: National Cheng Kung University. Downloaded on May 1, 2009 at 02:12 from IEEE Xplore. Restrictions apply.
MORELLI AND MENGALI: COMPARISON OF PILOT-AIDED CHANNEL ESTIMATION METHODS 3071
Fig. 7. Total BMSE versus SNR with N = 151. Fig. 8. Total BMSE versus SNR with N = 76.
B. Performance Comparisons
Performance comparisons have been made in terms of total
BMSE and symbol error rate (SER). Figs. 7 and 8 show the
total BMSE versus SNR for MLE, MMSEE, and the estimators
proposed by Rinne and Renfors (RRE) [6] and by Li (LE) [9].
The RRE makes a piecewise-linear interpolation of the type
(48)
(49)
with
(50)
Authorized licensed use limited to: National Cheng Kung University. Downloaded on May 1, 2009 at 02:12 from IEEE Xplore. Restrictions apply.
3072 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 49, NO. 12, DECEMBER 2001
(A3)
(A4)
Authorized licensed use limited to: National Cheng Kung University. Downloaded on May 1, 2009 at 02:12 from IEEE Xplore. Restrictions apply.
MORELLI AND MENGALI: COMPARISON OF PILOT-AIDED CHANNEL ESTIMATION METHODS 3073
[5] A. S. Macedo and E. S. Sousa, “Coded OFDM for broadband indoor Michele Morelli was born in Pisa, Italy, in 1965. He received the Laurea degree
wireless systems,” in Proc. Int. Commun. Conf., Montreal, QC, Canada, (cum laude) in electrical engineering and the “Premio di Laurea SIP” degree
June 1997. from the University of Pisa, in 1991 and 1992, respectively. From 1992 to 1995,
[6] J. Rinne and M. Renfors, “Pilot spacing in orthogonal frequency divi- he was with the Department of Information Engineering, University of Pisa,
sion multiplexing systems on practical channels,” IEEE Trans. Consum. where he received the Ph.D. degree in electrical engineering.
Electron., vol. 42, pp. 959–962, Nov. 1996. He is currently a Research Fellow at the Centro Studi Metodi e Dispositivi
[7] O. Edfors, M. Sandell, J. J. van de Beek, S. K. Wilson, and P. O. Bor- per Radiotrasmissioni, Italian National Research Council (CNR), Pisa. His in-
jesson, “OFDM channel estimation by singular value decomposition,” terests are in digital communication theory with emphasis on synchronization
IEEE Trans. Commun., vol. 46, pp. 931–939, July 1998. algorithms.
[8] Y. Li, L. J. Cimini Jr., and N. R. Sollenberger, “Robust channel estima-
tion for OFDM systems with rapid dispersive fading channels,” IEEE
Trans. Commun., vol. 46, pp. 902–915, July 1998.
[9] Y. Le, “Pilot-symbol-aided channel estimation for OFDM in wireless Umberto Mengali (M’69–SM’85–F’90) received his education in electrical en-
systems,” IEEE Trans. Veh. Technol., vol. 48, pp. 1207–1215, July 2000. gineering from the University of Pisa, Pisa, Italy. In 1971, he received the Libera
[10] R. Negi and J. Cioffi, “Pilot tone selection for channel estimation in a Docenza degree in telecommunications from the Italian Education Ministry.
mobile OFDM system,” IEEE Trans. Consum. Electron., vol. 44, pp. Since 1963, he has been with the Department of Information Engineering,
1122–1128, Aug. 1998. University of Pisa, where he is a Professor of Telecommunications. In 1994,
[11] J. A. Bingham, “Multicarrier modulation for data transmission: An idea he was a Visiting Professor at the University of Canterbury, Christchurch, New
whose time has come,” IEEE Commun. Mag., pp. 5–14, May 1990. Zealand, as an Erskine Fellow. His research interests are in digital communi-
[12] M. Luise, R. Reggiannini, and G. M. Vitetta, “Blind equalization/de- cations and communication theory with emphasis on synchronization methods
tection for OFDM signals over frequency-selective channels,” IEEE J. and modulation techniques. He has published approximately 80 journal papers
Select. Areas Commun., vol. 16, pp. 1568–1578, Oct. 1998. and has co-authored the book Synchronization Techniques for Digital Receivers
[13] S. M. Kay, Fundamentals of Statistical Signal Processing: Estimation (New York: Plenum, 1997).
Theory. Englewood Cliffs, NJ: Prentice-Hall, 1993. Prof. Mengali is a member of the Communication Theory Committee and
[14] J. D. Markel, “FFT pruning,” IEEE Trans. Audio Electroacoust., vol. was an associate editor of the IEEE TRANSACTIONS ON COMMUNICATIONS from
AV-19, pp. 305–311, Dec. 1971. 1985 to 1991. He is now Editor for Communication Theory of the European
[15] Digital Broadcasting Systems for Television, Sound and Data Services, Transactions on Telecommunications. He is listed in American Men and Women
Sept. 1996. in Science.
Authorized licensed use limited to: National Cheng Kung University. Downloaded on May 1, 2009 at 02:12 from IEEE Xplore. Restrictions apply.