Low Complexity Blind Equalization for OFDM Systems with General Constellations
This paper proposes a low-complexity algorithm for blind equalization of data in OFDM-based wireless systems with general constellation. The proposed algorithm is able to recover data even when the channel changes on a symbol-by-symbol basis, making it suitable for fast fading channels. The proposed algorithm does not require any statistical information of the channel and thus does not suffer from latency normally associated with blind methods. The authors also demonstrate how to reduce the complexity of the algorithm, which becomes especially low at high SNR. Specifically, they show that in the high SNR regime, the number of operations is of the order O (LN), where L is the cyclic prefix length and N is the total number of subcarriers.