Weighted nonbinary repeat-accumulate codes

IEEE Transactions on Information Theory

Volumn 50, Issue 3, 2004, Pages 527-531

  Yang, Kyeongcheol ^a  

^a Pohang University of Science and Technology (POSTECH)   (South Korea)

Author keywords

Factor graph; Iterative decoding; Repeat accumulate (RA) codes; Sum product algorithm

Indexed keywords

ALGORITHMS; BIT ERROR RATE; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER SIMULATION; DECODING; GRAPH THEORY; SIGNAL TO NOISE RATIO; WHITE NOISE;

ADDITIVE WHITE GAUSSIAN NOISE; FACTOR GRAPH; ITERATIVE DECODING; SUM-PRODUCT ALGORITHM; WEIGHTED NONBINARY REPEAT-ACCUMULATE CODES;

TURBO CODES;

EID: 1842481634     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2004.825255     Document Type: Letter

References (14)

1. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: Turbo codes," in Proc. IEEE Int. Conf. Communications, Geneva, Switzerland, May 1993, pp. 1064-1070.
2. S.-Y. Chung, T. J. Richardson, and R. L. Urbanke, "Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation," IEEE Trans. Inform. Theory, vol. 47, pp. 657-670, Feb. 2001.
3. M. C. Davey, "Error-correction using low-density parity-check codes," Ph.D. dissertation, Univ. Cambridge, Cambridge, U.K, 1999.
4. M. C. Davey and D. J. C. MacKay, "Low-density parity check codes over GF(q)," IEEE Commun. Lett., vol. 2, pp. 165-167, June 1998.
5. D. Divsalar, H. Jin, and R. J. McEliece, "Coding theorems for 'turbo-like' codes," in Proc. 36th Annu. Allerton Conf. Communications, Control, and Computing, Monticello, IL, Sept. 1998, pp. 201-210.
6. R. G. Gallager, "Low-density parity-check codes," IRE Trans. Inform. Theory, vol. IT-8, pp. 21-28, Jan. 1962.
7. J. Hagenauer, E. Offer, and L. Papke, "Iterative decoding of binary block and convolutional codes," IEEE Trans. Inform. Theory, vol. 42, pp. 429-445, Mar. 1996.
8. H. Jin, A. Khandekar, and R. J. McEliece, "Irregular repeat-accumulate codes," in Proc. 2nd Int. Symp. Turbo Codes and Related Topics, Sept. 2000, pp. 1-9.
9. F. R. Kschischang, "Codes on graphs and iterative decoding," Tutorials of IEEE Int. Symp. Information Theory, Sorrento, Italy, Jun. 2000. [Online]. Available: http://www.comm.utoronto.ca/frank/isit2000/.
10. F. R. Kschischang, B. J. Frey, and H. A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inform. Theory, vol. 47, pp. 498-519, Feb. 2001.
11. D. J. C. MacKay and R. M. Neal, "Near Shannon limit performance of low density parity check codes," Electron. Lett., vol. 32, pp. 1645-1646, Aug. 1996.
12. T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, "Design of capacity-approaching irregular low-density parity check codes," IEEE Trans. Inform. Theory, vol. 47, pp. 619-637, Feb. 2001.
13. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. IT-27, pp. 533-547, Sept. 1981.
14. M. Xu, "Iterative decoding and graphical representations," Ph.D. dissertation, Calif. Inst. Technol., Pasadeba, CA, 1999.