Design of repeat-accumulate codes for iterative detection and decoding

IEEE Transactions on Signal Processing

Volumn 51, Issue 11, 2003, Pages 2764-2772

  Ten Brink, Stephan ^a   Kramer, Gerhard ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

Detection; Iterative decoding; Mutual information; Repeat accumulate codes

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); DECODING; FADING (RADIO); PHASE SHIFT KEYING; PROBABILITY; SIGNAL DETECTION; WHITE NOISE;

ADDITIVE WHITE GAUSSIAN NOISE; EXTRINSIC INFORMATION TRANSFER CHARTS; ITERATIVE DETECTION; LOW-DENSITY PARITY-CHECK CODES; REPEAT-ACCUMULATE CODES;

TURBO CODES;

EID: 0242365601     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2003.818250     Document Type: Article

References (33)

1. D. Divsalar, H. Jin, and R. J. McEliece, "Coding theorems for 'turbo-like' codes," in Proc. 36th Annu. Allerton Conf. Commun., Control, Computing, Sept. 1998, pp. 201-210.
2. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: Turbo-codes," in Proc. Int. Control Conf., May 1993, pp. 1064-1070.
3. R. G. Gallager, "Low-density parity-check codes," Sc.D. dissertation, Mass. Inst. Technol., Cambridge, MA, 1960.
4. ____, "Low-density parity-check codes," IEEE Trans. Inform. Theory, vol. IT-8, pp. 21-28, Jan. 1962.
5. H. Jin, A. Khandekar, and R. McEliece, "Irregular repeat-accumulate codes," in Proc. 2nd Int. Symp. Turbo Codes Related Topics, Brest, France, Sept. 2000, pp. 1-8.
6. S. ten Brink, "Convergence of iterative decoding," Electron. Lett., vol. 35, no. 10, pp. 806-808, May 1999.
7. S. ten Brink, G. Kramer, and A. Ashikhmin, "Design of low-density parity-check codes for modulation and detection," IEEE Trans. Commun., submitted for publication.
8. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, "Efficient erasure correcting codes," IEEE Trans. Inform. Theory, vol. 47, pp. 569-584, Feb. 2001.
9. T. J. Richardson and R. L. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inform. Theory, vol. 47, pp. 599-618, Feb. 2001.
10. T. J. Richardson, A. Shokrollahi, and R. L. Urbanke, "Design of capacity-approaching low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, pp. 619-637, Feb. 2001.
11. T. J. Richardson and R. L. Urbanke, "Efficient encoding of low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, pp. 638-656, Feb. 2001.
12. B. J. Frey and D. J. C. MacKay, "Irregular turbo codes," in Proc. 37th Ann. Allerton Conf. Commun., Control, Computing, Oct. 1999.
13. J. Boutros, G. Caire, E. Viterbo, H. Saway, and S. Vialle, "Turbo code at 0.03 dB from capacity limit," Proc. IEEE Int. Symp. Inform. Theory, p. 56, July 2002.
14. S. ten Brink, "Code doping for triggering iterative decoding convergence," Proc. IEEE Int. Symp. Inform. Theory, p. 235, July 2001.
15. 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.
16. S. Y. Chung, "On the Construction of Some Capacity-Approaching Coding Schemes," Ph.D. dissertation, Mass. Inst. Technol., Cambridge, MA, 2000.
17. A. Ashikhmin, G. Kramer, and S. ten Brink, "Extrinsic information transfer functions: A model and two properties," in Proc. 36th Ann. Conf. Information Sciences Syst., Princeton, Mar. 2002.
18. M. Tuechler and J. Hagenauer, "EXIT charts and irregular codes," in Proc. 36th Annu. Conf. Inform. Sciences Syst., Princeton, NJ, Mar. 2002.
19. C. Di, D. Proietti, I. E. Telatar, T. J. Richardson, and R. L. Urbanke, "Finite-length analysis of low-density parity-check codes on the binary erasure channel," IEEE Trans. Inform. Theory, vol. 48, pp. 1570-1579, June 2002.
20. A. M. Tonello, "Space-time bit-interleaved coded modulation with an iterative decoding strategy," in Proc. Veh. Technol. Conf., Sept. 2000, pp. 473-478.
21. A. van Zelst, R. van Nee, and G. Awater, "Turbo-BLAST and its performance," in Proc. Veh. Technol. Conf., May 2001.
22. A. Stefanov and T. Duman, "Turbo-coded modulation for systems with transmit and receive antenna diversity over block fading channels: System model, decoding approaches, and practical considerations," IEEE J. Select. Areas Commun., vol. 19, pp. 958-968, May 2001.
23. C. Schlegel and A. Grant, "Concatenated space-time coding," in Proc. PIMRC, San Diego, CA, Sept. 2001.
24. B. M. Hochwald and S. ten Brink, "Iterative list sphere decoding to attain capacity on a multi-antenna link," in 39th Annu. Allerton Conf. Commun., Contr., Comput., Oct. 2001.
25. G. J. Foschini, "Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas," Bell Labs. Tech. J., vol. 1, no. 2, pp. 41-59, 1996.
26. I. E. Telatar, "Capacity of multi-antenna Gaussian channels," Eur. Trans. Telecom., vol. 10, pp. 585-595, Nov. 1999.
27. E. Biglieri, J. Proakis, and S. Shamai (Shitz), "Fading channels: Information-theoretic and communications aspects," IEEE Trans. Inform. Theory, vol. 44, pp. 2619-2692, Oct. 1998.
28. S. ten Brink and B. M. Hochwald, "Detection thresholds of iterative MIMO processing," Proc. IEEE Int. Symp. Inform. Theory, p. 22, July 2002.
29. S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, "Analysis, design, and iterative decoding of double serially concatenated codes with interleavers," IEEE J. Select. Areas Commun., vol. 16, pp. 231-244, Feb. 1998.
30. L. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans. Inform. Theory, vol. IT-20, pp. 284-287, Mar. 1974.
31. P. Robertson, E. Villebrun, and P. Hoeher, "A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain," in Proc. Int. Contr. Conf., June 1995, pp. 1009-1013.
32. S. ten Brink and G. Kramer, "Turbo processing for scalar and vector channels," in Proc. 3rd Int. Symp. Turbo Codes Related Topics, Brest, France, Sept. 2003, pp. 23-30.
33. A. Roumy, S. Guemghar, G. Caire, and S. Verdú, "Design methods for irregular repeat-accumulate codes," Proc. IEEE Int. Symp. Inform. Theory, p. 2, June-July.