Worst-case Mutual Information Trajectories in Concatenated Codes with Asymptotic Interleavers

In this summary we present extrema1 (worst and best) average mutual information values carried by the extrinsic loglikelihood under the constraint of a given mean and variance while accounting for the consistency feature of loglikelihoods. This is done in an effort to gain insight into the iterative decoding procedure without resorting to the classical “Gaussian approximation”. 1