• DocumentCode
    2454335
  • Title

    Rate-compatible LDPC convolutional codes for capacity-approaching hybrid ARQ

  • Author

    Si, Zhongwei ; Andersson, Mattias ; Thobaben, Ragnar ; Skoglund, Mikael

  • Author_Institution
    Sch. of Electr. Eng. & ACCESS Linnaeus Center, R. Inst. of Technol. (KTH), Stockholm, Sweden
  • fYear
    2011
  • fDate
    16-20 Oct. 2011
  • Firstpage
    513
  • Lastpage
    517
  • Abstract
    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.
  • Keywords
    automatic repeat request; convolutional codes; parity check codes; binary erasure channel; capacity-approaching hybrid ARQ; channel capacity; channel parameter; code family; information delivery; rate-compatible LDPC convolutional codes; type-II HARQ systems; Channel capacity; Conferences; Convolutional codes; Decoding; Parity check codes; Throughput;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Workshop (ITW), 2011 IEEE
  • Conference_Location
    Paraty
  • Print_ISBN
    978-1-4577-0438-3
  • Type

    conf

  • DOI
    10.1109/ITW.2011.6089515
  • Filename
    6089515