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

Maria de Lourdes M.G. Alcoforado; Mariana C.C. Oliveira; Valdemar C. da Rocha Jr

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

View Fulltext

Author(s): Maria de Lourdes M.G. Alcoforado ¹ ; Mariana C.C. Oliveira ¹ ; Valdemar C. da Rocha Jr ²
- Affiliations: 1: Telecommunications Laboratory – LABTEL, Communications Group – GCOM, University of Pernambuco (UPE), 50.750-470, Recife, Brazil;
  2: Department of Electronics and Systems, Communications Research Group – CODEC, Federal University of Pernambuco, 50740-550, Recife, Brazil
Source: Volume 9, Issue 7, 07 May 2015, p. 897 – 902
DOI: 10.1049/iet-com.2014.0376 , Print ISSN 1751-8628, Online ISSN 1751-8636

« Previous Article
Table of contents
Next Article »

Received 16/04/2014, Accepted 21/11/2014, Published 05/03/2015

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.

References

1. 1)
  - 7. Kiviluoto, L., Ostergard, P.R.J.: ‘New uniquely decodable codes for the t-user binary adder channel with 3 ≤ t ≤ 5’, IEEE Trans. Inf. Theory, 2007, 53, (7), pp. 1219–1220.
2. 2)
  - 11. Lu, S., Cheng, J., Hou, W., et al: ‘Generalized construction of signature code for multiple-access adder channel’. Proc IEEE Int. Symp. on Information Theory (ISIT 2013), Istanbul, Turkey, 2013, pp. 1655–1659.
3. 3)
  - T. Kasami , S. Lin . Coding for a multiple-access channel. IEEE Trans. Inf. Theory , 2 , 129 - 137
4. 4)
  - 8. Roumy, A., Declerq, D.: ‘Characterization and optimization of LDPC codes for the 2-user Gaussian multiple access channel’, EURASIP J. Wirel. Commun. Netw., 2007, doi:10.1155/2007/74890.
5. 5)
  - 2. Berrou, C., Glavieux, A., Thitimajshima, P.: ‘Near Shannon limit, error-correcting coding and decoding: turbo codes’. Proc. IEEE Int. Conf. Comm. (ICC'93), May 1993, 2, pp. 1064–1071.
6. 6)
  - 3. Alcoforado, M.L.M.G., da Rocha, V.C.Jr.: ‘The Bahl-Cocke-Jelinek-Raviv algorithm applied to the two-user binary adder channel’, J. Commun. Inf. Sys., 2010, 25, (1), pp. 30–35.
7. 7)
  - M. Mattas , P.R.J. Ostergard . A new bound for the zero-error capacity region of the two-user binary adder channel. IEEE Trans. Inf. Theory , 3289 - 3291
8. 8)
  - 9. Beltrão Neto, H.V., da Rocha, V.C.Jr.: ‘Iterative decoding results for the Gaussian multiuser binary adder channel’. Proc. Tenth Int. Symp. Communication Theory and Applications, July 2009, Ambleside, UK, pp. 1–6.
9. 9)
  - R. Peterson , D.J. Costello . Binary convolutional codes for a multiple-access channel. IEEE Trans. Inf. Theory , 1 , 101 - 105
10. 10)
  - 10. Wang, G., Land, I., Grant, A.: ‘Irregular repeat accumulate codes with few iterations for the binary adder channel’. Proc. Seventh Int. Symp. on Turbo Codes and Iterative Information Processing (ISTC 2012), Gothenburg, Sweden, 2012, pp. 215–219.
11. 11)
  - L. Bahl , J. Cocke , F. Jelinek , J. Raviv . Optimal decoding of linear codes for minimizing symbol error rate. IEEE Trans. Inf. Theory , 2 , 284 - 287
12. 12)
  - 26. Alcoforado, M., da Rocha, V.C.Jr., Carvalho Lima, M.d., Markarian, G.: ‘Iterative decoding of turbo convolutional codes over noisy 2-BAC’, IET Elect. Lett., 2011, 47, (13), pp. 749–751 (doi: 10.1049/el.2011.0851).

Login

Not registered yet?

Share

Tools

Login to add to favourites

Key

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

References

Related content