A forward-backward Kalman for the estimation of time-variant channels in OFDM
OFDM combines the advantages of high achievable rates and relatively easy implementation. However, for proper recovery of the input, the OFDM receiver needs accurate channel information. In this paper, we propose an expectation-maximization (EM) algorithm for joint channel and data recovery. The alg...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | article |
| Published: |
2005
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/14641/1/14641_1.pdf https://eprints.kfupm.edu.sa/id/eprint/14641/2/14641_2.doc |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | OFDM combines the advantages of high achievable rates and relatively easy implementation. However, for proper recovery of the input, the OFDM receiver needs accurate channel information. In this paper, we propose an expectation-maximization (EM) algorithm for joint channel and data recovery. The algorithm makes use of the rich structure of the underlying communication problem-a structure induced by the data and channel constraints. These constraints include pilots, the cyclic prefix, and the finite alphabet constraints on the data, and sparsity, finite delay spread, and the statistical properties of the channel (frequency and time correlation). The algorithm boils down to a forward-backward (FB) Kalman filter. We also suggest a suboptimal modification that is able to track the channel and recover the data with no latency. |
|---|