메뉴 건너뛰기




Volumn 7, Issue 6, 1996, Pages 483-492

Generalized Concatenation of Convolutional Codes

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); DECODING; ITERATIVE METHODS; MATRIX ALGEBRA; SIGNAL ENCODING;

EID: 0030287413     PISSN: 1124318X     EISSN: None     Source Type: Journal    
DOI: 10.1002/ett.4460070603     Document Type: Article
Times cited : (12)

References (15)
  • 2
    • 0027297425 scopus 로고
    • Near shannon limit error-correcting coding and decoding: Turbo-codes(1)
    • May
    • C. Berrou, A. Glavieux, P. Thitimajshima: Near shannon limit error-correcting coding and decoding: turbo-codes(1). "Proc. ICC'93", May 1993, p. 1064-1070,.
    • (1993) Proc. ICC'93 , pp. 1064-1070
    • Berrou, C.1    Glavieux, A.2    Thitimajshima, P.3
  • 3
    • 0014869779 scopus 로고
    • Convolutional codes i: Algebraic structure
    • Nov.
    • G. D. Forney, Jr.: Convolutional codes i: algebraic structure. "IEEE Trans. Inform. Theory", Vol. IT-16, Nov. 1970, p. 720-738.
    • (1970) IEEE Trans. Inform. Theory , vol.IT-16 , pp. 720-738
    • Forney Jr., G.D.1
  • 4
    • 0027634632 scopus 로고
    • A linear algebra approach to minimal convolutional encoders
    • July
    • R. Johannesson, Zhe-xian Wan: A linear algebra approach to minimal convolutional encoders. "IEEE Trans. Inform. Theory", Vol. IT-39, July 1993, p. 1219-1233.
    • (1993) IEEE Trans. Inform. Theory , vol.IT-39 , pp. 1219-1233
    • Johannesson, R.1    Wan, Z.-X.2
  • 6
    • 0242645418 scopus 로고
    • Short unit-memory byte-oriented binary convolutional codes having maximal free distance
    • May
    • Lin-Nan Lee: Short unit-memory byte-oriented binary convolutional codes having maximal free distance. "IEEE Trans. Inform. Theory", Vol. IT-22, May 1976, p. 349-352.
    • (1976) IEEE Trans. Inform. Theory , vol.IT-22 , pp. 349-352
    • Lee, L.-N.1
  • 7
    • 85033760821 scopus 로고
    • The comparison of concatenated constructions with inner convolutional codes for PSK2 and PSK4
    • Crieff (Scotland), Session 2, paper 6
    • V. V. Zyablov, S. A. Shavgulidze: The comparison of concatenated constructions with inner convolutional codes for PSK2 and PSK4. Proc. Intern. Symp. Communication Theory & Application, Crieff (Scotland), 1991, Session 2, paper 6.
    • (1991) Proc. Intern. Symp. Communication Theory & Application
    • Zyablov, V.V.1    Shavgulidze, S.A.2
  • 9
    • 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, May. 1973, p. 371-372.
    • (1973) IEEE Trans. Inform. Theory , vol.IT-19 , pp. 371-372
    • Larsen, K.J.1
  • 10
    • 0020822009 scopus 로고
    • Bounds on distances and error exponents of unit memory codes
    • Sept.
    • C. Thommesen, J. Justesen: Bounds on distances and error exponents of unit memory codes. IEEE Trans. Inform. Theory", Vol. IT-29, Sept. 1983, p. 637-649.
    • (1983) IEEE Trans. Inform. Theory , vol.IT-29 , pp. 637-649
    • Thommesen, C.1    Justesen, J.2
  • 11
    • 0004904063 scopus 로고
    • Concatenated codes with convolutional inner codes
    • Sept.
    • J. Justesen, C. Thommesen, V. Zyablov: Concatenated codes with convolutional inner codes. "IEEE Trans. Inform. Theory", Vol. IT-34, Sept. 1988, p. 1217-1225.
    • (1988) IEEE Trans. Inform. Theory , vol.IT-34 , pp. 1217-1225
    • Justesen, J.1    Thommesen, C.2    Zyablov, V.3
  • 12
    • 0024078806 scopus 로고
    • New short constraint length rate (N- 1)/N punctured convolutional codes for soft-decision Viterbi decoding
    • Sept.
    • K. J. Hole: New short constraint length rate (N-1)/N punctured convolutional codes for soft-decision Viterbi decoding. "IEEE Trans. Inform. Theory", Vol. IT-34, Sept. 1988, p. 1079-1081.
    • (1988) IEEE Trans. Inform. Theory , vol.IT-34 , pp. 1079-1081
    • Hole, K.J.1
  • 13
    • 0027594582 scopus 로고
    • Decoding of M-PSK-multilevel codes
    • May-June
    • T. Woerz, J. Hagenauer: Decoding of M-PSK-multilevel codes. "European Trans. on Telecommunication", Vol. 4, No. 3, May-June 1993, p. 299-308.
    • (1993) European Trans. on Telecommunication , vol.4 , Issue.3 , pp. 299-308
    • Woerz, T.1    Hagenauer, J.2
  • 14
    • 0001138049 scopus 로고
    • A Viterbi Algorithm with soft-decision outputs and its applications
    • Dallas, Texas, Nov.
    • J. Hagenauer, P. Hoeher: A Viterbi Algorithm with soft-decision outputs and its applications. Proc. GLOBECOM '89, Dallas, Texas, Nov. 1989, p. 47.1.1-47.1.7.
    • (1989) Proc. GLOBECOM '89 , pp. 4711-4717
    • Hagenauer, J.1    Hoeher, P.2
  • 15
    • 0016037512 scopus 로고
    • Optimal decoding of linear codes for minimizing symbol error rate
    • Mar.
    • L. R. Bahl, J. Cocke, F. Jelink, J. Raviv: Optimal decoding of linear codes for minimizing symbol error rate. "IEEE Trans. Inform. Theory", Vol. IT-20, Mar. 1974., p. 284-287
    • (1974) IEEE Trans. Inform. Theory , vol.IT-20 , pp. 284-287
    • Bahl, L.R.1    Cocke, J.2    Jelink, F.3    Raviv, J.4


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