EBP-GEXIT Charts for M-Ary AWGN Channel for Generalized LDPC and Turbo Codes

Abstract

The maximum a posteriori (MAP) threshold corresponds to the fundamental limit that one can hope to achieve with the given channel code ensemble. Apart from theoretical interests, finding this limit is also desirable since <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">spatial-coupled</i> code ensembles approach this MAP threshold due to phenomenon termed as <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">threshold saturation</i> . However finding this MAP threshold, in general, is known to be computationally prohibitive. This work proposes a tractable method for estimating the MAP threshold for various families of sparse-graph code ensembles over non-binary complex-input additive white Gaussian noise (AWGN) channel. Towards this, we provide a method to approximate the extended belief propagation generalized extrinsic information transfer (EBP-GEXIT) chart and estimate the MAP threshold by applying the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Maxwell construction</i> to it. To illustrate the validity of our method, we study spatial coupling for serially-concatenated turbo-codes and numerically observe threshold saturation of these codes to the MAP thresholds estimated via our method.