Rate-compatible LDPC convolutional codes for capacity-approaching hybrid ARQ
2011 (English)In: 2011 IEEE Information Theory Workshop (ITW), 2011, 513-517 p.Conference paper (Refereed)
In this paper we construct a family of rate-compatible LDPC convolutional codes for Type-II HARQ systems. For each code family, the codes of lower rates are constructed by successively extending the graph of the high-rate base code. Theoretically, the proposed rate-compatible family includes all rates from 0 to 1. We prove analytically that all LDPC convolutional codes in the family are capacity achieving over the binary erasure channel (BEC). Thus, if applied to an idealized HARQ system over the BEC where the channel parameter stays constant within one complete information delivery, the throughput achieves the capacity of the channel. Moreover, the code construction is realized by regular degree distributions, which greatly simplifies the optimization.
Place, publisher, year, edition, pages
2011. 513-517 p.
IdentifiersURN: urn:nbn:se:kth:diva-50614DOI: 10.1109/ITW.2011.6089515ISI: 000299416200106ScopusID: 2-s2.0-83655191102ISBN: 978-1-4577-0437-6OAI: oai:DiVA.org:kth-50614DiVA: diva2:462294
2011 IEEE Information Theory Workshop (ITW). Paraty, Brazil. October 16-20, 2011
FunderICT - The Next Generation
QC 201112072011-12-062011-12-062012-04-03Bibliographically approved