메뉴 건너뛰기




Volumn 4, Issue 5, 2005, Pages 2540-2548

Design of fast-prunable S-random interleaves

Author keywords

Interleavers; Iterative decoding; Permutations; Pruning; Turbo codes; Variable length turbo codes

Indexed keywords

INTERLEAVERS; ITERATIVE DECODING; PERMUTATIONS; PRUNING;

EID: 28444489724     PISSN: 15361276     EISSN: None     Source Type: Journal    
DOI: 10.1109/TWC.2005.853836     Document Type: Article
Times cited : (26)

References (10)
  • 1
    • 0027297425 scopus 로고
    • Near Shannon limit errorcorrecting coding and decoding: Turbo codes
    • Geneva, Switzerland
    • C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit errorcorrecting coding and decoding: Turbo codes," in Proc. IEEE Int. Conf. Communications, Geneva, Switzerland, 1993, vol. 2, pp. 1064-1070.
    • (1993) Proc. IEEE Int. Conf. Communications , vol.2 , pp. 1064-1070
    • Berrou, C.1    Glavieux, A.2    Thitimajshima, P.3
  • 4
    • 0033295750 scopus 로고    scopus 로고
    • Semi-random interleaver design criteria
    • Rio de Janeiro, Brazil, Dec.
    • C. Fragouli and R. D. Wesel, "Semi-random interleaver design criteria," in Proc. Communications Theory Symp. Globecom, Rio de Janeiro, Brazil, Dec. 1999, vol. 5, pp. 2352-2356.
    • (1999) Proc. Communications Theory Symp. Globecom , vol.5 , pp. 2352-2356
    • Fragouli, C.1    Wesel, R.D.2
  • 5
    • 0009963339 scopus 로고    scopus 로고
    • New high-spread high-distance interleavers for turbocodes
    • Kingston, ON, Canada, May 28-31
    • S. N. Crozier, "New high-spread high-distance interleavers for turbocodes," in Proc. Biennial Symp. Communications, Kingston, ON, Canada, May 28-31, 2000, pp. 3-7.
    • (2000) Proc. Biennial Symp. Communications , pp. 3-7
    • Crozier, S.N.1
  • 6
    • 0036350695 scopus 로고    scopus 로고
    • Interleaver pruning for construction of variable length turbo codes
    • Lausanne, Switzerland
    • F. Daneshgaran and P. Mulassano, "Interleaver pruning for construction of variable length turbo codes," in Proc. IEEE Int. Symp. Information Theory, Lausanne, Switzerland, 2002, p. 55.
    • (2002) Proc. IEEE Int. Symp. Information Theory , pp. 55
    • Daneshgaran, F.1    Mulassano, P.2
  • 7
    • 0032648305 scopus 로고    scopus 로고
    • On the design of prunable interleavers for turbo codes
    • Jul.
    • M. Eroz and A. R. Hammons, Jr., "On the design of prunable interleavers for turbo codes," in Proc. IEEE 49th Vehicular Technology Conf., Jul. 1999, vol. 2, pp. 1669-1673.
    • (1999) Proc. IEEE 49th Vehicular Technology Conf. , vol.2 , pp. 1669-1673
    • Eroz, M.1    Hammons Jr., A.R.2
  • 10
    • 0035333909 scopus 로고    scopus 로고
    • Computing the free distance of turbo codes and serially concatenated codes with interleavers: Algorithms and applications
    • May
    • R. Garello, P. Pierleoni, and S. Benedetto, "Computing the free distance of turbo codes and serially concatenated codes with interleavers: Algorithms and applications," IEEE J. Sel. Areas Commun., vol. 19, no. 5, pp. 800-812, May 2001.
    • (2001) IEEE J. Sel. Areas Commun. , vol.19 , Issue.5 , pp. 800-812
    • Garello, R.1    Pierleoni, P.2    Benedetto, S.3


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