In this letter we present a low-complexity architecture designed for the decoding of block turbo codes. In particular we simplify the implementation of Pyndiah's algorithm by not storing any of the concurrent codewords generated by the list decoder.

This paper is concerned with the design of block turbo codes for very high bit rate applications. We first introduce an original low-complexity architecture designed for the iterative decoding of product codes. The implementation of the Chase-Pyndiah algorithm is simplified by not memorizing any of the list decoding concurrent code words. We then illustrate that such block turbo codes allow some bit rate improvement in the context of local loop transmission

This letter presents an original phase synchronization scheme designed for block turbo coded systems. This is a low-complexity scheme. It copes with low signal-to-noise ratios, taking complete advantage of the turbo coding possibilities. We display various results, showing that the proposed algorithm is able to process blocks of a few hundreds bits and that it tackles the case of large quadrature amplitude modulation constellations very well and with no phase ambiguity.

This paper concerns a new synchronizing scheme designed for block turbo coded system. The phase estimation relies on the feedback of the extrinsic information. A near optimum version of the algorithm based on the block turbo decoder devised by Pyndiah allows easy implementation. We display various results showing that the proposed algorithm is able to track frequency shifts and that it works very well in the case of general Quadrature Amplitude Modulation (QAM) constellations. We also show that this turbo synchronizer works at low Signal to Noise Ratios (SNR) taking completely advantage of the turbo coding possibilities.