A channel representation method for the study of hybrid retransmission-based error control

IEEE Transactions on Communications

Volumn 57, Issue 7, 2009, Pages 1959-1971

  Badia, Leonardo ^a   Levorato, Marco ^b   Zorzi, Michele ^b  

^a IMT SCHOOL FOR ADVANCED STUDIES LUCCA   (Italy)

^b UNIVERSITY OF PADOVA   (Italy)

Author keywords

Automatic repeat request; Channel coding; Communication channels; Error correction; Forward error correction; Markov processes

Indexed keywords

AUTOMATIC REPEAT REQUEST; CHANNEL ERROR; CHANNEL MODEL; CHANNEL PARAMETER; CHANNEL REALIZATIONS; CHANNEL REPRESENTATION; CHANNEL STATE; CODEWORD; CODING PERFORMANCE; COMMUNICATION CHANNELS; DATA CODING; EFFICIENT CHANNELS; ERROR CONTROL; ERROR PROBABILITIES; FINITE-STATE; HYBRID AUTOMATIC REPEAT REQUEST; INCREMENTAL REDUNDANCY; MARKOV MODEL; NOVEL METHODS; PERFORMANCE EVALUATION; RETRANSMISSIONS; TIME KEEPING; TRANSMITTING PARTS; ZERO IF;

CELLULAR RADIO SYSTEMS; CHANNEL CODING; CODING ERRORS; COMPUTATIONAL COMPLEXITY; MARKOV PROCESSES; PROBABILITY;

FORWARD ERROR CORRECTION;

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

References (37)

1. S. Lin, D. J. Costello, and M. J. Miller, "Automatic-Repeat-reQuest error control schemes," IEEE Commun. Mag., vol. 22, no. 12, pp. 5-17, Dec. 1984.
2. S. Kallel, "Complementary punctured convolutional (CPC) codes and their applications," IEEE Trans. Commun., vol. 43, no. 6, pp. 2005-2009, June 1995.
3. I. Sason and S. Shamai, "On improved bounds on the decoding error probability of block codes over interleaved fading channels, with applications to turbo-like codes," IEEE Trans. Inform. Theory, vol. 47, no. 6, pp. 2275-2299, Sept. 2001.
4. D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inform. Theory, vol. 45, no. 2, pp. 399-431, Mar. 1999.
5. C. Berrou and A. Glavieux, "Near optimum error correcting coding and decoding: Turbo codes," IEEE Trans. Commun., vol. 44, no. 10, pp. 1261-1271, Oct. 1996.
6. D. J. C. MacKay and R. M. Neal, "Near Shannon limit performance of low density parity check codes," IEE Electron. Lett., vol. 33, no. 6, pp. 457-458, May 1993.
7. R. Liu, P. Spasojevic, and E. Soljanin, "Reliable channel regions for good binary codes transmitted over parallel channels," IEEE Trans. Inform. Theory, vol. 52, no. 4, pp. 1405-1424, Apr. 2006.
8. S. Litsyn and V. Shevelev, "On ensembles of low-density parity-check codes: Asymptotic distance distributions," IEEE Trans. Inform. Theory, vol. 48, no. 4, pp. 887-907, Apr. 2002.
9. I. Sason, E. Telatar, and R. Urbanke, "On the asymptotic input-output weight distributions and thresholds of convolutional and turbo-like encoders," IEEE Trans. Inform. Theory, vol. 48, no. 12, pp. 3052-3061, Dec. 2002.
10. H. Jin and R. J. McEliece, "Coding theorems for turbo code ensembles," IEEE Trans. Inform. Theory, vol. 48, no. 6, pp. 1451-1461, June 2002.
11. I. Sason, S. Shamai, and D. Divsalar, "Tight exponential upper bounds on the ML decoding error probability of block codes over fully interleaved fading channels," IEEE Trans. Commun., vol. 51, no. 8, pp. 1296-1305, Aug. 2003.
12. I. Sason and S. Shamai, "Improved upper bounds on the ML decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum," IEEE Trans. Inform. Theory, vol. 46, no. 1, pp. 24-47, Jan. 2000.
13. I. Sason and S. Shamai, Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial, ser. Foundations and Trends in Communications and Information Theory. Delft, the Netherlands: NOW Publishers, 2006, vol. 3, no. 1-2.
14. L. Bazzi, T. J. Richardson, and R. Urbanke, "Exact thresholds and optimal codes for the binary-symmetric channel and Gallager's decodin algorithm A," IEEE Trans. Inform. Theory, vol. 50, no. 9, pp. 2010-2021, Sept. 2004.
15. T. J. Richardson and R. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
16. A. W. Eckford, F. R. Kschischang, and S. Pasupathy, "Analysis of low-density parity-check codes for the Gilbert-Elliott channel," IEEE Trans. Inform. Theory, vol. 51, no. 11, pp. 3872-3889, Nov. 2005.
17. A. W. Eckford, F. R. Kschischang, and S. Pasupathy, "On designing good LDPC codes for Markov channels," IEEE Trans. Inform. Theory, vol. 53, no. 1, pp. 5-21, Jan. 2007.
18. O. F. Acikel and W. E. Ryan, "Punctured turbo-codes for BPSK/QPSK channels," IEEE Trans. Commun., vol. 47, no. 9, pp. 1315-1323, Sept. 1999.
19. B. Shen, A. Patapoutian, and P. A. McEwen, "Punctured recursive convolutional encoders and their applications in turbo codes," IEEE Trans. Inform. Theory, vol. 47, no. 6, pp. 2300-2320, Sept. 2001.
20. F. Babich, G. Montorsi, and F. Vatta, Some notes on rate-compatible punctured turbo codes (RCPTC) Design, IEEE Transactions on Communications, 2004, 52, 5, 681-684, DOI:10.1109/TCOMM.2004.826237
21. K. R. Narayanan and G. L. Stüber, "A novel ARQ technique using the turbo coding principle," IEEE Commun. Lett., vol. 1, pp. 49-51, Mar. 1997.
22. S. Sesia, G. Caire, and G. Vivier, "Incremental redundancy hybrid ARQ schemes based on low-density parity-check codes," IEEE Trans. Commun., vol. 52, no. 8, pp. 1311-1321, Aug. 2004.
23. I. Sason and I. Goldenberg, "Coding for parallel channels: Gallager bounds for binary linear codes with applications to turbo-like codes," IEEE Trans. Inform. Theory, vol. 53, no. 7, pp. 2394-2428, July 2007.
24. Q. Zhang, T. F. Wong, and S. Lehnert, "Performance of a type-II hybrid ARQ protocol in slotted DS-SSMA packet radio systems," IEEE Trans. Commun., vol. 47, no. 2, pp. 281-290, Feb. 1999.
25. S. Kallel, R. Link, and S. Bakhtiyari, "Throughput performance of memory ARQ scheme," IEEE Trans. Veh. Technol., vol. 48, no. 3, pp. 891-899, May 1999.
26. G. Caire and D. Tuninetti, "The throughput of hybrid-ARQ protocols for the Gaussian collision channel," IEEE Trans. Inform. Theory, vol. 47, no. 5, pp. 1971-1988, July 2001.
27. Q. Zhang and S. A. Kassam, "Hybrid ARQ with selective combining for fading channel," IEEE J. Select. Areas Commun., vol. 17, no. 5, pp. 867-880, May 1999.
28. C. H. C. Leung, Y. Kikumoto, and S. A. Sorensen, "The throughput efficiency of the go-back-N ARQ scheme under Markov and related error structures," IEEE Trans. Commun., vol. 36, no. 2, pp. 231-234, Feb. 1988.
29. Q. Zhang and S. A. Kassam, "Finite-state Markov model for Rayleigh fading channels," IEEE Trans. Commun., vol. 47, no. 11, pp. 1688-1692, Nov. 1999.
30. C. C. Tan and N. C. Beaulieu, "On first-order Markov modeling for the Rayleigh fading channel," IEEE Trans. Commun., vol. 48, no. 12, pp. 2032-2040, Dec. 2000.
31. M. Rossi, L. Badia, and M. Zorzi, "SR ARQ delay statistics on N-state Markov channels with non-instantaneous feedback," IEEE Trans. Wireless Commun., vol. 5, no. 6, pp. 1526-1536, June 2006.
32. A. Guillen i Fabregas and G. Caire, "Coded modulation in the block-fading channel: Coding theorems and code construction," IEEE Trans. Inform. Theory, vol. 52, no. 1, pp. 91-114, Jan. 2006.
33. W. Vijacksungsithi and K. Winick, "Joint channel-state estimation and decoding of low-density parity-check codes on the two-state noiseless/useless BSC block interference channel," IEEE Trans. Commun., vol. 53, no. 4, pp. 612-622, Apr. 2005.
34. D. Garg and F. Adachi, "Rate compatible punctured turbo-coded hybrid ARQ for OFDM in a frequency selective fading channel," in Proc. IEEE VTC - Spring, Apr. 2003, vol. 4, pp. 2725-2729.
35. L. Badia, M. Rossi, and M. Zorzi, "SR ARQ packet delay statistics on Markov channels in the presence of variable arrival rate," IEEE Trans. Wireless Commun., vol. 5, no. 7, pp. 1639-1644, July 2006.
36. E. Soljanin, N. Varnica, and P. Whiting, "Punctured vs rateless codes for hybrid ARQ," in Proc. IEEE Information Theory Workshop, 2006, pp. 155-159.
37. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: John Wiley & Sons, Inc., 1991.