The Bahl-Cocke-Jelinek-Raviv Algorithm Applied to the Two-User Binary Adder Channel
DOI:
https://doi.org/10.14209/jcis.2010.5Abstract
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.Downloads
Download data is not yet available.
Downloads
Published
2015-06-14
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
Issue
Section
Regular Papers
License
Authors who publish in this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a CC BY-NC 4.0 (Attribution-NonCommercial 4.0 International) that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors can enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) before and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
___________
Received 2015-06-14
Accepted 2015-06-14
Published 2015-06-14
Accepted 2015-06-14
Published 2015-06-14
