Quasi-Cyclic Asymptotically Regular LDPC Codes

Summary, in English

Families of asymptotically regular LDPC block code ensembles can be formed by terminating (J, K)-regular protograph-based LDPC convolutional codes. By varying the termination length, we obtain a large selection of LDPC block code ensembles with varying code rates, minimum distance that grows linearly with block length, and capacity approaching iterative decoding thresholds, despite the fact that the terminated ensembles are almost regular. In this paper, we investigate the properties of the quasi-cyclic (QC) members of such an ensemble. We show that an upper bound on the minimum Hamming distance of members of the QC sub-ensemble can be improved by careful choice of the component protographs used in the code construction. Further, we show that the upper bound on the minimum distance can be improved by using arrays of circulants in a graph cover of the protograph.

• Författare: David G.M. Mitchell; Roxana Smarandache; Michael Lentmaier; Daniel J. Costello Jr.
• Avdelning/ar: ELLIIT: the Linköping-Lund initiative on IT and mobile communication
• Publiceringsår: 2010
• Språk: Engelska
• Publikation/Tidskrift/Serie: 2010 IEEE Information Theory Workshop
• Fulltext: - 146 kB; Download statistics
• Länkar: http://dx.doi.org/10.1109/CIG.2010.5592641
• Dokumenttyp: Konferensbidrag
• Förlag: IEEE - Institute of Electrical and Electronics Engineers Inc.
• Ämne: Electrical Engineering, Electronic Engineering, Information Engineering
• Nyckelord: spatial coupling; LDPC codes; LDPC convolutional codes; quasi-cyclic codes
• Conference name: IEEE Information Theory Workshop (ITW), 2010
• Conference date: 2010-08-30 - 2010-09-03
• Conference place: Dublin, Ireland
• Status: Published
• Forskningsgrupp: Telecommunication Theory
• ISBN/ISSN/Övrigt: ISBN: 978-1-4244-8262-7