Low-Complexity Blind Equalization for OFDM Systems With General Constellations

From MaRDI portal
Publication:4574191

DOI10.1109/TSP.2012.2218808zbMATH Open1393.94780arXiv1207.2546OpenAlexW1987314044MaRDI QIDQ4574191FDOQ4574191


Authors: Tareq Y. Al-Naffouri, Ala A. Dahman, M. S. Sohail, Weiyu Xu, B. Hassibi Edit this on Wikidata


Publication date: 18 July 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1207.2546




Recommendations




Cited In (1)





This page was built for publication: Low-Complexity Blind Equalization for OFDM Systems With General Constellations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4574191)