Low-Complexity MAP-Based Successive Data Detection for Coded OFDM Systems Over Highly Mobile Wireless Channels
This paper is concerned with the challenging and timely problem of data detection for coded orthogonal frequency-division multiplexing (OFDM) systems in the presence of frequency-selective and very rapidly time varying channels. New low-complexity maximum a posteriori probability (MAP) data detectio...
Saved in:
| Published in: | IEEE transactions on vehicular technology Vol. 60; no. 6; pp. 2849 - 2857 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York, NY
IEEE
01.07.2011
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subjects: | |
| ISSN: | 0018-9545, 1939-9359 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This paper is concerned with the challenging and timely problem of data detection for coded orthogonal frequency-division multiplexing (OFDM) systems in the presence of frequency-selective and very rapidly time varying channels. New low-complexity maximum a posteriori probability (MAP) data detection algorithms are proposed based on sequential detection with optimal ordering (SDOO) and sequential detection with successive cancellation (SDSC). The received signal vector is optimally decomposed into reduced dimensional subobservations by exploiting the banded structure of the frequency-domain channel matrix whose bandwidth is a parameter to be adjusted according to the speed of the mobile terminal. The data symbols are then detected by the proposed algorithms in a computationally efficient way by means of the Markov chain Monte Carlo (MCMC) technique with Gibbs sampling. The impact of the imperfect channel state information (CSI) on the bit error rate (BER) performance of these algorithms is investigated analytically and by computer simulations. A detailed computational complexity investigation and simulation results indicate that, particularly, the algorithm based on SDSC has significant performance and complexity advantages and is very robust against channel estimation errors compared with existing suboptimal detection and equalization algorithms proposed earlier in the literature. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
| ISSN: | 0018-9545 1939-9359 |
| DOI: | 10.1109/TVT.2011.2158564 |