• DocumentCode
    3086396
  • Title

    The Design of Decomposed Luby Transform Codes

  • Author

    Cao, Rui ; Yang, Liuqing

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Univ. of Florida, Gainesville, FL, USA
  • fYear
    2011
  • fDate
    5-9 Dec. 2011
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    Forward error correction (FEC) is an effective means of reliable communications in wireless networks. Among all error-correcting codes, the recently developed fountain codes are known for their low complexity and rateless features. In the literature, fountain codes are mostly adopted in point-to-point communications. In this paper, we will investigate decomposed fountain codes for distributed dual-hop systems. In this type of codes, two layers of random XOR encoding are performed, but only a single layer of decoding is needed. By implementing each layer of encoding at one hop, the dual-hop systems can ensure end-to-end communication reliability with significantly reduced computation cost. Since Luby Transform (LT) codes are the first class of practical fountain codes and the core of more recent fountain codes, we will focus our study on decomposed LT (DLT) codes. To construct the DLT codes, we first analyze general LT code decomposition, and then propose a unique decomposition algorithm tailored for the LT code with robust Soliton distribution (RSD). The performance of the resultant DLT code will be evaluated in terms of the decoding probability and computation cost.
  • Keywords
    decoding; error correction codes; forward error correction; network coding; probability; radio networks; random codes; telecommunication network reliability; transform coding; decoding probability; decomposed Luby transform code design; decomposed fountain codes; distributed dual-hop systems; end-to-end communication reliability; error-correcting codes; forward error correction; general LT code decomposition; point-to-point communications; random XOR encoding; robust Soliton distribution; unique decomposition algorithm; wireless networks; Algorithm design and analysis; Complexity theory; Decoding; Encoding; Polynomials; Robustness;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Global Telecommunications Conference (GLOBECOM 2011), 2011 IEEE
  • Conference_Location
    Houston, TX, USA
  • ISSN
    1930-529X
  • Print_ISBN
    978-1-4244-9266-4
  • Electronic_ISBN
    1930-529X
  • Type

    conf

  • DOI
    10.1109/GLOCOM.2011.6134475
  • Filename
    6134475