Performance analysis of QC-LDPC construction based on distance graph

Lixin Li, Meng Zhu, Fan Yang, Yang Zhang

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

1 Scopus citations

Abstract

According to the fact that the random construction method of LDPC(Low Density Parity Check) codes are lack of structure and are difficult to be implemented in hardware, two construction methods of QC-LDPC(Quasi-Cyclic LDPC) codes-sequential and random search method based on distance graph are proposed. The two algorithms can produce flexible QC-LDPC codes by setting the parameters such as code length, rates and girth according to requirement. The simulation shows that: the random search method performs better than the sequential search method and the QC-LDPC codes constructed by random search method have equivalent BER performance with PEG construction method. Compared with the existing random construction method, the two methods proposed are faster, and can obtain quasi-cyclic codes which are easy to be implemented in hardware.

Original languageEnglish
Title of host publicationProceedings of the 2013 IEEE 8th Conference on Industrial Electronics and Applications, ICIEA 2013
Pages1162-1166
Number of pages5
DOIs
StatePublished - 2013
Event2013 IEEE 8th Conference on Industrial Electronics and Applications, ICIEA 2013 - Melbourne, VIC, Australia
Duration: 19 Jun 201321 Jun 2013

Publication series

NameProceedings of the 2013 IEEE 8th Conference on Industrial Electronics and Applications, ICIEA 2013

Conference

Conference2013 IEEE 8th Conference on Industrial Electronics and Applications, ICIEA 2013
Country/TerritoryAustralia
CityMelbourne, VIC
Period19/06/1321/06/13

Keywords

  • distance graph
  • girth
  • QC-LDPC
  • search algorithm

Fingerprint

Dive into the research topics of 'Performance analysis of QC-LDPC construction based on distance graph'. Together they form a unique fingerprint.

Cite this