EM-Based Channel Estimation Algorithms for OFDM
| العنوان: | EM-Based Channel Estimation Algorithms for OFDM |
|---|---|
| المؤلفون: | Stuart C. Schwartz, Hisashi Kobayashi, Xiaoqiang Ma |
| المصدر: | EURASIP Journal on Advances in Signal Processing, Vol 2004, Iss 10, Pp 1460-1477 (2004) EURASIP Journal on Advances in Signal Processing, Vol 2004, Iss 10, p 106272 (2004) |
| بيانات النشر: | SpringerOpen, 2004. |
| سنة النشر: | 2004 |
| مصطلحات موضوعية: | Mean squared error, Computer science, Orthogonal frequency-division multiplexing, EM-algorithm, lcsh:TK7800-8360, Data_CODINGANDINFORMATIONTHEORY, lcsh:Telecommunication, Channel capacity, symbols.namesake, Cramer-Rao lower bound, lcsh:TK5101-6720, Electrical and Electronic Engineering, Rayleigh fading, Computer Science::Information Theory, OFDM, lcsh:Electronics, channel estimation, Additive white Gaussian noise, Hardware and Architecture, Signal Processing, Bit error rate, symbols, Algorithm, Multipath propagation, Communication channel |
| الوصف: | Estimating a channel that is subject to frequency-selective Rayleigh fading is a challenging problem in an orthogonal frequency division multiplexing (OFDM) system. We propose three EM-based algorithms to efficiently estimate the channel impulse response (CIR) or channel frequency response of such a system operating on a channel with multipath fading and additive white Gaussian noise (AWGN). These algorithms are capable of improving the channel estimate by making use of a modest number of pilot tones or using the channel estimate of the previous frame to obtain the initial estimate for the iterative procedure. Simulation results show that the bit error rate (BER) as well as the mean square error (MSE) of the channel can be significantly reduced by these algorithms. We present simulation results to compare these algorithms on the basis of their performance and rate of convergence. We also derive Cramer-Rao-like lower bounds for the unbiased channel estimate, which can be achieved via these EM-based algorithms. It is shown that the convergence rate of two of the algorithms is independent of the length of the multipath spread. One of them also converges most rapidly and has the smallest overall computational burden. |
| اللغة: | English |
| تدمد: | 1687-6180 1687-6172 |
| URL الوصول: | https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ca928dbfd374784270bd79952a688dd0 https://doaj.org/article/af6133c5a92849cab57d1e85bc41120b |
| حقوق: | OPEN |
| رقم الأكسشن: | edsair.doi.dedup.....ca928dbfd374784270bd79952a688dd0 |
| قاعدة البيانات: | OpenAIRE |
Find this article in full text from Springer Verlag. | تدمد: | 16876180 16876172 |
|---|