메뉴 건너뛰기




Volumn 57, Issue 6, 2009, Pages 1550-1555

Error rate estimation of low-density parity-check codes on binary symmetric channels using cycle enumeration

Author keywords

Binary symmetric channels (BSC); Error floor; Error rate estimation of finite length LDPC codes; Finite length LDPC codes; Hard decision decoding algorithms; Iterative decoding; Low density parity check (LDPC) codes; Tanner graph cycles

Indexed keywords

BINARY SYMMETRIC CHANNELS (BSC); ERROR FLOOR; ERROR RATE ESTIMATION OF FINITE-LENGTH LDPC CODES; FINITE-LENGTH LDPC CODES; HARD-DECISION DECODING ALGORITHMS; LOW-DENSITY PARITY-CHECK (LDPC) CODES; TANNER GRAPH CYCLES;

EID: 67650679264     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2009.06.070048     Document Type: Article
Times cited : (35)

References (13)
  • 2
    • 0035246307 scopus 로고    scopus 로고
    • The capacity of low-density parity-check codes under message-passing decoding
    • Feb
    • T. J. Richardson and R. 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.2
  • 3
    • 4544245136 scopus 로고    scopus 로고
    • Exact threshold and optimal codes for the binary-symmetric channel and Gallager's decoding algorithm A
    • Sept
    • L. Bazzi, T. J. Richardson, and R. L. Urbanke, "Exact threshold 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.J.2    Urbanke, R.L.3
  • 4
    • 17644403502 scopus 로고    scopus 로고
    • Improved bit-flipping decoding of low-density parity-check codes
    • Apr
    • N. Miladinovic and M. P. C. Fossorier, "Improved bit-flipping decoding of low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 51, no. 4, pp. 1594-1606, Apr. 2005.
    • (2005) IEEE Trans. Inform. Theory , vol.51 , Issue.4 , pp. 1594-1606
    • Miladinovic, N.1    Fossorier, M.P.C.2
  • 5
    • 11844276630 scopus 로고    scopus 로고
    • Threshold values and convergence properties of majority-based algorithms for decoding regular low-density parity-check codes
    • Dec
    • P. Zarrinkhat and A. H. Banihashemi, "Threshold values and convergence properties of majority-based algorithms for decoding regular low-density parity-check codes," IEEE Trans. Commun., vol. 52, pp. 2087-2097, Dec. 2004.
    • (2004) IEEE Trans. Commun , vol.52 , pp. 2087-2097
    • Zarrinkhat, P.1    Banihashemi, A.H.2
  • 8
    • 77950207102 scopus 로고    scopus 로고
    • A general method for finding low error rates of LDPC codes
    • to be published
    • C. A. Cole, S. G. Wilson, E. K. Hall, and T. R. Giallorenzi, "A general method for finding low error rates of LDPC codes," to be published.
    • Cole, C.A.1    Wilson, S.G.2    Hall, E.K.3    Giallorenzi, T.R.4
  • 11
    • 51649131595 scopus 로고    scopus 로고
    • Estimation of bit and frame error rates of low-density parity-check codes on binary symmetric channels
    • Dec
    • H. Xiao and A. H. Banihashemi, "Estimation of bit and frame error rates of low-density parity-check codes on binary symmetric channels," IEEE Trans. Commun, vol. 55, pp. 2234-2239, Dec. 2007.
    • (2007) IEEE Trans. Commun , vol.55 , pp. 2234-2239
    • Xiao, H.1    Banihashemi, A.H.2
  • 12
    • 67650697833 scopus 로고    scopus 로고
    • Available
    • [Online]. Available: http://www.inference.phy.cam.ac.uk/mackay/codes/ data.html
  • 13
    • 12544253129 scopus 로고    scopus 로고
    • Regular and irregular progressive edge-growth Tanner graph
    • Jan
    • X.-Y. Hu, E. Eleftheriou, and D.-M Arnold, "Regular and irregular progressive edge-growth Tanner graph," IEEE Trans. Inform. Theory vol. 51, pp. 386-398, Jan. 2005.
    • (2005) IEEE Trans. Inform. Theory , vol.51 , pp. 386-398
    • Hu, X.-Y.1    Eleftheriou, E.2    Arnold, D.-M.3


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