메뉴 건너뛰기




Volumn 26, Issue 5, 1980, Pages 540-547

Viterbi Decoding Algorithm for Convolutional Codes with Repeat Request

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC;

EID: 0019055467     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1980.1056245     Document Type: Article
Times cited : (85)

References (12)
  • 1
    • 84935113569 scopus 로고
    • Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
    • Apr.
    • A. J. Viterbi, “Error bounds for convolutional codes and an asvmutoticallv ootimum decoding algorithm,” IEEE Trans. Inform. Theory, vol IT-13, no. 2, pp. 260-269, Apr. 1967.
    • (1967) IEEE Trans. Inform. Theory , vol.IT-13 , Issue.2 , pp. 260-269
    • Viterbi, A.J.1
  • 2
    • 0015943124 scopus 로고
    • Convolutional codes II: Maximum likelihood decoding
    • July
    • G. D. Forney, Jr., “Convolutional codes II: Maximum likelihood decoding,” Inform. Control, vol. 25, pp. 222–266, July 1974.
    • (1967) Inform. Control , vol.25 , pp. 222-266
    • Forney, G.D.1
  • 3
    • 58149398127 scopus 로고
    • On the Viterbi decoding algorithm
    • Jan.
    • J. K. Omura, “On the Viterbi decoding algorithm,” IEEE Trans. Inform. Theory, vol. IT-15, no. 1, pp. 177–179, Jan. 1969.
    • (1969) IEEE Trans. Inform. Theory , vol.IT-15 , Issue.1 , pp. 177-179
    • Omura, J.K.1
  • 4
    • 0015143526 scopus 로고
    • Convolutional codes and their performance in communication systems
    • Oct.
    • A. J. Viterbi, “Convolutional codes and their performance in communication systems,” IEEE Trans. Commun. Technol., vol. COM-19, no. 5, pp. 751–772, Oct. 1971.
    • (1971) IEEE Trans. Commun. Technol , vol.COM-19 , Issue.5 , pp. 751-772
    • Viterbi, A.J.1
  • 5
    • 0015142169 scopus 로고
    • Viterbi decoding for satellite and space communication
    • Oct.
    • J. A. Heller and I. M. Jacobs, “Viterbi decoding for satellite and space communication,” IEEE Trans. Commun. Technol., vol. COM-19, no. 5, pp. 835–848, Oct. 1971.
    • (1971) IEEE Trans. Commun. Technol , vol.COM-19 , Issue.5 , pp. 835-848
    • Heller, J.A.1    Jacobs, I.M.2
  • 6
    • 0015022927 scopus 로고
    • Lower bounds on reliability functions of variable-length length nonsystematic convolutional codes for channels with noise less feedback
    • Mar.
    • R. J. Fang, “Lower bounds on reliability functions of variable-length length nonsystematic convolutional codes for channels with noise less feedback,” IEEE Trans. Inform. Theory, vol. IT-17, no. 2, pp. 161–171, Mar. 1971.
    • (1971) IEEE Trans. Inform. Theory , vol.IT-17 , Issue.2 , pp. 161-171
    • Fang, R.J.1
  • 9
    • 84934904905 scopus 로고
    • Exponential error bound for erasure, list, and decision feedback scheme
    • Mar.
    • G. D. Forney, “Exponential error bound for erasure, list, and decision feedback scheme,” IEEE Trans. Inform. Theory, vol. IT-14, no. 2, 206–220, Mar. 1968.
    • (1968) IEEE Trans. Inform. Theory , vol.2 , pp. 206-220
    • Forney, G.D.1
  • 11
    • 0003769249 scopus 로고
    • Short convolutional codes with maximal free distance for rates 1/2, 1/3, and 1/4
    • May
    • K. J. Larsen, “Short convolutional codes with maximal free distance for rates 1/2, 1/3, and 1/4,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 371–372, May 1973.
    • (1973) IEEE Trans. Inform. Theory , vol.IT-19 , pp. 371-372
    • Larsen, K.J.1
  • 12
    • 0017496510 scopus 로고
    • Truncation error probability in Viterbi decoding
    • May
    • F. Hemmati and D. J. Costello, Jr., “Truncation error probability in Viterbi decoding,” IEEE Trans. Commun. Technol., vol. COM-25, 25, pp. 530–532, May 1977.
    • (1977) IEEE Trans. Commun. Technol , vol.COM-25 , Issue.25 , pp. 530-532
    • Hemmati, F.1    Costello, D.J.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.