메뉴 건너뛰기




Volumn , Issue , 2006, Pages

Irregular designs for two-state systematic with serial concatenated parity codes

Author keywords

[No Author keywords available]

Indexed keywords

BIT ERROR RATE; CHANNEL CAPACITY; COMPUTATIONAL COMPLEXITY; ERROR ANALYSIS; PROBABILITY DISTRIBUTIONS;

EID: 35148828573     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MILCOM.2006.302447     Document Type: Conference Paper
Times cited : (5)

References (15)
  • 2
    • 33847356704 scopus 로고    scopus 로고
    • A new class turbo-like codes with desirable practical properties
    • Capri Island, May, recent results session
    • K. M. Chugg, "A new class turbo-like codes with desirable practical properties," in IEEE Communication Theory Workshop (no proceedings), Capri Island, May 2004, (recent results session).
    • (2004) IEEE Communication Theory Workshop (no proceedings)
    • Chugg, K.M.1
  • 3
    • 33847359192 scopus 로고    scopus 로고
    • A new class of turbo-like codes with universally good performance and high-speed decoding
    • Atlantic City, NJ, October
    • K. M. Chugg, P. Thiennviboon, G. D. Dimou, P. Gray, and J. Melzer, "A new class of turbo-like codes with universally good performance and high-speed decoding," in Proc. IEEE Military Comm. Conf., Atlantic City, NJ, October 2005.
    • (2005) Proc. IEEE Military Comm. Conf
    • Chugg, K.M.1    Thiennviboon, P.2    Dimou, G.D.3    Gray, P.4    Melzer, J.5
  • 5
    • 84925405668 scopus 로고
    • Low density parity check codes
    • January
    • R. G. Gallager, "Low density parity check codes," IEEE Trans. Information Theory, vol. 8, pp. 21-28, January 1962.
    • (1962) IEEE Trans. Information Theory , vol.8 , pp. 21-28
    • Gallager, R.G.1
  • 8
    • 0035246307 scopus 로고    scopus 로고
    • The capacity of low-density parity-check codes under message-passing decoding
    • Feb
    • T. Richardson and R. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Information Theory, vol. 47, pp. 599-618, Feb. 2001.
    • (2001) IEEE Trans. Information Theory , vol.47 , pp. 599-618
    • Richardson, T.1    Urbanke, R.2
  • 10
    • 0035481826 scopus 로고    scopus 로고
    • Convergence behavior of iteratively decoded parallel concatenated codes
    • October
    • S. ten Brink, "Convergence behavior of iteratively decoded parallel concatenated codes," IEEE Trans. Communications, vol. 49, no. 10, pp. 1727-1737, October 2001.
    • (2001) IEEE Trans. Communications , vol.49 , Issue.10 , pp. 1727-1737
    • ten Brink, S.1
  • 11
    • 18144362520 scopus 로고    scopus 로고
    • Accumulate repeat accumulate codes
    • Dallas, Texas, December
    • A. Abbasfar, D. Divsalar, and K. Yao, "Accumulate repeat accumulate codes," in Proc. Globecom Conf., Dallas, Texas, December 2004, pp. 509-513.
    • (2004) Proc. Globecom Conf , pp. 509-513
    • Abbasfar, A.1    Divsalar, D.2    Yao, K.3
  • 12
    • 12144289422 scopus 로고    scopus 로고
    • Design of serially concatenated systems depending on the block length
    • February
    • M. Tüchler, "Design of serially concatenated systems depending on the block length," IEEE Trans. Communications, vol. 32, pp. 209-218, February 2004.
    • (2004) IEEE Trans. Communications , vol.32 , pp. 209-218
    • Tüchler, M.1
  • 13
    • 0000238336 scopus 로고
    • A simplex method for function minimization
    • J. A. Nelder and R. Mead, "A simplex method for function minimization," Computer Journal, vol. 7, pp. 308-313, 1965.
    • (1965) Computer Journal , vol.7 , pp. 308-313
    • Nelder, J.A.1    Mead, R.2
  • 14
    • 0035246127 scopus 로고    scopus 로고
    • Design of capacity-approaching irregular low-density parity-check codes
    • February
    • T. Richardson, M. Shokrollahi, and R. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Information Theory, vol. 47, no. 2, pp. 619-673, February 2001.
    • (2001) IEEE Trans. Information Theory , vol.47 , Issue.2 , pp. 619-673
    • Richardson, T.1    Shokrollahi, M.2    Urbanke, R.3


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