Low-complexity blind equalization for OFDM systems with general constellations

Tareq Y. Al-Naffouri; Ala A. Dahman; Muhammad S. Sohail; Weiyu Xu; Babak Hassibi

doi:10.1109/TSP.2012.2218808

Low-complexity blind equalization for OFDM systems with general constellations

Tareq Y. Al-Naffouri^*, Ala A. Dahman, Muhammad S. Sohail, Weiyu Xu, Babak Hassibi

^*Corresponding author for this work

King Fahd University of Petroleum & Minerals

Research output: Contribution to journal › Article › peer-review

21 Scopus citations

Abstract

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.

Original language	English
Article number	6302202
Pages (from-to)	6395-6407
Number of pages	13
Journal	IEEE Transactions on Signal Processing
Volume	60
Issue number	12
DOIs	https://doi.org/10.1109/TSP.2012.2218808
State	Published - 2012

Bibliographical note

Funding Information:
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.

Keywords

Channel estimation
OFDM and recursive least squares
maximum a posteriori detection
maximum-likelihood detection

ASJC Scopus subject areas

Signal Processing
Electrical and Electronic Engineering

Access to Document

10.1109/TSP.2012.2218808

Cite this

@article{24c8b5a0d16d41bb9cfa11334a3d1abd,

title = "Low-complexity blind equalization for OFDM systems with general constellations",

abstract = "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.",

keywords = "Channel estimation, OFDM and recursive least squares, maximum a posteriori detection, maximum-likelihood detection",

author = "Al-Naffouri, \{Tareq Y.\} and Dahman, \{Ala A.\} and Sohail, \{Muhammad S.\} and Weiyu Xu and Babak Hassibi",

note = "Funding Information: 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.",

year = "2012",

doi = "10.1109/TSP.2012.2218808",

language = "English",

volume = "60",

pages = "6395--6407",

journal = "IEEE Transactions on Signal Processing",

issn = "1053-587X",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "12",

}

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 S.

AU - Xu, Weiyu

AU - Hassibi, Babak

N1 - Funding Information: 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

Y1 - 2012

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.

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.

KW - Channel estimation

KW - OFDM and recursive least squares

KW - maximum a posteriori detection

KW - maximum-likelihood detection

UR - https://www.scopus.com/pages/publications/84870561969

U2 - 10.1109/TSP.2012.2218808

DO - 10.1109/TSP.2012.2218808

M3 - Article

AN - SCOPUS:84870561969

SN - 1053-587X

VL - 60

SP - 6395

EP - 6407

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

IS - 12

M1 - 6302202

ER -

Low-complexity blind equalization for OFDM systems with general constellations

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this