TY - JOUR
T1 - Low-complexity blind equalization for OFDM systems with general constellations
AU - Al-Naffouri, Tareq Y.
AU - Dahman, Ala A.
AU - Sohail, Muhammad Sadiq
AU - Xu, Weiyu
AU - Hassibi, Babak
N1 - KAUST 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.
PY - 2012/12
Y1 - 2012/12
N2 - 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.
AB - 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.
UR - http://hdl.handle.net/10754/562447
UR - http://arxiv.org/abs/arXiv:1207.2546v1
UR - http://www.scopus.com/inward/record.url?scp=84870561969&partnerID=8YFLogxK
U2 - 10.1109/TSP.2012.2218808
DO - 10.1109/TSP.2012.2218808
M3 - Article
SN - 1053-587X
VL - 60
SP - 6395
EP - 6407
JO - IEEE Transactions on Signal Processing
JF - IEEE Transactions on Signal Processing
IS - 12
ER -