Approaching the Matched Filter Bound with Unique Word OFDM

Werner Haselmayr; Christian Hofbauer; Mario Huemer; Andreas Springer

doi:10.1109/ICC.2019.8761639

Approaching the Matched Filter Bound with Unique Word OFDM

Werner Haselmayr, Christian Hofbauer, Mario Huemer, Andreas Springer

Research output: Conference proceeding/Chapter in Book/Report/ › Conference Paper › peer-review

Abstract

In this work, we consider a bit-interleaved coded modulation unique word (UW) OFDM system with turbo equalization. For such a system, only a limited performance improvement over the turbo iterations was observed in a previous work. This is because interleaving was limited to one UW-OFDM symbol, which causes dependencies between the log-likelihood ratios exchanged between the equalizer and the decoder. To overcome this issue, we propose interleaving beyond one UW-OFDM symbol. Moreover, through bit error ratio simulations we determine the minimum number of UW-OFDM symbols across which interleaving should be performed to reach the matched filter bound (MFB).

Original language	English
Title of host publication	ICC 2019 - 2019 IEEE International Conference on Communications (ICC)
Publisher	IEEE Computer Society
Pages	1-4
Number of pages	4
ISBN (Print)	978-1-5386-8089-6
DOIs	https://doi.org/10.1109/ICC.2019.8761639
Publication status	Published - 24 May 2019
Externally published	Yes
Event	ICC 2019 - 2019 IEEE International Conference on Communications (ICC) - Shanghai, China Duration: 20 May 2019 → 24 May 2019

Conference

Conference	ICC 2019 - 2019 IEEE International Conference on Communications (ICC)
Period	20/05/19 → 24/05/19

Keywords

OFDM
Decoding
Equalizers
Generators
Covariance matrices
Fading channels
Discrete Fourier transforms

Access to Document

10.1109/ICC.2019.8761639

https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=8761639

Cite this

@inproceedings{62c834b3bd59418482b78a665f24d3ec,

title = "Approaching the Matched Filter Bound with Unique Word OFDM",

abstract = "In this work, we consider a bit-interleaved coded modulation unique word (UW) OFDM system with turbo equalization. For such a system, only a limited performance improvement over the turbo iterations was observed in a previous work. This is because interleaving was limited to one UW-OFDM symbol, which causes dependencies between the log-likelihood ratios exchanged between the equalizer and the decoder. To overcome this issue, we propose interleaving beyond one UW-OFDM symbol. Moreover, through bit error ratio simulations we determine the minimum number of UW-OFDM symbols across which interleaving should be performed to reach the matched filter bound (MFB).",

keywords = "OFDM, Decoding, Equalizers, Generators, Covariance matrices, Fading channels, Discrete Fourier transforms",

author = "Werner Haselmayr and Christian Hofbauer and Mario Huemer and Andreas Springer",

year = "2019",

month = may,

day = "24",

doi = "10.1109/ICC.2019.8761639",

language = "English",

isbn = "978-1-5386-8089-6",

pages = "1--4",

booktitle = "ICC 2019 - 2019 IEEE International Conference on Communications (ICC)",

publisher = "IEEE Computer Society",

address = "United States",

note = "ICC 2019 - 2019 IEEE International Conference on Communications (ICC) ; Conference date: 20-05-2019 Through 24-05-2019",

}

TY - GEN

T1 - Approaching the Matched Filter Bound with Unique Word OFDM

AU - Haselmayr, Werner

AU - Hofbauer, Christian

AU - Huemer, Mario

AU - Springer, Andreas

PY - 2019/5/24

Y1 - 2019/5/24

N2 - In this work, we consider a bit-interleaved coded modulation unique word (UW) OFDM system with turbo equalization. For such a system, only a limited performance improvement over the turbo iterations was observed in a previous work. This is because interleaving was limited to one UW-OFDM symbol, which causes dependencies between the log-likelihood ratios exchanged between the equalizer and the decoder. To overcome this issue, we propose interleaving beyond one UW-OFDM symbol. Moreover, through bit error ratio simulations we determine the minimum number of UW-OFDM symbols across which interleaving should be performed to reach the matched filter bound (MFB).

AB - In this work, we consider a bit-interleaved coded modulation unique word (UW) OFDM system with turbo equalization. For such a system, only a limited performance improvement over the turbo iterations was observed in a previous work. This is because interleaving was limited to one UW-OFDM symbol, which causes dependencies between the log-likelihood ratios exchanged between the equalizer and the decoder. To overcome this issue, we propose interleaving beyond one UW-OFDM symbol. Moreover, through bit error ratio simulations we determine the minimum number of UW-OFDM symbols across which interleaving should be performed to reach the matched filter bound (MFB).

KW - OFDM

KW - Decoding

KW - Equalizers

KW - Generators

KW - Covariance matrices

KW - Fading channels

KW - Discrete Fourier transforms

UR - https://ieeexplore.ieee.org/document/8761639/

U2 - 10.1109/ICC.2019.8761639

DO - 10.1109/ICC.2019.8761639

M3 - Conference Paper

SN - 978-1-5386-8089-6

SP - 1

EP - 4

BT - ICC 2019 - 2019 IEEE International Conference on Communications (ICC)

PB - IEEE Computer Society

T2 - ICC 2019 - 2019 IEEE International Conference on Communications (ICC)

Y2 - 20 May 2019 through 24 May 2019

ER -

Approaching the Matched Filter Bound with Unique Word OFDM

Abstract

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this