Sequential Decoding with ARQ and Code Combining: A Robust Hybrid FEC/ARQ System

IEEE Transactions on Communications

Volumn 36, Issue 7, 1988, Pages 773-780

  Kallel, Samir ^a   Haccoun, David ^a  

^a ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY -- COMMUNICATION CHANNELS; PROBABILITY;

AUTOMATIC-REPEAT-REQUEST (ARQ); ERROR PROBABILITY; FORWARD ERROR CORRECTION (FEC); SEQUENTIAL DECODING;

CODES, SYMBOLIC;

EID: 0024038421     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/26.2805     Document Type: Article

References (17)

1. D. Chase, P. D. Mullers, and J. K. Wolf, “Application of code combining to a selective-repeat ARQ link,” in Proc. MILCOM' 85, Conf'. Rec., vol. 1, 1985, pp. 247-252.
2. D. Chase, “Code combining: A maximum-likelihood decoding approach for combining an arbitrary number of noisy packets,” IEEE Trans. Commun., vol. COM-33, pp. 385-393, May 1985.
3. C. Lau and C. Leung, “Performance analysis of a memory ARQ scheme with soft decision detectors,” IEEE Trans. Commun., vol. COM-34, pp. 827-832, Aug. 1986.
4. P. S. Sindhu, “Retransmission error control with memory,” IEEE Trans. Commun., vol. COM-25, pp. 473-479, May 1977.
5. N. Shacham, “Performance of ARQ with sequential decoding over one-hop and two-hop radio links,” IEEE Trans. Commun., vol. COM-31, pp. 1172-1180, Oct. 1983.
6. —, “ARQ with sequential decoding of packetized data: Queuing analysis,” IEEE Trans. Commun., vol. COM-32, pp. 1118-1127, Oct. 1984.
7. A. Drukarev and D. J. Costello, Jr., “Hybrid ARQ error control using sequential decoding,” IEEE Trans. Inform. Theory, vol. IT-29, pp. 521-535, July 1983.
8. P. Y. Pau and D. Haccoun, “An analysis of sequential decoding with retransmission procedures,” Ecole Polytechnique de Montreal, Tech. Rep. EMP/RT-85-19, Montreal, P.Q., Canada, May 1985.
9. V. K. Bhargava, D. Haccoun, R. Matyas, and P. Nuspl, Digital Communication by Satellite. New York: Wiley, 1981.
10. R. M. Fano, “A heuristic discussion of probabilistic decoding,” IEEE Trans. Inform. Theory, vol. IT-9, pp. 64-73, 1963.
11. F. Jelinek, “Fast sequential decoding using a stack,” IBM J. Res. Develop., vol. 13, pp. 675-685, Nov. 1969.
12. G. D. Forney, “Convolutional codes, HI: Sequential decoding,” Inform. Contr., vol. 25, pp. 267-297, July 1974.
13. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
14. I. M. Jacobs and E. R. Berlekamp, “A lower bound to the distribution of computation for sequential decoding,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 167-174, Apr. 1967.
15. S. Lin and D. J. Costello, Jr., Error Control Coding: Fundamentals and Applications, Englewood Cliffs, NJ: Prentice-Hall, 1983.
16. R. Johannesson, “Robustly optimal rate one-half binary convolutional codes,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 464-468, July 1975.
17. A. J. Viterbi and J. K. Omura, Principles of Digital Communication and Coding. New York: McGraw-Hill, 1979.