Detection of OFDM signals in fast-varying channels with low-density pilot symbols

Ming Xian Chang, Tsung Da Hsieh

Research output: Contribution to journalArticle

20 Citations (Scopus)

Abstract

In fast-varying channels, an orthogonal frequencydivision multiplexing system needs to insert denser pilot symbols among transmitted symbols in tracking the variation of a channel. However, using denser pilot symbols reduces transmission throughput. In this paper, we propose a pseudopilot algorithm for data detection in fast-varying channels without increasing the pilot density. Our algorithm is based on a regressional model-based least-squares-fitting approach. Within a block of received symbols, we select some data symbols and regard them as pseudopilot symbols. The receiver considers all the possible patterns of the pseudopilots and associates each of them with a data sequence and a corresponding metric. The associated data sequence, whose metric is minimum, is selected as the detected data sequence. Our algorithm is not based on a decision-directed or decision-feedback architecture because the pseudopilots do not come from any detected symbols. The proposed algorithm needs to search all the possible patterns of the pseudopilots, and the complexity may increase with the number of pseudopilots and constellation size. To reduce the number of search, we further propose two modified approaches. The simulation results show that the performance of the proposed algorithms could approach a bit-error probability lower bound that is obtained by letting the receiver know the true values of the pseudopilots. Compared with the linear interpolation method, the proposed algorithm shows obvious improvement in fast-varying channels. The proposed modified approaches could also effectively reduce the number of search while maintaining the performance. We also give the complexity analysis of the proposed algorithm and an approach to determine the degree of the regression polynomial.

Original languageEnglish
Pages (from-to)859-872
Number of pages14
JournalIEEE Transactions on Vehicular Technology
Volume57
Issue number2
DOIs
Publication statusPublished - 2008 Mar 1

Fingerprint

Orthogonal Frequency Division multiplexing (OFDM)
Orthogonal frequency division multiplexing
Receiver
Decision Feedback
Metric
Least Square Fitting
Polynomial Regression
Linear Interpolation
Complexity Analysis
Interpolation Method
Error Probability
Multiplexing
Interpolation
Throughput
Polynomials
Model-based
Lower bound
Feedback
Simulation

All Science Journal Classification (ASJC) codes

  • Automotive Engineering
  • Aerospace Engineering
  • Electrical and Electronic Engineering
  • Applied Mathematics

Cite this

@article{865d24fbb7cf442e9f2b407c7bc91b7b,
title = "Detection of OFDM signals in fast-varying channels with low-density pilot symbols",
abstract = "In fast-varying channels, an orthogonal frequencydivision multiplexing system needs to insert denser pilot symbols among transmitted symbols in tracking the variation of a channel. However, using denser pilot symbols reduces transmission throughput. In this paper, we propose a pseudopilot algorithm for data detection in fast-varying channels without increasing the pilot density. Our algorithm is based on a regressional model-based least-squares-fitting approach. Within a block of received symbols, we select some data symbols and regard them as pseudopilot symbols. The receiver considers all the possible patterns of the pseudopilots and associates each of them with a data sequence and a corresponding metric. The associated data sequence, whose metric is minimum, is selected as the detected data sequence. Our algorithm is not based on a decision-directed or decision-feedback architecture because the pseudopilots do not come from any detected symbols. The proposed algorithm needs to search all the possible patterns of the pseudopilots, and the complexity may increase with the number of pseudopilots and constellation size. To reduce the number of search, we further propose two modified approaches. The simulation results show that the performance of the proposed algorithms could approach a bit-error probability lower bound that is obtained by letting the receiver know the true values of the pseudopilots. Compared with the linear interpolation method, the proposed algorithm shows obvious improvement in fast-varying channels. The proposed modified approaches could also effectively reduce the number of search while maintaining the performance. We also give the complexity analysis of the proposed algorithm and an approach to determine the degree of the regression polynomial.",
author = "Chang, {Ming Xian} and Hsieh, {Tsung Da}",
year = "2008",
month = "3",
day = "1",
doi = "10.1109/TVT.2007.906369",
language = "English",
volume = "57",
pages = "859--872",
journal = "IEEE Transactions on Vehicular Technology",
issn = "0018-9545",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

Detection of OFDM signals in fast-varying channels with low-density pilot symbols. / Chang, Ming Xian; Hsieh, Tsung Da.

In: IEEE Transactions on Vehicular Technology, Vol. 57, No. 2, 01.03.2008, p. 859-872.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Detection of OFDM signals in fast-varying channels with low-density pilot symbols

AU - Chang, Ming Xian

AU - Hsieh, Tsung Da

PY - 2008/3/1

Y1 - 2008/3/1

N2 - In fast-varying channels, an orthogonal frequencydivision multiplexing system needs to insert denser pilot symbols among transmitted symbols in tracking the variation of a channel. However, using denser pilot symbols reduces transmission throughput. In this paper, we propose a pseudopilot algorithm for data detection in fast-varying channels without increasing the pilot density. Our algorithm is based on a regressional model-based least-squares-fitting approach. Within a block of received symbols, we select some data symbols and regard them as pseudopilot symbols. The receiver considers all the possible patterns of the pseudopilots and associates each of them with a data sequence and a corresponding metric. The associated data sequence, whose metric is minimum, is selected as the detected data sequence. Our algorithm is not based on a decision-directed or decision-feedback architecture because the pseudopilots do not come from any detected symbols. The proposed algorithm needs to search all the possible patterns of the pseudopilots, and the complexity may increase with the number of pseudopilots and constellation size. To reduce the number of search, we further propose two modified approaches. The simulation results show that the performance of the proposed algorithms could approach a bit-error probability lower bound that is obtained by letting the receiver know the true values of the pseudopilots. Compared with the linear interpolation method, the proposed algorithm shows obvious improvement in fast-varying channels. The proposed modified approaches could also effectively reduce the number of search while maintaining the performance. We also give the complexity analysis of the proposed algorithm and an approach to determine the degree of the regression polynomial.

AB - In fast-varying channels, an orthogonal frequencydivision multiplexing system needs to insert denser pilot symbols among transmitted symbols in tracking the variation of a channel. However, using denser pilot symbols reduces transmission throughput. In this paper, we propose a pseudopilot algorithm for data detection in fast-varying channels without increasing the pilot density. Our algorithm is based on a regressional model-based least-squares-fitting approach. Within a block of received symbols, we select some data symbols and regard them as pseudopilot symbols. The receiver considers all the possible patterns of the pseudopilots and associates each of them with a data sequence and a corresponding metric. The associated data sequence, whose metric is minimum, is selected as the detected data sequence. Our algorithm is not based on a decision-directed or decision-feedback architecture because the pseudopilots do not come from any detected symbols. The proposed algorithm needs to search all the possible patterns of the pseudopilots, and the complexity may increase with the number of pseudopilots and constellation size. To reduce the number of search, we further propose two modified approaches. The simulation results show that the performance of the proposed algorithms could approach a bit-error probability lower bound that is obtained by letting the receiver know the true values of the pseudopilots. Compared with the linear interpolation method, the proposed algorithm shows obvious improvement in fast-varying channels. The proposed modified approaches could also effectively reduce the number of search while maintaining the performance. We also give the complexity analysis of the proposed algorithm and an approach to determine the degree of the regression polynomial.

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

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

U2 - 10.1109/TVT.2007.906369

DO - 10.1109/TVT.2007.906369

M3 - Article

AN - SCOPUS:41949113857

VL - 57

SP - 859

EP - 872

JO - IEEE Transactions on Vehicular Technology

JF - IEEE Transactions on Vehicular Technology

SN - 0018-9545

IS - 2

ER -