메뉴 건너뛰기




Volumn 3, Issue , 2004, Pages 1607-1610

Code-matched interleaver for turbo codes

Author keywords

Code Matched interleaver; Turbo codes

Indexed keywords

ALGORITHMS; BIT ERROR RATE; ERROR CORRECTION; FEEDBACK; MATHEMATICAL MODELS; MATRIX ALGEBRA; POLYNOMIALS; SIGNAL ENCODING;

EID: 4544379598     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Conference Paper
Times cited : (1)

References (9)
  • 1
    • 0027297425 scopus 로고
    • Near Shannon limit error-correcting coding and decoding: Turbo-codes(1)
    • May
    • C.Berrou, A.Glavieux, and P.Thitimajshima, "Near Shannon limit error-correcting coding and decoding: Turbo-codes(1)," in Proc.ICC'93, May 1993,pp.1064-1070.
    • (1993) Proc.ICC'93 , pp. 1064-1070
    • Berrou, C.1    Glavieux, A.2    Thitimajshima, P.3
  • 2
    • 0032658865 scopus 로고    scopus 로고
    • Combined turbo codes and interleaver design
    • Apr.
    • J.Yuan, B.Vucetic, and W.Feng, "Combined turbo codes and interleaver design," IEEE Trans.Commun.,vol.47,pp.484-487,Apr. 1999.
    • (1999) IEEE Trans.Commun. , vol.47 , pp. 484-487
    • Yuan, J.1    Vucetic, B.2    Feng, W.3
  • 3
    • 0036602281 scopus 로고    scopus 로고
    • A code-matched interleaver design for turbo codes
    • June
    • W.Feng, J.Yuan, B.Vucetic, "A code-matched interleaver design for turbo codes," IEEE Trans. Commun.,vol.50,pp.926-937,June.2002.
    • (2002) IEEE Trans. Commun. , vol.50 , pp. 926-937
    • Feng, W.1    Yuan, J.2    Vucetic, B.3
  • 5
    • 0016037512 scopus 로고
    • Optimal decoding of linear codes for minimizing symbol error rate
    • L.R.Bahl, J.Cocke, F.Jelink, and J.Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans.Inform.Theory, vol.20, pp.284-287, 1974.
    • (1974) IEEE Trans.Inform.Theory , vol.20 , pp. 284-287
    • Bahl, L.R.1    Cocke, J.2    Jelink, F.3    Raviv, J.4
  • 6
    • 0030106621 scopus 로고    scopus 로고
    • Unveiling turbo codes: Some results on parallel concatenated coding schemes
    • Mar.
    • S.Benedetto and G.Montorsi, "Unveiling turbo codes: some results on parallel concatenated coding schemes," IEEE Trans.Inform.Theory, vol.42,pp.409-428,Mar.1996
    • (1996) IEEE Trans.Inform.Theory , vol.42 , pp. 409-428
    • Benedetto, S.1    Montorsi, G.2
  • 7
    • 0030141796 scopus 로고    scopus 로고
    • Design of parallel concatenated convolutional codes
    • May
    • S.Benedetto and G.Montorsi, "Design of parallel concatenated convolutional codes," IEEE Trans.Commun., vol.42, no. 5, pp.591-600,May1996
    • (1996) IEEE Trans.Commun. , vol.42 , Issue.5 , pp. 591-600
    • Benedetto, S.1    Montorsi, G.2
  • 8
    • 0003189118 scopus 로고
    • Illuminating the structure of parallel concatenated recursive systematic (turbo) codes
    • San Francisco, CA, November
    • P. Robertson, "Illuminating the structure of parallel concatenated recursive systematic (turbo) codes," Proc.GLOBECOM'94 San Francisco, CA, vol. 3, pp.1298-1303, November 1994.
    • (1994) Proc.GLOBECOM'94 , vol.3 , pp. 1298-1303
    • Robertson, P.1
  • 9
    • 0029234412 scopus 로고
    • A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain
    • Seattle, Washington, June
    • P. Robertson, E. Villebrun, and P. Hoeher, "A Comparison of Optimal and Sub-Optimal MAP Decoding Algorithms Operating in the Log Domain," Proc. ICC'95, Seattle, Washington, vol. 2, pp. 1009-1013, June 1995.
    • (1995) Proc. ICC'95 , vol.2 , pp. 1009-1013
    • Robertson, P.1    Villebrun, E.2    Hoeher, P.3


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