메뉴 건너뛰기




Volumn 16, Issue 2, 1998, Pages 175-185

Symbol-by-symbol MAP decoding algorithm for high-rate convolutional codes that use reciprocal dual codes

Author keywords

Convolutional codes; Dual codes; Iterative decoding; MAP decoding; Quasi cyclic block codes; Tail biting convolutional codes; Turbo codes

Indexed keywords

ALGORITHMS; BLOCK CODES; COMPUTATIONAL COMPLEXITY; DECODING; MATHEMATICAL TECHNIQUES;

EID: 0031996372     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/49.661106     Document Type: Article
Times cited : (21)

References (22)
  • 1
    • 0030110651 scopus 로고    scopus 로고
    • Iterative decoding of binary block and convolutional codes
    • J. Hagenauer, E. Offer, and L. Papke, "Iterative decoding of binary block and convolutional codes," IEEE Trans. Inform. Theory, vol. 42, pp. 429-445, 1996.
    • (1996) IEEE Trans. Inform. Theory , vol.42 , pp. 429-445
    • Hagenauer, J.1    Offer, E.2    Papke, L.3
  • 2
    • 0029375853 scopus 로고
    • Source-controlled channel decoding
    • J. Hagenauer, "Source-controlled channel decoding," IEEE Trans. Commun., vol. 43, pp. 2449-2457, 1995.
    • (1995) IEEE Trans. Commun. , vol.43 , pp. 2449-2457
    • Hagenauer, J.1
  • 3
    • 0006436646 scopus 로고
    • Soft is better than hard
    • R. E. Blahut, D. J. Costello, Jr., U. Maurer, and T. Mittelholzer, Eds. Kluwer Academic
    • _, "Soft is better than hard," in Communications and Cryptography - Two Sides of One Tapestry, R. E. Blahut, D. J. Costello, Jr., U. Maurer, and T. Mittelholzer, Eds. Kluwer Academic, 1994, pp. 155-171.
    • (1994) Communications and Cryptography - Two Sides of One Tapestry , pp. 155-171
  • 5
    • 0016998516 scopus 로고
    • An optimum symbol-by-symbol decoding rule for linear codes
    • C. R. P. Hartmann and L. D. Rudolph, "An optimum symbol-by-symbol decoding rule for linear codes," IEEE Trans. Inform. Theory, vol. IT-22, pp. 514-517, 1976.
    • (1976) IEEE Trans. Inform. Theory , vol.IT-22 , pp. 514-517
    • Hartmann, C.R.P.1    Rudolph, L.D.2
  • 8
    • 0029371452 scopus 로고
    • Iterative (turbo) decoding of threshold decodable codes
    • Sept./Oct.
    • S. Riedel and Y. V. Svirid, "Iterative (turbo) decoding of threshold decodable codes," European Trans. Telecommun. (ETT), vol. 6, pp. 527-534, Sept./Oct. 1995.
    • (1995) European Trans. Telecommun. (ETT) , vol.6 , pp. 527-534
    • Riedel, S.1    Svirid, Y.V.2
  • 9
    • 0027297425 scopus 로고
    • Near Shannon limit error-correcting coding and decoding: Turbo-codes
    • Geneva, Switzerland, May
    • C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: Turbo-codes," in Proc. IEEE Int. Conf. Commun. (ICC), Geneva, Switzerland, May 1993, pp. 1064-1070.
    • (1993) Proc. IEEE Int. Conf. Commun. (ICC) , pp. 1064-1070
    • Berrou, C.1    Glavieux, A.2    Thitimajshima, P.3
  • 11
    • 0027634632 scopus 로고
    • A linear algebra approach to minimal convolutional encoders
    • July
    • R. Johannesson and Z. Wan, "A linear algebra approach to minimal convolutional encoders," IEEE Trans. Inform. Theory, vol. 39, pp. 1219-1233, July 1993.
    • (1993) IEEE Trans. Inform. Theory , vol.39 , pp. 1219-1233
    • Johannesson, R.1    Wan, Z.2
  • 14
    • 0016037512 scopus 로고
    • Optimal decoding of linear codes for minimizing symbol error rate
    • Mar.
    • L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans. Inform. Theory, vol. IT-20, pp. 284-287, Mar. 1974.
    • (1974) IEEE Trans. Inform. Theory , vol.IT-20 , pp. 284-287
    • Bahl, L.R.1    Cocke, J.2    Jelinek, F.3    Raviv, J.4
  • 17
    • 0014601369 scopus 로고
    • Some results on quasicyclic codes
    • C. L. Chen and W. W. Peterson, "Some results on quasicyclic codes," Inform. Contr., vol. 15, pp. 407-423, 1969.
    • (1969) Inform. Contr. , vol.15 , pp. 407-423
    • Chen, C.L.1    Peterson, W.W.2
  • 18
    • 0018530717 scopus 로고
    • A connection between block and convolutional codes
    • G. Solomon and C. A. van Tilborg, "A connection between block and convolutional codes," SIAM J. Appl. Math., vol. 37, pp. 358-369, 1979.
    • (1979) SIAM J. Appl. Math. , vol.37 , pp. 358-369
    • Solomon, G.1    Van Tilborg, C.A.2
  • 19
    • 0022665432 scopus 로고
    • On tail biting convolutional codes
    • H. H. Ma and J. K. Wolf, "On tail biting convolutional codes," IEEE Trans. Commun., vol. COM-34, pp. 104-111, 1986.
    • (1986) IEEE Trans. Commun. , vol.COM-34 , pp. 104-111
    • Ma, H.H.1    Wolf, J.K.2
  • 21
    • 0029632376 scopus 로고
    • Average performance of parallel concatenated block codes
    • S. Benedetto and G. Montorsi, "Average performance of parallel concatenated block codes," Electron. Lett., vol. 31, pp. 156-158, 1995.
    • (1995) Electron. Lett. , vol.31 , pp. 156-158
    • Benedetto, S.1    Montorsi, G.2
  • 22
    • 85034472580 scopus 로고    scopus 로고
    • MAP decoding of convolutional codes using reciprocal dual codes
    • to be published
    • S. Riedel, "MAP decoding of convolutional codes using reciprocal dual codes," IEEE Trans. Inform. Theory, to be published.
    • IEEE Trans. Inform. Theory
    • Riedel, S.1


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