Iterative LMMSE channel estimation and decoding based on probabilistic bias

Keigo Takeuchi, Ralf R. Müller, Mikko Vehkapera

Research output: Contribution to journalArticleScientificpeer-review

4 Citations (Scopus)

Abstract

Iterative channel estimation and decoding based on probabilistic bias is investigated. In order to control the occurrence probability of transmitted symbols, biased convolutional codes (CCs) are proposed. A biased CC is obtained by puncturing the parity bit of a conventional (unbiased) CC and by inserting a fixed bit at the punctured position when the state is contained in a certain subset of all possible states. A priori information about the imposed bias is utilized for the initial linear minimum mean-squared error (LMMSE) channel estimation. This paper focuses on biased turbo codes that are constructed as the parallel concatenation of two biased CCs with interleaving, and proposes an iterative LMMSE channel estimation and decoding scheme based on approximate belief propagation. The convergence property of the iterative LMMSE channel estimation and decoding scheme is analyzed via density evolution (DE). The DE analysis allows one to design the magnitude of the bias according to the coherence time, in terms of the decoding threshold. The proposed scheme is numerically shown to outperform conventional pilot-based schemes in the moderate signal-to-noise ratio (SNR) regime, at the expense of a performance degradation in the high SNR regime.
Original languageEnglish
Article number6528082
Pages (from-to)2853-2863
JournalIEEE Transactions on Communications
Volume61
Issue number7
DOIs
Publication statusPublished - 17 Jun 2013
MoE publication typeA1 Journal article-refereed

Fingerprint

Convolutional codes
Channel estimation
Decoding
Signal to noise ratio
Piercing
Turbo codes
Degradation

Keywords

  • Belief propagation
  • Biased convolutional codes
  • Density evolution
  • Iterative decoding
  • Linear minimum mean-squared error (LMMSE) channel estimation

Cite this

@article{998f6227ac1c495b9cdb830c46c7d546,
title = "Iterative LMMSE channel estimation and decoding based on probabilistic bias",
abstract = "Iterative channel estimation and decoding based on probabilistic bias is investigated. In order to control the occurrence probability of transmitted symbols, biased convolutional codes (CCs) are proposed. A biased CC is obtained by puncturing the parity bit of a conventional (unbiased) CC and by inserting a fixed bit at the punctured position when the state is contained in a certain subset of all possible states. A priori information about the imposed bias is utilized for the initial linear minimum mean-squared error (LMMSE) channel estimation. This paper focuses on biased turbo codes that are constructed as the parallel concatenation of two biased CCs with interleaving, and proposes an iterative LMMSE channel estimation and decoding scheme based on approximate belief propagation. The convergence property of the iterative LMMSE channel estimation and decoding scheme is analyzed via density evolution (DE). The DE analysis allows one to design the magnitude of the bias according to the coherence time, in terms of the decoding threshold. The proposed scheme is numerically shown to outperform conventional pilot-based schemes in the moderate signal-to-noise ratio (SNR) regime, at the expense of a performance degradation in the high SNR regime.",
keywords = "Belief propagation, Biased convolutional codes, Density evolution, Iterative decoding, Linear minimum mean-squared error (LMMSE) channel estimation",
author = "Keigo Takeuchi and M{\"u}ller, {Ralf R.} and Mikko Vehkapera",
year = "2013",
month = "6",
day = "17",
doi = "10.1109/TCOMM.2013.053013.120919",
language = "English",
volume = "61",
pages = "2853--2863",
journal = "IEEE Transactions on Communications",
issn = "0090-6778",
publisher = "IEEE Institute of Electrical and Electronic Engineers",
number = "7",

}

Iterative LMMSE channel estimation and decoding based on probabilistic bias. / Takeuchi, Keigo; Müller, Ralf R.; Vehkapera, Mikko.

In: IEEE Transactions on Communications, Vol. 61, No. 7, 6528082, 17.06.2013, p. 2853-2863.

Research output: Contribution to journalArticleScientificpeer-review

TY - JOUR

T1 - Iterative LMMSE channel estimation and decoding based on probabilistic bias

AU - Takeuchi, Keigo

AU - Müller, Ralf R.

AU - Vehkapera, Mikko

PY - 2013/6/17

Y1 - 2013/6/17

N2 - Iterative channel estimation and decoding based on probabilistic bias is investigated. In order to control the occurrence probability of transmitted symbols, biased convolutional codes (CCs) are proposed. A biased CC is obtained by puncturing the parity bit of a conventional (unbiased) CC and by inserting a fixed bit at the punctured position when the state is contained in a certain subset of all possible states. A priori information about the imposed bias is utilized for the initial linear minimum mean-squared error (LMMSE) channel estimation. This paper focuses on biased turbo codes that are constructed as the parallel concatenation of two biased CCs with interleaving, and proposes an iterative LMMSE channel estimation and decoding scheme based on approximate belief propagation. The convergence property of the iterative LMMSE channel estimation and decoding scheme is analyzed via density evolution (DE). The DE analysis allows one to design the magnitude of the bias according to the coherence time, in terms of the decoding threshold. The proposed scheme is numerically shown to outperform conventional pilot-based schemes in the moderate signal-to-noise ratio (SNR) regime, at the expense of a performance degradation in the high SNR regime.

AB - Iterative channel estimation and decoding based on probabilistic bias is investigated. In order to control the occurrence probability of transmitted symbols, biased convolutional codes (CCs) are proposed. A biased CC is obtained by puncturing the parity bit of a conventional (unbiased) CC and by inserting a fixed bit at the punctured position when the state is contained in a certain subset of all possible states. A priori information about the imposed bias is utilized for the initial linear minimum mean-squared error (LMMSE) channel estimation. This paper focuses on biased turbo codes that are constructed as the parallel concatenation of two biased CCs with interleaving, and proposes an iterative LMMSE channel estimation and decoding scheme based on approximate belief propagation. The convergence property of the iterative LMMSE channel estimation and decoding scheme is analyzed via density evolution (DE). The DE analysis allows one to design the magnitude of the bias according to the coherence time, in terms of the decoding threshold. The proposed scheme is numerically shown to outperform conventional pilot-based schemes in the moderate signal-to-noise ratio (SNR) regime, at the expense of a performance degradation in the high SNR regime.

KW - Belief propagation

KW - Biased convolutional codes

KW - Density evolution

KW - Iterative decoding

KW - Linear minimum mean-squared error (LMMSE) channel estimation

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

U2 - 10.1109/TCOMM.2013.053013.120919

DO - 10.1109/TCOMM.2013.053013.120919

M3 - Article

AN - SCOPUS:84881134098

VL - 61

SP - 2853

EP - 2863

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0090-6778

IS - 7

M1 - 6528082

ER -