Low Complexity Blind Equalization for OFDM Systems with General Constellations

TL;DR

This paper introduces a low-complexity blind equalization algorithm for OFDM systems that effectively handles fast fading channels with general constellations without requiring channel statistics.

Contribution

The paper presents a novel blind equalization method for OFDM that operates with minimal complexity and no channel statistical information, suitable for fast-changing channels.

Findings

Algorithm achieves complexity of O(LN) at high SNR

Performs well in fast fading conditions

No need for channel statistical knowledge

Abstract

This paper proposes a low-complexity algorithm for blind equalization of data in OFDM-based wireless systems with general constellations. 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. We also demonstrate how to reduce the complexity of the algorithm, which becomes especially low at high SNR. Specifically, we 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. Simulation results confirm the favorable performance of our algorithm.