Efficient computation of EXIT functions for nonbinary iterative decoding

Jörg Kliewer; Soon Xin Ng; Lajos Hanzo

doi:10.1109/TCOMM.2006.885050

Efficient computation of EXIT functions for nonbinary iterative decoding

Jörg Kliewer, Soon Xin Ng, Lajos Hanzo

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

83 Scopus citations

Abstract

The calculation of nonbinary extrinsic information transfer charts for the iterative decoding of concatenated index-based codes is addressed. We show that the extrinsic information at the output of a constituent posteriori probability decoder can be calculated with very low complexity, where expensive histogram measurements are not required anymore. An example for turbo trellis-coded modulation demonstrates the capabilities of the proposed approach.

Original language	English (US)
Pages (from-to)	2133-2136
Number of pages	4
Journal	IEEE Transactions on Communications
Volume	54
Issue number	12
DOIs	https://doi.org/10.1109/TCOMM.2006.885050
State	Published - Dec 2006
Externally published	Yes

All Science Journal Classification (ASJC) codes

Electrical and Electronic Engineering

Keywords

Extrinsic information transfer (EXIT) charts
Nonbinary iterative decoding
Turbo trellis-coded modulation (TTCM)

Access to Document

10.1109/TCOMM.2006.885050

Cite this

@article{ef38303be1a64c0fb17229eb42819048,

title = "Efficient computation of EXIT functions for nonbinary iterative decoding",

abstract = "The calculation of nonbinary extrinsic information transfer charts for the iterative decoding of concatenated index-based codes is addressed. We show that the extrinsic information at the output of a constituent posteriori probability decoder can be calculated with very low complexity, where expensive histogram measurements are not required anymore. An example for turbo trellis-coded modulation demonstrates the capabilities of the proposed approach.",

keywords = "Extrinsic information transfer (EXIT) charts, Nonbinary iterative decoding, Turbo trellis-coded modulation (TTCM)",

author = "J{\"o}rg Kliewer and Ng, {Soon Xin} and Lajos Hanzo",

note = "Funding Information: Paper approved by A. H. Banihashemi, the Editor for Coding and Communication Theory of the IEEE Communications Society. Manuscript received June 22, 2005; revised February 28, 2006. This work was supported in part by the Leverhulme Trust, London, U.K., in part by EPSRC, Swindon, U.K., and in part by the EU under the auspices of the Phoenix and Newcom projects. This paper was presented in part at the 4th International Symposium on Turbo Codes and Related Topics, Munich, Germany, April 2006.",

year = "2006",

month = dec,

doi = "10.1109/TCOMM.2006.885050",

language = "English (US)",

volume = "54",

pages = "2133--2136",

journal = "IEEE Transactions on Communications",

issn = "0090-6778",

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

number = "12",

}

TY - JOUR

T1 - Efficient computation of EXIT functions for nonbinary iterative decoding

AU - Kliewer, Jörg

AU - Ng, Soon Xin

AU - Hanzo, Lajos

N1 - Funding Information: Paper approved by A. H. Banihashemi, the Editor for Coding and Communication Theory of the IEEE Communications Society. Manuscript received June 22, 2005; revised February 28, 2006. This work was supported in part by the Leverhulme Trust, London, U.K., in part by EPSRC, Swindon, U.K., and in part by the EU under the auspices of the Phoenix and Newcom projects. This paper was presented in part at the 4th International Symposium on Turbo Codes and Related Topics, Munich, Germany, April 2006.

PY - 2006/12

Y1 - 2006/12

N2 - The calculation of nonbinary extrinsic information transfer charts for the iterative decoding of concatenated index-based codes is addressed. We show that the extrinsic information at the output of a constituent posteriori probability decoder can be calculated with very low complexity, where expensive histogram measurements are not required anymore. An example for turbo trellis-coded modulation demonstrates the capabilities of the proposed approach.

AB - The calculation of nonbinary extrinsic information transfer charts for the iterative decoding of concatenated index-based codes is addressed. We show that the extrinsic information at the output of a constituent posteriori probability decoder can be calculated with very low complexity, where expensive histogram measurements are not required anymore. An example for turbo trellis-coded modulation demonstrates the capabilities of the proposed approach.

KW - Extrinsic information transfer (EXIT) charts

KW - Nonbinary iterative decoding

KW - Turbo trellis-coded modulation (TTCM)

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

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

U2 - 10.1109/TCOMM.2006.885050

DO - 10.1109/TCOMM.2006.885050

M3 - Article

AN - SCOPUS:33845744468

SN - 0090-6778

VL - 54

SP - 2133

EP - 2136

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

IS - 12

ER -

Efficient computation of EXIT functions for nonbinary iterative decoding

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this