This paper proposes a low-complexity algorithm for blind equalization of data in orthogonal frequency division multiplexing (OFDM)-based wireless systems with general constellations. The proposed algorithm is able to recover the transmitted 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 about the channel and thus does not suffer from latency normally associated with blind methods. The paper demonstrates how to reduce the complexity of the algorithm, which becomes especially low at high signal-to-noise ratio (SNR). Specifically, it is shown 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 the proposed algorithm. © 2012 IEEE.
|Original language||English (US)|
|Number of pages||13|
|Journal||IEEE Transactions on Signal Processing|
|State||Published - Dec 2012|
Bibliographical noteKAUST Repository Item: Exported on 2020-10-01
Acknowledgements: Manuscript received March 05, 2012; revised July 09, 2012; accepted August 28, 2012. Date of publication September 13, 2012; date of current version November 20, 2012. The associate editor coordinating the review of this manuscript and approving it for publication was Dr. Tong Zhang. This work was supported by a grant from the Deanship of Scientific Research (DSR) at King Fahd University of Petroleum & Minerals (KFUPM) under project No. FT111004.
ASJC Scopus subject areas
- Signal Processing
- Electrical and Electronic Engineering