On the Computation of EXIT Characteristics for Symbol-Based Iterative Decoding
Conference: TURBO - CODING - 2006 - 4th International Symposium on Turbo Codes & Related Topics; 6th International ITG-Conference on Source and Channel Coding
04/03/2006 - 04/07/2006 at Munich, Germany
Proceedings: TURBO - CODING - 2006
Pages: 6Language: englishTyp: PDFPersonal VDE Members are entitled to a 10% discount on this title
Kliewer, Jörg (University of Notre Dame, Department of Electrical Engineering, Notre Dame, IN 46556, USA)
Ng, Soon Xin; Hanzo, Lajos (University of Southampton, Communications Research Group, Southampton, SO17 1BJ, UK)
In this contribution we propose an efficient method for computing symbol-based extrinsic information transfer (EXIT) charts, which are useful for estimating the convergence properties of non-binary iterative decoding. A standard solution is to apply a priori reliability information to the a posteriori probability (APP) constituent decoder and compute the resultant average extrinsic information at the decoder's output using multidimensional histogram measurements. However, the employment of this technique is only feasible for a low number of bits per symbol, since the complexity of this approach increases exponentially with the number of bits per symbol. We demonstrate that by averaging over a function of the extrinsic APPs for a long block the extrinsic information can be estimated at a low complexity. In contrast to using histogram measurements, the proposed technique allows us to generate EXIT charts even for a high number of bits per symbol. Our design examples using either a non-binary serial concatenated code or turbo trellis-coded modulation demonstrate the attractive benefits of the proposed approach.