The Bahl-Cocke-Jelinek-Raviv Algorithm Applied to the Two-User Binary Adder Channel

  • Maria de Lourdes M. G. Alcoforado
  • Valdemar C. da Rocha Jr.

Abstract

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 paper describes an application of the BCJR algorithm for decoding the output of a multiple access channel called the noisy two-user binary adder channel, in the presence of additive white Gaussian noise.
Published
14-06-2015
How to Cite
de Lourdes M. G. Alcoforado, M., & C. da Rocha Jr., V. (2015). The Bahl-Cocke-Jelinek-Raviv Algorithm Applied to the Two-User Binary Adder Channel. Journal of Communication and Information Systems, 25(1). https://doi.org/10.14209/jcis.2010.5
Section
Regular Papers