Bahl–Cocke–Jelinek–Raviv decoding algorithm applied to the three-user binary adder channel

摘要

The Bahl–Cocke–Jelinek–Raviv (BCJR) algorithm is a well-known maximum probability decoding algorithm which has been proposed earlier for point to point communication applications, employing block codes or convolutional codes and turbo codes. This study describes an application of the BCJR algorithm for decoding the output of a multiple-access channel called the noisy three-user binary adder channel, in the presence of additive white Gaussian noise. The computer simulation results are presented for the overall coding performance in terms of bit error rate against signal-to-noise ratio.