Iterative soft-decision decoding of linear block codes

Abstract

The authors show that for linear block codes defined over extensions of GF(2) a variant of the sub-optimal soft-decision Dorsch algorithm (1974) offers very good performance with low complexity. Furthermore, we show that, owing to the nature of the algorithm, it can easily be adapted to produce soft-decision output. This is then exploited in an iterative decoding scheme for product codes which is based on a decoding algorithm first proposed by Pyndiah et al (1996, 1998). Two different interleaver structures are presented yielding different performances both in terms of coding delay and bit-error-rate for a given signal-to-noise ratio. Reed–Solomon codes are used in the simulations. For reasons of complexity, only codes defined over GF(16) are considered. Simulations were carried out for the AWGN channel.