A new error control scheme for hybrid arq systems

IEEE Transactions on Communications

Volumn 35, Issue 10, 1987, Pages 981-990

  Krishna, Hari ^a   Morgera, Salvatore D ^b  

^a SYRACUSE UNIVERSITY   (United States)

^b MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC - ERROR CORRECTION;

AUTOMATIC REPEAT REQUEST (ARQ); ERROR CONTROL SCHEME; FEEDBACK COMMUNICATION; HYBRID ARQ SYSTEMS; KM CODES;

DIGITAL COMMUNICATION SYSTEMS;

EID: 0023439015     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOM.1987.1096688     Document Type: Article

References (17)

1. W.W. Peterson and E.J. Weldon, Jr., Error Correcting Codes. Cambridge, MA: M.I.T. Press, 1978.
2. S. Lin, D.J. Costello, Jr., and M.J. Miller, “Automatic-repeat-request error-control schemes,” IEEE Commun. Mag., vol. 22, pp. 5–17, Dec. 1984.
3. S. Lin and P.S. Yu, “A hybrid ARQ scheme with parity retransmission for error control of satellite channels,” IEEE Trans. Commun., vol. COM-30, pp. 1701–1719, July 1982.
4. A. R. K. Sastry, “Improving automatic repeat-request (ARQ) performance on satellite channels under high error rate conditions,” IEEE Trans. Commun., vol. COM-23, pp. 436–439, Apr. 1975.
5. S. Lin and D.J. Costello, Jr., Error Control Coding: Fundamentals and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1983.
6. E.Y. Rocher and R.L. Pickholtz, “An analysis of the effectiveness of hybrid transmission schemes,” IBM J. Res. Dev., pp. 426–433, July 1970.
7. P.S. Yu and S. Lin, “An efficient selective-repeat ARQ scheme for satellite channels and its throughput analysis,” IEEE Trans. Commun., vol. COM-29, pp. 353–363, Mar. 1981.
8. ' D.M. Mandelbaum, “Adaptive-feedback coding scheme using incremental redundancy,” IEEE Trans. Inform. Theory, vol. IT-20, pp. 388–389, May 1974.
9. J.J. Metzner, “Improvements in block-retransmission schemes,” IEEE Trans. Commun., vol. COM-27, pp. 525–532, Feb. 1979.
10. Y.M. Wang and S. Lin, “A modified selective-repeat Type-II hybrid ARQ system and its performance analysis,” IEEE Trans. Commun., vol. COM-31, pp. 593–607, May 1983.
11. H. Krishna and S.D. Morgera, “A computational complexity approach to the design of linear codes,” IEEE Trans. Commun., submitted for publication.
12. H.J. Nussbaumer, Fast Fourier Transform and Convolution Algorithms. New York: Springer-Verlag, 1981.
13. H. Krishna, “Computational complexity of bilinear forms-Algebraic coding theory and applications to digital communication systems,” Ph.D. dissertation, Dep. Elec. Eng., Concordia Univ., Montreal, P.Q., Canada, Aug. 1985.
14. T. Kasami, T. Klove, and S. Lin, “Linear block codes for error detection,” IEEE Trans. Inform. Theory, vol. IT-29, pp. 131–136, Jan. 1983.
15. C.W. Therrian and K. Fukunaga, “Properties of separable covariance matrices and their associated Gaussian random processes,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-6, pp. 652–656, Sept. 1984.
16. L.R. Lugand and D.J. Costello, Jr., “A comparison of three hybrid ARQ schemes using convolutional codes on a nonstationary channel,” in Conf. Rec., GLOBECOM′82, Miami, FL, Nov. 29-Dec. 2, 1982, p. C8.4.
17. V.I. Korzhik, “Bounds on undetected error probability and optimum group codes in a channel with feedback,” Radioteckhnika, vol. 1, pp. 27–33, 1965.