Low-complexity iterative channel estimation for serially concatenated systems over frequency-nonselective Rayleigh fading channels

摘要

A low-complexity iterative maximum a posteriori (MAP) channel estimator is proposed whose complexity increases linearly with the symbol alphabet size 'M. Prediction-based MAP channel estimation is not appropriate with a high-order prediction filter or a large modulation alphabet size, since the computational complexity increases with ML , where L is the predictor order. In contrast, the proposed channel estimator has a constant number of trellis states regardless of the prediction filter order, and is shown to provide comparable error performance to the prediction-based MAP estimator