메뉴 건너뛰기




Volumn 1, Issue , 2004, Pages 489-492

Improved Progressive-Edge-Growth (PEG) construction of irregular LDPC codes

Author keywords

Error Floor; Irregular LDPC Codes; LDPC Codes at Finite Block Lengths; Low Density Parity Check (LDPC) Codes; Near Codewords; Progressive Edge Growth (PEG) Algorithm; Short LDPC Codes; Trapping Sets

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; FUNCTIONS; MATHEMATICAL MODELS; RAYLEIGH FADING; SIGNAL TO NOISE RATIO; SPECTRUM ANALYSIS;

EID: 18144385512     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (14)

References (15)
  • 2
    • 18144416876 scopus 로고    scopus 로고
    • private communication, March
    • X. -Y. Hu, private communication, March 2004.
    • (2004)
    • Hu, X.Y.1
  • 3
    • 0035681297 scopus 로고    scopus 로고
    • Progressive edge-growth Tanner graphs
    • San Antonio, Texas, USA, Nov.
    • X. -Y. Hu, E. Eleftheriou, and D. -M. Arnold, "Progressive edge-growth Tanner graphs," Proc. IEEE GLOBECOM 2001, San Antonio, Texas, USA, pp. 995-1001, Nov. 2001.
    • (2001) Proc. IEEE GLOBECOM 2001 , pp. 995-1001
    • Hu, X.Y.1    Eleftheriou, E.2    Arnold, D.M.3
  • 4
    • 0036353603 scopus 로고    scopus 로고
    • Irregular Progressive Edge-Growth (PEG) tanner graphs
    • Lausanne, Switzerland, June30-July 5
    • X. -Y. Hu, E. Eleftheriou, and D. -M. Arnold, "Irregular Progressive Edge-Growth (PEG) Tanner Graphs," Proc. IEEE ISIT 2002, Lausanne, Switzerland, p. 480, June30-July 5, 2002.
    • (2002) Proc. IEEE ISIT 2002 , pp. 480
    • Hu, X.Y.1    Eleftheriou, E.2    Arnold, D.M.3
  • 5
    • 4944248938 scopus 로고    scopus 로고
    • Regular and irregular progressive edge-growth tanner graphs
    • Submitted to
    • X. -Y. Hu, E. Eleftheriou, and D. -M. Arnold, "Regular and Irregular Progressive Edge-Growth Tanner Graphs," Submitted to IEEE Trans. Inform. Theory, 2002.
    • (2002) IEEE Trans. Inform. Theory
    • Hu, X.Y.1    Eleftheriou, E.2    Arnold, D.M.3
  • 6
    • 0035504019 scopus 로고    scopus 로고
    • Low-density parity-check codes based on finite geometries: A rediscovery and new results
    • Nov.
    • Y. Kou, S. Lin and M. P. C. Fossorier, "Low-density parity-check codes based on finite geometries: A rediscovery and new results," IEEE Trans. Inform. Theory, vol. 47, pp. 2711-2736, Nov. 2001.
    • (2001) IEEE Trans. Inform. Theory , vol.47 , pp. 2711-2736
    • Kou, Y.1    Lin, S.2    Fossorier, M.P.C.3
  • 7
    • 18144396492 scopus 로고    scopus 로고
    • D. J. C. Mackay, "http://www.inference.phy.cam.ac.uk/mackay/PEG_ECC. html."
    • Mackay, D.J.C.1
  • 8
    • 23844506274 scopus 로고    scopus 로고
    • Weakness of Margulis and Ramanujan-Margulis low-density parity-check codes
    • D. J. C. Mackay and M. S. Postol. "Weakness of Margulis and Ramanujan-Margulis low-density parity-check codes," Electronic Notes in Theoretical Computer Science 74, http://www.elsevier.nl/locate/entcs/volume74. html, 2003.
    • (2003) Electronic Notes in Theoretical Computer Science , vol.74
    • Mackay, D.J.C.1    Postol, M.S.2
  • 9
    • 0033337059 scopus 로고    scopus 로고
    • Comparison of construction of irregular Gallager codes
    • Oct.
    • D. J. C. Mackay, S. T. Wilson and M. C. Davey, "Comparison of construction of irregular Gallager codes," IEEE Trans. Comm., vol. 47, pp. 1449-1454, Oct. 1999.
    • (1999) IEEE Trans. Comm. , vol.47 , pp. 1449-1454
    • Mackay, D.J.C.1    Wilson, S.T.2    Davey, M.C.3
  • 10
    • 0034865418 scopus 로고    scopus 로고
    • Search for good low-density parity-check codes using girth distribution
    • Helsinki, Finland, June
    • Y. Mao and A. H. Banihashemi, "Search for good low-density parity-check codes using girth distribution," Proc. IEEE ICC 2001, Helsinki, Finland, vol. 1, pp. 41-44, June 2001.
    • (2001) Proc. IEEE ICC 2001 , vol.1 , pp. 41-44
    • Mao, Y.1    Banihashemi, A.H.2
  • 12
    • 0035246127 scopus 로고    scopus 로고
    • Design of capacity-approaching irregular low-density parity-check codes
    • Feb.
    • T. Richardson, M. A. Shokrollahi and R. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
    • (2001) IEEE Trans. Inform. Theory , vol.47 , Issue.2 , pp. 619-637
    • Richardson, T.1    Shokrollahi, M.A.2    Urbanke, R.3
  • 13
    • 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. 27, pp. 533-547, Sept. 1981.
    • (1981) IEEE Trans. Inform. Theory , vol.27 , pp. 533-547
    • Tanner, R.M.1
  • 14
    • 0037972830 scopus 로고    scopus 로고
    • Construction of irregular LDPC codes with low error floors
    • Anchorage, Alaska, USA, May
    • T. Tian, C. Jones, J. D. Villasenor, and R. D. Wesel, "Construction of irregular LDPC codes with low error floors," Proc. IEEE ICC 2003, Anchorage, Alaska, USA, vol.5, pp 3125-3129, May 2003.
    • (2003) Proc. IEEE ICC 2003 , vol.5 , pp. 3125-3129
    • Tian, T.1    Jones, C.2    Villasenor, J.D.3    Wesel, R.D.4
  • 15
    • 18144417407 scopus 로고    scopus 로고
    • Selective avoidance of cycles in irregular LDPC code construction
    • Submitted to
    • T. Tian, C. Jones, J. D. Villasenor, and R. D. Wesel, "Selective Avoidance of Cycles in Irregular LDPC Code Construction," Submitted to IEEE Trans. Comm., 2002.
    • (2002) IEEE Trans. Comm.
    • Tian, T.1    Jones, C.2    Villasenor, J.D.3    Wesel, R.D.4


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