On the Computation of EXIT Characteristics for Symbol-Based Iterative Decoding

Kliewer, J, Ng, S. X. and Hanzo, L. (2006) On the Computation of EXIT Characteristics for Symbol-Based Iterative Decoding. International Symposium on Turbo Coding, Munich, Germany. 03 - 07 Apr 2006.

Record type: Conference or Workshop Item (Paper)

Abstract

In this paper we propose an efficient method for computing index-based extrinsic information transfer (EXIT) charts, which are useful for estimating the convergence properties of non-binary iterative decoding. A standard method is to apply <i>a priori</i> reliability information to the <i>a posteriori</i> probability (APP) constituent decoder and compute the resulting average extrinsic information at the decoder output via multidimensional histogram measurements. However, this technique is only reasonable for very small index lengths as the complexity of this approach grows exponentially with the index length. We show that by averaging over a function of the extrinsic APPs for a long block the extrinsic information can be estimated with very low complexity. In contrast to using histogram measurements this method allows to generate EXIT charts even for larger index alphabets. Examples for a non-binary serial concatenated code and for turbo trellis-coded modulation, resp., demonstrate the capabilities of the proposed approach.

Text

istc-06-a.pdf - Other

Download (230kB)