Skip to main navigation Skip to search Skip to main content

Recursive construction of quasi-cyclic cycle LDPC codes based on replacement products

  • Jiayi Huang
  • , Xue Qin Jiang
  • , Xiao Dong Zhang
  • , Hui Ming Wang
  • , Wei Duan
  • Donghua University
  • Shanghai Jiao Tong University
  • Jeonbuk National University

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

Abstract

Product replacement gives a simple approach for code construction. This paper investigates the use of replacement product graphs for the recursive construction of QC cycle LDPC codes. It is proved that the QC cycle LDPC codes constructed by our approach are of girth 6. Simulation results show that QC cycle LDPC codes constructed by the replacement product perform well over the AWGN channel.

Original languageEnglish
Title of host publicationIEEE CITS 2016 - 2016 International Conference on Computer, Information and Telecommunication Systems
EditorsFei Gao, Zan Li, Daniel Cascado Caballero, Jing Fan, Mohammad S. Obaidat, Petros Nicoploitidis, Kuei Fang Hsiao
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781509034406
DOIs
StatePublished - 16 Aug 2016
Event2016 International Conference on Computer, Information and Telecommunication Systems, CITS 2016 - Kunming, China
Duration: 6 Jul 20168 Jul 2016

Publication series

NameIEEE CITS 2016 - 2016 International Conference on Computer, Information and Telecommunication Systems

Conference

Conference2016 International Conference on Computer, Information and Telecommunication Systems, CITS 2016
Country/TerritoryChina
CityKunming
Period6/07/168/07/16

Keywords

  • QC cycle LDPC code
  • girth
  • recursive
  • replacement product

Fingerprint

Dive into the research topics of 'Recursive construction of quasi-cyclic cycle LDPC codes based on replacement products'. Together they form a unique fingerprint.

Cite this