New construction of LDPC convolutional codes

Chi Jen Wu*, Yi Chun Chou, Chung-Hsuan Wang, Chi Chao Chao

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations

Abstract

In this paper, we propose a new construction of (3, t)-regular low-density parity-check convolutional codes by properly including binomial entries in the parity-check matrices. Both of the upper and lower bounds on free distance are derived for the new codes. Compared with previous constructions, our design can not only avoid codes of girth less than 8 but also provide enlarged free distances for some code rates. Simulation results show that the codes based on the new construction can achieve better bit-error-rate performance and lower error floor.

Original languageEnglish
Title of host publicationProceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008
Pages1040-1044
Number of pages5
DOIs
StatePublished - 29 Sep 2008
Event2008 IEEE International Symposium on Information Theory, ISIT 2008 - Toronto, ON, Canada
Duration: 6 Jul 200811 Jul 2008

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8101

Conference

Conference2008 IEEE International Symposium on Information Theory, ISIT 2008
CountryCanada
CityToronto, ON
Period6/07/0811/07/08

Fingerprint Dive into the research topics of 'New construction of LDPC convolutional codes'. Together they form a unique fingerprint.

  • Cite this

    Wu, C. J., Chou, Y. C., Wang, C-H., & Chao, C. C. (2008). New construction of LDPC convolutional codes. In Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008 (pp. 1040-1044). [4595145] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2008.4595145