Turbo decoding of simple product codes in a two user binary adder channel employing the Bahl–Cocke–Jelinek–Raviv algorithm

Abstract

The main goal in this paper is an investigation of the Bahl–Cocke–Jelinek–Raviv (BCJR) algorithm applied in a turbo decoding scheme. Binary product codes are employed in a turbo coding scheme and the channel model considered is the two user binary adder channel (2-BAC) with additive white Gaussian noise. A trellis for two users is constructed for a pair of product codes tailored for use in the 2-BAC in order to employ the BCJR decoding algorithm. Computer simulation is employed to show that product codes on the 2-BAC, employing low-complexity component codes, produces considerable gain with few iterations under iterative BCJR decoding.