Incremental redundancy hybrid ARQ schemes based on low-density parity-check codes

IEEE Transactions on Communications

Volumn 52, Issue 8, 2004, Pages 1311-1321

  Sesia, Stefania ^a,b   Caire, Giuseppe ^b   Vivier, Guillaume ^a  

^a Motorola Labs   (France)

^b EURECOM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY CODES; BIT ERROR RATE; COMMUNICATION CHANNELS (INFORMATION THEORY); DATA COMMUNICATION SYSTEMS; DECODING; FADING (RADIO); ITERATIVE METHODS; NETWORK PROTOCOLS; WIRELESS TELECOMMUNICATION SYSTEMS;

BLOCK FADING CHANNEL; HYBRID AUTOMATIC TRANSMISSION REQUEST PROTOCOLS; INCREMENTAL REDUNDANCY; LOW DENSITY PARITY CHECK CODES; RANDOM CODING; TYPICAL SET DECODING;

SIGNAL ENCODING;

EID: 4444251530     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2004.833022     Document Type: Article

References (30)

1. E. Biglieri, J. Proakis, and S. Shamai, "Fading channels: Information-theoretic and communications aspects," IEEE Trans. Inform. Theory, vol. 44, pp. 2619-2692, Oct. 2001.
2. R. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
3. L. H. Ozarow, S. Shamai, and A. D. Wyner, Information theoretic considerations for cellular mobile radio, IEEE Trans. Veh. Technol., vol. 43, pp. 359-378, May 1994.
4. M. Mouly and M.-B. Pautet, The GSM System for Mobile Communications. Olympia, WA: Telecom, 1992.
5. H. Holma and A. Toskala, WCDMA for UMTS, 2nd ed. New York: Wiley, 2002.
6. S. Lin and D. J. Costello, Error and Control Coding: Fundamentals and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1983.
7. G. Caire and D. Tuninetti, "The throughput of hybrid-ARQ protocols for the Gaussian collision channel," IEEE Trans. Inform. Theory, vol. 47, pp. 1971-1988, July 2001.
8. C.-F. Leanderson and G. Caire, "The performance of incremental redundancy schemes based on convolutional codes in the block-fading Gaussian collision channel," IEEE Trans. Wireless Commun., vol. 3, pp. 843-854, May 2004.
9. D. N. Rowitch and L. B. Milstein, "On the performance of hybrid FEC/ARQ systems using rate-compatible punctured turbo (RCPT) codes," IEEE Trans. Commun., vol. 48, pp. 948-959, June 2000.
10. R. Mantha and R. Kschischang, "A capacity-approaching hybrid ARQ scheme using turbo codes," in Proc. Global Telecommunications Conf., vol. 5, 1999, pp. 2341-2345.
11. C. F. Leanderson, G. Caire, and O. Edfors, "Performance of incremental redundancy schemes with turbo codes," in Proc. Radiovetenskap och Kommunikation, June 2002, pp. 57-61.
12. Richardson T.J.,Urbanke R.L. The capacity of low-density parity-check codes under message-passing decoding IEEE Trans. Inform. Theory, vol. 47, pp. 599-618, Feb. 2001.
13. 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.
14. M. Zorzi and R. R. Rao, "On the use of renewal theory in the analysis of ARQ protocols" IEEE Trans. Commun., vol. 44, pp. 1077-1081, Sept. 1996.
15. W. Feller, An Introduction of Probability Theory and Its Applications. New York: Wiley, 1968.
16. T. Cover and J. Thomas, Elements of Information Theory. New York: Wiley, 1991.
17. R. G. Gallager, "Low-density parity-check codes," Ph.D. dissertation, Mass. Inst. Technol., Cambridge, MA, 1963.
18. R. J. McEliece, D. J. C. MacKay, and J.-F. Cheng, "Turbo decoding as an instance of Pearl's "belief propagation" algorithm," IEEE J. Select. Areas Commun., vol. 16, pp. 140-150, Feb. 1998.
19. S. Sesia, G. Caire, and G. Vivier, "Reducing the average complexity of LDPC decoding for incremental redundancy schemes," in Proc. 3rd Int. Symp. Turbo Codes, Sept. 2003, pp. 399-402.
20. 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.
21. M. C. Davey, "Error correction using low-density parity-check codes," Ph.D. dissertation, Gonville and Caius College, Cambridge, U.K., 1999.
22. R. L. Urbanke et al... [Online]. Available: http://lthcwww.epfl.ch/research/ldpcopt/
23. C. Di, D. Proietti, E. Telatar, T. Richardson, and R. Urbanke, "Finite length analysis of low-density parity-check codes on the binary erasure channel," IEEE Trans. Inform. Theory, vol. 48, pp. 1570-1575, June 2002.
24. D. Burshtein and G. Miller, "Expander graph arguments for message-passing algorithms," IEEE Trans. Inform. Theory, vol. 47, pp. 782-790, Feb. 2001.
25. T. Tian, C. Jones, J. D. Villasenor, and R. D. Wesel, "Construction of irregular LDPC codes with low error floors," in Proc. IEEE Int. Conf. Communications, vol. 5, May 2003, pp. 3125-3129.
26. T. Richardson and R. Urbanke, "Multiedge type LDPC codes", unpublished.
27. S. ten Brink, "Convergence behavior of iteratively decoded parallel concatenated codes," IEEE Trans. Commun., vol. 49, pp. 1727-1737, Oct. 2001.
28. A. Roumy, S. Guemghar, G. Caire, and S. Verdu, "Design methods for irregular repeat-accumulate codes," IEEE Trans. Inform. Theory, to be published.
29. S.Y. Chung, "On the construction of some capacity-approaching coding scheme," Ph.D. dissertation, Mass. Inst. Technol., Cambridge, MA, 2000.
30. A. Ashikhmin, G. Kramer, and S. ten Brink, "Extrinsic information transfer functions: A model and two properties," in Proc. Int. Symp. Information Theory, July 2002, p. 115.