Efficient Computation of EXIT Functions for Nonbinary Iterative Decoding

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 a posteriori probability decoder can be calculated with very low complexity, where expen...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications 2006-12, Vol.54 (12), p.2133-2136
Main Authors: Kliewer, J., Soon Xin Ng, Hanzo, L.
Format: Article
Language:English
Subjects:
Applied sciences
Charts
Coding, codes
Computational efficiency
Concatenated codes
Convergence
Decoders
Decoding
Exact sciences and technology
Extrinsic information transfer (EXIT) charts
H infinity control
Histograms
Information analysis
Information, signal and communications theory
Iterative decoding
Iterative methods
Mathematical analysis
Mathematical models
Modulation
Modulation coding
Mutual information
nonbinary iterative decoding
Parity check codes
Probability
Signal and communications theory
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Transmission and modulation (techniques and equipments)
turbo trellis-coded modulation (TTCM)
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 a posteriori probability decoder can be calculated with very low complexity, where expensive histogram measurements are not required any more. An example for turbo trellis-coded modulation demonstrates the capabilities of the proposed approach
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2006.885050