A Low Complexity Iterative Channel Estimation and Decoding Receiver Based on Reed-Solomon PTA

Abstract

A low-complexity iterative channel estimation and Reed-Solomon (RS) decoding receiver is developed. The joint channel estimation and decoding receiver is based on the linear minimum mean square error (LMMSE) channel estimation technique and the recently proposed RS parity-check transformation algorithm (PTA). A key feature of this joint receiver is the simple symbol remapping process used to refine the initial LMMSE estimate of the channel after each iterative RS-PTA decoding. The performance of the joint iterative receiver is compiled through computer simulation assuming a rectangular M-ary quadrature amplitude modulation as the underlying modulation scheme. Simulation results show significant symbol error rate (SER) improvement in the iterative receiver in comparison with the receiver without iterative feedback. Besides, the RS-PTA iterative receiver outperforms the recently proposed RS Koetter and Vardy (RS-KV) iterative receiver structure both in terms of the SER performance and the computational time complexity. Of particular interest, results verify that the computational time complexity of the RS-PTA iterative receiver can be reduced without compromising the SER performance of the receiver.

Keywords

• Channel estimation
• CSI
• fading channels
• iterative receivers
• LMMSE
• RS-KV%22%2C%22default_operator%22%3A%22AND%22%7D%7D%7D"> <italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">RS</italic>-KV