메뉴 건너뛰기




Volumn 46, Issue 6, 2000, Pages 1988-2006

New deterministic interleaver designs for turbo codes

Author keywords

[No Author keywords available]

Indexed keywords

DETERMINISTIC INTERLEAVERS; TURBO CODES;

EID: 0034270950     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.868474     Document Type: Article
Times cited : (103)

References (31)
  • 2
    • 0030106621 scopus 로고    scopus 로고
    • Unveiling turbo codes: Some results on parallel concatenated coding schemes
    • vol. 42, pp. 40928, Mar. 1996.
    • S. Benedetto and G. Montorsi, Unveiling turbo codes: Some results on parallel concatenated coding schemes, IEEE Trans. Inform. Theory, vol. 42, pp. 40928, Mar. 1996.
    • IEEE Trans. Inform. Theory
    • Benedetto, S.1    Montorsi, G.2
  • 3
    • 0003189118 scopus 로고    scopus 로고
    • Illuminating the structure of code and decoder of parallel concatenated recursive systematic (turbo) codes," in
    • 1994, pp. 1298-1303.
    • P. Robertson, Illuminating the structure of code and decoder of parallel concatenated recursive systematic (turbo) codes," in Proc. IEEE Globecom Conf., Dec. 1994, pp. 1298-1303.
    • Proc. IEEE Globecom Conf., Dec.
    • Robertson, P.1
  • 7
    • 0028699958 scopus 로고    scopus 로고
    • Decoding Turbo'-codes with the soft output Viterbi algorithm," in
    • 1994 IEEE Int. Symp. Information Theory, June 1994, p. 164.
    • J. Hagenauer and L. Papke, Decoding Turbo'-codes with the soft output Viterbi algorithm," in Proc. 1994 IEEE Int. Symp. Information Theory, June 1994, p. 164.
    • Proc.
    • Hagenauer, J.1    Papke, L.2
  • 9
    • 0028333319 scopus 로고    scopus 로고
    • Performance evaluation of turbo codes for short frame transmission systems
    • vol. 30, no. 2, pp. 111-113, Jan. 1994.
    • P. Jung and M. Naßhan, Performance evaluation of turbo codes for short frame transmission systems, Electron. Lett., vol. 30, no. 2, pp. 111-113, Jan. 1994.
    • Electron. Lett.
    • Jung, P.1    Naßhan, M.2
  • 10
    • 0028768729 scopus 로고    scopus 로고
    • Interleaver design for turbo codes
    • vol. 30, no. 25, pp. 2107-2108, Dec. 1994.
    • A. S. Barbulescu and S. S. Pietrobon, Interleaver design for turbo codes, Electron. Lett., vol. 30, no. 25, pp. 2107-2108, Dec. 1994.
    • Electron. Lett.
    • Barbulescu, A.S.1    Pietrobon, S.S.2
  • 13
    • 84866829515 scopus 로고    scopus 로고
    • On design of interleavers of turbo codes," in
    • 31st Annu. Conf. Information Sciences and Systems, Mar. 1997, pp. 509-514.
    • F. Daneshgaran and M. Mondin, On design of interleavers of turbo codes," in Proc. 31st Annu. Conf. Information Sciences and Systems, Mar. 1997, pp. 509-514.
    • Proc.
    • Daneshgaran, F.1    Mondin, M.2
  • 14
    • 0032495307 scopus 로고    scopus 로고
    • Design of the turbo-code interleaver using Hungarian method
    • vol. 34, no. 1, pp. 63-65, Jan. 1998.
    • A. K. Khandani, Design of the turbo-code interleaver using Hungarian method, Electron. Lett., vol. 34, no. 1, pp. 63-65, Jan. 1998.
    • Electron. Lett.
    • Khandani, A.K.1
  • 16
    • 0000962112 scopus 로고    scopus 로고
    • Interleaver design methods for turbo codes," in
    • 1988 IEEE Int. Symp. Information Theory. Cambridge, MA, Aug. 1998, p. 420.
    • K. S. Andrews, C. Heegard, and D. Kozen, Interleaver design methods for turbo codes," in Proc. 1988 IEEE Int. Symp. Information Theory. Cambridge, MA, Aug. 1998, p. 420.
    • Proc.
    • Andrews, K.S.1    Heegard, C.2    Kozen, D.3
  • 18
    • 0028498976 scopus 로고    scopus 로고
    • Class of algebraically constructed permutations for use in pseudorandom interleavers
    • vol. 30, no. 17, pp. 1378-1379, Aug. 1994.
    • S. V. Marie, Class of algebraically constructed permutations for use in pseudorandom interleavers, Electron. Lett., vol. 30, no. 17, pp. 1378-1379, Aug. 1994.
    • Electron. Lett.
    • Marie, S.V.1
  • 20
    • 84866836027 scopus 로고    scopus 로고
    • Realization of permutations with minimal delay with applications to turbo coding," in
    • 1996 IEEE Int. Symp. Information Theory and Its Applications (ISITA '96), Victoria, B.C., Canada, Sept. 1996, pp. 590-593.
    • F. Daneshgaran and M. Mondin, Realization of permutations with minimal delay with applications to turbo coding," in Proc. 1996 IEEE Int. Symp. Information Theory and Its Applications (ISITA '96), Victoria, B.C., Canada, Sept. 1996, pp. 590-593.
    • Proc.
    • Daneshgaran, F.1    Mondin, M.2
  • 23
    • 0030086134 scopus 로고    scopus 로고
    • Effective free distance of turbo codes
    • vol. 32, no. 5, pp. 445146, Feb. 1996.
    • D. Divsalar and R. J. McEliece, Effective free distance of turbo codes, Electron. Lett., vol. 32, no. 5, pp. 445146, Feb. 1996.
    • Electron. Lett.
    • Divsalar, D.1    McEliece, R.J.2
  • 24
    • 0030141796 scopus 로고    scopus 로고
    • Design of parallel concatenated convolutional codes
    • vol. 44, pp. 591-600, May 1996.
    • S. Benedetto and G. Montorsi, Design of parallel concatenated convolutional codes, IEEE Trans. Commun., vol. 44, pp. 591-600, May 1996.
    • IEEE Trans. Commun.
    • Benedetto, S.1    Montorsi, G.2
  • 27
    • 0030659872 scopus 로고    scopus 로고
    • Multilevel turbo coding with a short latency," in
    • 1997 IEEE Int. Symp. Information Theory, Ulm, Germany, June 1997, p. 112.
    • H. Herzberg, Multilevel turbo coding with a short latency," in Proc. 1997 IEEE Int. Symp. Information Theory, Ulm, Germany, June 1997, p. 112.
    • Proc.
    • Herzberg, H.1
  • 28
    • 0029636143 scopus 로고    scopus 로고
    • Terminating the trellis of turbo codes in the same state
    • vol. 31, no. 1, pp. 22-23, Jan. 1995.
    • A. Barbulescu and S. Pietrobon, Terminating the trellis of turbo codes in the same state, Electron. Lett., vol. 31, no. 1, pp. 22-23, Jan. 1995.
    • Electron. Lett.
    • Barbulescu, A.1    Pietrobon, S.2
  • 29
    • 84866826818 scopus 로고    scopus 로고
    • A new block helical interleaver," in
    • 92, San Diego, CA, Nov. 1992, pp. 799-804.
    • D. Ci, A new block helical interleaver," in Proc. MILCOM'92, San Diego, CA, Nov. 1992, pp. 799-804.
    • Proc. MILCOM'
    • Ci, D.1
  • 31
    • 84890349879 scopus 로고    scopus 로고
    • Iterative interleaver growth algorithms of polynomial complexity for turbo codes," in
    • 1998 IEEE Int. Symp. Information Theory. Cambridge, MA, Aug. 1998, p. 418.
    • F. Daneshgaran and M. Mondin, Iterative interleaver growth algorithms of polynomial complexity for turbo codes," in Proc. 1998 IEEE Int. Symp. Information Theory. Cambridge, MA, Aug. 1998, p. 418.
    • Proc.
    • Daneshgaran, F.1    Mondin, M.2


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