Extended PEG algorithm for high rate LDPC codes

  • Zhiheng Zhou*
  • , Xiangxue Li
  • , Dong Zheng
  • , Kefei Chen
  • , Jianhua Li
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations

Abstract

Progressive Edge-Growth(PEG) Algorithm is a good candidate to generate Tanner Graphs with a large girth by establishing edges or connections between symbol and check nodes in an edge-by-edge manner. In this paper, we propose an extended PEG algorithm for constructing Low-Density Parity-Check (LDPC) codes with very high rate when given a lower bound of girth. Simulation results show the bit error rates of constructed LDPC codes with very high rate or large girth.

Original languageEnglish
Title of host publicationProceedings - 2009 IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2009
Pages494-498
Number of pages5
DOIs
StatePublished - 2009
Externally publishedYes
Event2009 IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2009 - Chengdu, Sichuan, China
Duration: 9 Aug 200912 Aug 2009

Publication series

NameProceedings - 2009 IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2009

Conference

Conference2009 IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2009
Country/TerritoryChina
CityChengdu, Sichuan
Period9/08/0912/08/09

Fingerprint

Dive into the research topics of 'Extended PEG algorithm for high rate LDPC codes'. Together they form a unique fingerprint.

Cite this