Turbo decoding visualisation for a simple product code

The code which we analyse is an (8,4) parallel concatenated code. We have put into pictures that a turbo decoder is two decoders solving local minima problems in order to solve a global minima problem. We show the suboptimality of turbo decoders by plotting decision boundaries (MAP and turbo) on the plane. A good interleaver may be one where the produced decoding surfaces are as orthogonal to each other as possible. In analog decoders we see clearly that both component decoders act simultaneously.