메뉴 건너뛰기




Volumn 52, Issue 12, 2004, Pages 2087-2097

Threshold values and convergence properties of majority-based algorithms for decoding regular low-density parity-check codes

Author keywords

Density evolution; Hard decision iterative decoding algorithms; Low density parity check (LDPC) codes; Majority based iterative decoding algorithms; Message passing decoders

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DECODING; ENCODING (SYMBOLS); ERROR ANALYSIS; ITERATIVE METHODS; POLYNOMIALS; PROBABILITY; SPURIOUS SIGNAL NOISE;

EID: 11844276630     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2004.838738     Document Type: Article
Times cited : (32)

References (22)
  • 6
    • 0019608335 scopus 로고
    • "A recursive approach to low complexity codes"
    • Sept
    • R.M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. IT-27, pp. 533-547, Sept. 1981.
    • (1981) IEEE Trans. Inform. Theory , vol.IT-27 , pp. 533-547
    • Tanner, R.M.1
  • 7
    • 0035246307 scopus 로고    scopus 로고
    • "The capacity of low-density parity-check codes under message-passing decoding"
    • Feb
    • T. J. Richardson and R. L. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inform. Theory, vol. 47, pp. 599-618, Feb. 2001.
    • (2001) IEEE Trans. Inform. Theory , vol.47 , pp. 599-618
    • Richardson, T.J.1    Urbanke, R.L.2
  • 8
    • 0034450081 scopus 로고    scopus 로고
    • "Exact thresholds and optimal codes for the binary symmetric channel and Gallager's decoding algorithm A"
    • L. Bazzi, T. Richardson, and R. Urbanke, "Exact thresholds and optimal codes for the binary symmetric channel and Gallager's decoding algorithm A," in Proc. Int. Symp. Information Theory, 2000, p. 203.
    • (2000) Proc. Int. Symp. Information Theory , pp. 203
    • Bazzi, L.1    Richardson, T.2    Urbanke, R.3
  • 9
    • 4544245136 scopus 로고    scopus 로고
    • "Exact thresholds and optimal codes for the binary symmetric channel and Gallager's decoding algorithm A"
    • Sept
    • L. Bazzi, T. Richardson, and R. Urbanke, "Exact thresholds and optimal codes for the binary symmetric channel and Gallager's decoding algorithm A," IEEE Trans. Inform. Theory, vol. 50, pp. 2010-2021, Sept. 2004.
    • (2004) IEEE Trans. Inform. Theory , vol.50 , pp. 2010-2021
    • Bazzi, L.1    Richardson, T.2    Urbanke, R.3
  • 11
    • 0035481826 scopus 로고    scopus 로고
    • "Convergence behavior of iteratively decoded parallel concatenated codes"
    • Oct
    • S. ten Brink, "Convergence behavior of iteratively decoded parallel concatenated codes," IEEE Trans. Commun., vol. 49, pp. 1727-1737, Oct. 2001.
    • (2001) IEEE Trans. Commun. , vol.49 , pp. 1727-1737
    • Ten Brink, S.1
  • 13
    • 0035246127 scopus 로고    scopus 로고
    • "Design of capacity-approaching irregular low-density parity-check codes"
    • Feb
    • T. J. Richardson, M. A. Shokrollahi, and R. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, pp. 619-637, Feb. 2001.
    • (2001) IEEE Trans. Inform. Theory , vol.47 , pp. 619-637
    • Richardson, T.J.1    Shokrollahi, M.A.2    Urbanke, R.3
  • 14
    • 0036160741 scopus 로고    scopus 로고
    • "Bounds on the performance of belief propagation decoding"
    • Jan
    • D. Burshtein and G. Miller, "Bounds on the performance of belief propagation decoding" IEEE Trans. Inform. Theory, vol. 48, pp. 112-122, Jan. 2002.
    • (2002) IEEE Trans. Inform. Theory , vol.48 , pp. 112-122
    • Burshtein, D.1    Miller, G.2
  • 15
    • 11844257194 scopus 로고    scopus 로고
    • A lower bound on the iterative decoding threshold of irregular LDPC code ensembles
    • presented at [CD-ROM]
    • A. Khandekar and R. McEliece. A lower bound on the iterative decoding threshold of irregular LDPC code ensembles. presented at Proc. CISS [CD-ROM]
    • Proc. CISS
    • Khandekar, A.1    McEliece, R.2
  • 17
    • 11844278706 scopus 로고    scopus 로고
    • "On the asymptotic iterative decoding performance of low-density parity-check codes"
    • K. Sh. Zigangirov and M. Lentmaier, "On the asymptotic iterative decoding performance of low-density parity-check codes," in Proc. Int. Symp Turbo Codes, 2000, pp. 39-42.
    • (2000) Proc. Int. Symp Turbo Codes , pp. 39-42
    • Zigangirov, K.Sh.1    Lentmaier, M.2
  • 20
    • 2442485766 scopus 로고    scopus 로고
    • "Hybrid hard-decision iterative decoding of regular low-density parity-check codes"
    • Apr
    • P. Zarrinkhat and A. H. Banihashemi, "Hybrid hard-decision iterative decoding of regular low-density parity-check codes," IEEE Commun. Lett., vol. 8, pp. 250-252, Apr. 2004.
    • (2004) IEEE Commun. Lett. , vol.8 , pp. 250-252
    • Zarrinkhat, P.1    Banihashemi, A.H.2
  • 21
    • 17444369055 scopus 로고    scopus 로고
    • "Time-invariant and switch-type hybrid iterative decoding of low-density parity-check codes"
    • to be publisbed
    • P. Zarrinkhat, A. H. Banihashemi, and H. Xiao, "Time-invariant and switch-type hybrid iterative decoding of low-density parity-check codes," Ann. Télécommun., to be publisbed.
    • Ann. Télécommun.
    • Zarrinkhat, P.1    Banihashemi, A.H.2    Xiao, H.3


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