Iterative BEAST-Decoding of Product Codes

Conference: TURBO - CODING - 2006 - 4th International Symposium on Turbo Codes & Related Topics; 6th International ITG-Conference on Source and Channel Coding
04/03/2006 - 04/07/2006 at Munich, Germany

Proceedings: TURBO - CODING - 2006

Pages: 6Language: englishTyp: PDF

Personal VDE Members are entitled to a 10% discount on this title

Loncar, Maja; Johannesson, Rolf (Dept. of Information Technology, Lund University, Sweden)
Bocharova, Irina E.; Kudryashov, Boris D. (Dept. of Inform. Systems, St. Petersburg University on Aerospace Instrum., Russia)

This paper presents a low-complexity iterative algorithm for decoding concatenated block codes, in particular, product codes. Component decoders in the iterative scheme are based on BEAST–Bidirectional Efficient Algorithm for Searching code Trees. BEAST finds a list of the most probable codewords and uses them to compute approximate a posteriori symbol probabilities. The proposed decoder has significantly lower complexity than the trellis-based BCJR-type decoder. The decoding complexity depends on the trellis complexity of the component codes, and, with the proper design of the constituent codes, it can be kept sufficiently low. It is shown that the iterative BEAST-APP decoder outperforms the iterative schemes that employ algebraic-type decoders to find the candidate codewords. The bit-error-rate performance and the complexity of the proposed decoder are illustrated by simulation results.