Exact Free Distance and Trapping Set Growth Rates for LDPC Convolutional Codes

Summary, in English

Ensembles of (J,K)-regular low-density parity-check convolutional (LDPCC) codes are known to be asymptotically good, in the sense that the minimum free distance grows linearly with the constraint length. In this paper, we use a protograph-based analysis of terminated LDPCC codes to obtain an upper bound on the free distance growth rate of ensembles of periodically time-varying LDPCC codes. This bound is compared to a lower bound and evaluated numerically. It is found that, for a sufficiently large period, the bounds coincide. This approach is then extended to obtain bounds on the trapping set numbers, which define the size of the smallest, non-empty trapping sets, for these asymptotically good, periodically time-varying LDPCC code ensembles.

• Författare: David G.M. Mitchell; Ali Emre Pusane; Michael Lentmaier; Daniel J. Costello Jr.
• Avdelning/ar: ELLIIT: the Linköping-Lund initiative on IT and mobile communication
• Publiceringsår: 2011
• Språk: Engelska
• Sidor: 1096-1100
• Publikation/Tidskrift/Serie: 2011 IEEE International Symposium on Information Theory Proceedings
• Fulltext: - 134 kB; Download statistics
• Länkar: http://dx.doi.org/10.1109/ISIT.2011.6033700
• 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; trapping sets
• Conference name: IEEE International Symposium on Information Theory, 2011
• Conference date: 2011-07-31 - 2011-08-05
• Conference place: Saint Petersburg, Russian Federation
• Status: Published
• Forskningsgrupp: Telecommunication Theory
• ISBN/ISSN/Övrigt: ISSN: 2157-8117; ISSN: 2157-8095; ISBN: 978-1-4577-0596-0