Convergence based design of turbo codes

Abstract

In earlier work (see IEEE Trans. Inform. Theory, vol.47, no.2, p.671-86, Feb. 2001), we introduced a simple technique for analyzing the iterative decoder that is broadly applicable to different classes of codes defined over graphs in certain fading as well as AWGN channels. This technique is based on the observation that the extrinsic information from constituent MAP decoders is well approximated by Gaussian random variables when the inputs to the decoders are Gaussian. The independent Gaussian model implies the existence of an iterative decoder threshold that statistically characterizes the convergence of the iterative decoder. In this paper, we present an interesting convergence-based construction for asymmetric parallel concatenated convolutional codes.