A new construction of irregular LDPC convolutional codes with cycle removal

Chi Jen Wu*, Chung-Hsuan Wang, Chi Chao Chao

*Corresponding author for this work

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

1 Scopus citations

Abstract

In this paper, a new construction of irregular low-density parity-check convolutional codes (LDPC-CCs) is presented. Both upper and lower bounds on the free distance are derived as well. Compared with previously constructed irregular LDPC-CCs, our design can not only avoid a girth less than 8 but also provide an enlarged free distance. Since some undesired cycles occur due to the binomial terms in the parity-check matrices of general LDPC-CCs, we provide a specific procedure to remove this kind of length-8 cycles. It can also be applied to our irregular construction. Simulation results show that the codes based on the new construction and the cycle-removal procedure can achieve better bit-error-rate performance and a lower error-floor.

Original languageEnglish
Title of host publicationISITA/ISSSTA 2010 - 2010 International Symposium on Information Theory and Its Applications
Pages507-512
Number of pages6
DOIs
StatePublished - 1 Dec 2010
Event2010 20th International Symposium on Information Theory and Its Applications, ISITA 2010 and the 2010 20th International Symposium on Spread Spectrum Techniques and Applications, ISSSTA 2010 - Taichung, Taiwan
Duration: 17 Oct 201020 Oct 2010

Publication series

NameISITA/ISSSTA 2010 - 2010 International Symposium on Information Theory and Its Applications

Conference

Conference2010 20th International Symposium on Information Theory and Its Applications, ISITA 2010 and the 2010 20th International Symposium on Spread Spectrum Techniques and Applications, ISSSTA 2010
Country/TerritoryTaiwan
CityTaichung
Period17/10/1020/10/10

Fingerprint

Dive into the research topics of 'A new construction of irregular LDPC convolutional codes with cycle removal'. Together they form a unique fingerprint.

Cite this