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

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 n...

Full description

Saved in:
Bibliographic Details
Published in:Telecommunication systems 2018-07, Vol.68 (3), p.513-521
Main Authors: de Souza, I. M. M., Alcoforado, M. L. M. G., da Rocha, V. C.
Format: Article
Language:English
Subjects:
Algorithms
Artificial Intelligence
Binary codes
Business and Management
Codes
Computer Communication Networks
Computer simulation
Decoding
IT in Business
Iterative methods
Materials management
Probability Theory and Stochastic Processes
Random noise
Telecommunications systems
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1018-4864
1572-9451
DOI:10.1007/s11235-017-0407-z