A Coded ARQ Scheme with the Generalized Viterbi Algorithm

IEEE Transactions on Information Theory

Volumn 39, Issue 2, 1993, Pages 423-432

  Hashimoto, T ^a  

^a TOKYO DENKI UNIVERSITY   (Japan)

Author keywords

Coded ARQ; convolutional code; hybrid ARQ; Viterbi algorithm

Indexed keywords

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); DECODING;

MEMORYLESS CHANNELS; VITERBI DECODING;

DATA COMMUNICATION SYSTEMS;

EID: 0027553185     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.212273     Document Type: Article

References (9)

1. S. Lin, and D. J. Costello, Jr., Error Control Coding. Englewood Cliffs, NJ: Prentice-Hall, 1983.
2. R. J. F. Fang, “Lower bounds on reliability functions of variable-length nonsystematic convolutional codes for channels with noiseless feedback,” IEEE Trans. Inform. Theory, vol. IT-17, pp. 161–171, 1971.
3. H. Yamamoto and K. Itoh, “Viterbi decoding algorithm for convolutional codes with repeat request,” IEEE Trans. Inform. Theory, vol. IT-26, 540–547, 1980.
4. J. B. Anderson, “Limited search trellis decoding of convolutional codes,” IEEE Trans. Inform. Theory, vol. 35, pp. 944–955, Sept. 1989.
5. T. Hashimoto, “List-type reduced-constraint generalization of the Viterbi algorithm,” IEEE Trans. Inform. Theory, vol. IT-33, pp. 866–876, Nov. 1987.
6. T. Hashimoto, “Joint coding-and-equalization of ISI channels by a generalized Viterbi algorithm,” in Proc. IEEE Int. Symp. Inform. Theory, Kobe, Japan, June 1988.
7. R. Johannesson, “Robustly optimal rate one-half binary convolutional codes,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 464–468, July 1975.
8. T. Aulin, “Asymptotically optimal joint channel equalization, demodulation, and channel decoding with minimal complexity and delay,” presented at 1991 Tirrenia Int. Workshop Digital Commun., Tirrenia, Pisa, Italy, Sept. 1991.
9. B. D. Kudryashov, “Convolutional-block coding in channels with decision feedback,” Probl. Peredach. Inform., vol. 21, no. 1, pp. 17–27, 1985.