Efficient blind detection for OFDM systems in selective fading channels

Ming-Xian Chang, Jen Hsien Chen

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

With blind detection, one can enhance the throughput of communications. However, not all blind algorithms can be applied in time-varying or frequency-selective fading channels. Furthermore, blind algorithms usually have higher complexity. In this paper, we first propose a general principle by which one can build a metric for blind detection from any pilot-assisted channel response (CR) estimation algorithm. By this principle and based on the least-squares-fitting (LSF) pilot-assisted CR estimation, we derive a metric for blind detection and propose an efficient blind data detection algorithm. The proposed algorithm is operated on a block of received symbols that are along subchannels or along time slots; therefore, the proposed blind detection can be applied in frequency-selective or time-varying fading channels. With the proposed tree search method, the proposed algorithm attains the same error performance as a previous blind detection algorithm based on the same metric, although the complexity is greatly reduced. We further apply the channel prediction to obtain a better initial block in the tree search, such that the complexity can be further reduced. A range-reduced scheme is also proposed to give a tradeoff between performance and complexity. In the fast time-varying channel, we can combine the proposed blind detection with an intersubchannel interference (ICI) self-reduction algorithm.

Original languageEnglish
Article number6847742
Pages (from-to)1779-1792
Number of pages14
JournalIEEE Transactions on Vehicular Technology
Volume64
Issue number5
DOIs
Publication statusPublished - 2015 May 1

Fingerprint

Fading Channels
Orthogonal Frequency Division multiplexing (OFDM)
Fading channels
Orthogonal frequency division multiplexing
Metric
Time-varying
Time-varying Channels
Least Square Fitting
Search Trees
Frequency selective fading
Estimation Algorithms
Search Methods
Throughput
Trade-offs
Interference
Prediction
Communication
Range of data

All Science Journal Classification (ASJC) codes

  • Automotive Engineering
  • Aerospace Engineering
  • Computer Networks and Communications
  • Applied Mathematics
  • Electrical and Electronic Engineering

Cite this

@article{ce2bac5e0d454e3984c49c15842f26d5,
title = "Efficient blind detection for OFDM systems in selective fading channels",
abstract = "With blind detection, one can enhance the throughput of communications. However, not all blind algorithms can be applied in time-varying or frequency-selective fading channels. Furthermore, blind algorithms usually have higher complexity. In this paper, we first propose a general principle by which one can build a metric for blind detection from any pilot-assisted channel response (CR) estimation algorithm. By this principle and based on the least-squares-fitting (LSF) pilot-assisted CR estimation, we derive a metric for blind detection and propose an efficient blind data detection algorithm. The proposed algorithm is operated on a block of received symbols that are along subchannels or along time slots; therefore, the proposed blind detection can be applied in frequency-selective or time-varying fading channels. With the proposed tree search method, the proposed algorithm attains the same error performance as a previous blind detection algorithm based on the same metric, although the complexity is greatly reduced. We further apply the channel prediction to obtain a better initial block in the tree search, such that the complexity can be further reduced. A range-reduced scheme is also proposed to give a tradeoff between performance and complexity. In the fast time-varying channel, we can combine the proposed blind detection with an intersubchannel interference (ICI) self-reduction algorithm.",
author = "Ming-Xian Chang and Chen, {Jen Hsien}",
year = "2015",
month = "5",
day = "1",
doi = "10.1109/TVT.2014.2334634",
language = "English",
volume = "64",
pages = "1779--1792",
journal = "IEEE Transactions on Vehicular Technology",
issn = "0018-9545",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

Efficient blind detection for OFDM systems in selective fading channels. / Chang, Ming-Xian; Chen, Jen Hsien.

In: IEEE Transactions on Vehicular Technology, Vol. 64, No. 5, 6847742, 01.05.2015, p. 1779-1792.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Efficient blind detection for OFDM systems in selective fading channels

AU - Chang, Ming-Xian

AU - Chen, Jen Hsien

PY - 2015/5/1

Y1 - 2015/5/1

N2 - With blind detection, one can enhance the throughput of communications. However, not all blind algorithms can be applied in time-varying or frequency-selective fading channels. Furthermore, blind algorithms usually have higher complexity. In this paper, we first propose a general principle by which one can build a metric for blind detection from any pilot-assisted channel response (CR) estimation algorithm. By this principle and based on the least-squares-fitting (LSF) pilot-assisted CR estimation, we derive a metric for blind detection and propose an efficient blind data detection algorithm. The proposed algorithm is operated on a block of received symbols that are along subchannels or along time slots; therefore, the proposed blind detection can be applied in frequency-selective or time-varying fading channels. With the proposed tree search method, the proposed algorithm attains the same error performance as a previous blind detection algorithm based on the same metric, although the complexity is greatly reduced. We further apply the channel prediction to obtain a better initial block in the tree search, such that the complexity can be further reduced. A range-reduced scheme is also proposed to give a tradeoff between performance and complexity. In the fast time-varying channel, we can combine the proposed blind detection with an intersubchannel interference (ICI) self-reduction algorithm.

AB - With blind detection, one can enhance the throughput of communications. However, not all blind algorithms can be applied in time-varying or frequency-selective fading channels. Furthermore, blind algorithms usually have higher complexity. In this paper, we first propose a general principle by which one can build a metric for blind detection from any pilot-assisted channel response (CR) estimation algorithm. By this principle and based on the least-squares-fitting (LSF) pilot-assisted CR estimation, we derive a metric for blind detection and propose an efficient blind data detection algorithm. The proposed algorithm is operated on a block of received symbols that are along subchannels or along time slots; therefore, the proposed blind detection can be applied in frequency-selective or time-varying fading channels. With the proposed tree search method, the proposed algorithm attains the same error performance as a previous blind detection algorithm based on the same metric, although the complexity is greatly reduced. We further apply the channel prediction to obtain a better initial block in the tree search, such that the complexity can be further reduced. A range-reduced scheme is also proposed to give a tradeoff between performance and complexity. In the fast time-varying channel, we can combine the proposed blind detection with an intersubchannel interference (ICI) self-reduction algorithm.

UR - http://www.scopus.com/inward/record.url?scp=84929310434&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84929310434&partnerID=8YFLogxK

U2 - 10.1109/TVT.2014.2334634

DO - 10.1109/TVT.2014.2334634

M3 - Article

AN - SCOPUS:84929310434

VL - 64

SP - 1779

EP - 1792

JO - IEEE Transactions on Vehicular Technology

JF - IEEE Transactions on Vehicular Technology

SN - 0018-9545

IS - 5

M1 - 6847742

ER -