Portal de Periódicos da CAPES

Artigo Acesso aberto Produção Nacional Revisado por pares

BIBTEX RIS

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

2015; Institution of Engineering and Technology; Volume: 9; Issue: 7 Linguagem: Inglês

10.1049/iet-com.2014.0376

1751-8636

Maria de Lourdes Melo Guedes Alcoforado, Mariana C.C. Oliveira, Valdemar C. da Rocha,

Cellular Automata and Applications

The Bahl–Cocke–Jelinek–Raviv (BCJR) algorithm is a well-known maximum a posteriori 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.