• DocumentCode
    2025803
  • Title

    Rateless Slepian-Wolf Coding Based on Rate Adaptive Low-Density-Parity-Check Codes

  • Author

    Jing Jiang ; Dake He ; Jagmohan, A.

  • Author_Institution
    Texas A&M Univ., College Station
  • fYear
    2007
  • fDate
    24-29 June 2007
  • Firstpage
    1316
  • Lastpage
    1320
  • Abstract
    A rateless Slepian-Wolf coding (SWC) scheme based on rate adaptive low-density-parity-check (LDPC) codes is presented. We first motivate the application of punctured LDPC codes in SWC. A general rate adaptive LDPC framework is then described. The main idea is to adjust the puncturing ratio in the specified variable nodes for rate adaptivity while keeping the bipartite graph structure intact. As a complement, a repetition scheme is proposed for high rate SWC. The asymptotic performance of the proposed scheme is analyzed by density evolution (DE) with universal coding bounds and finite code length performance is verified by computer simulations.
  • Keywords
    graph theory; parity check codes; asymptotic performance; bipartite graph structure; density evolution; finite code length performance; punctured LDPC codes; rate adaptive low-density-parity-check codes; rateless Slepian-Wolf coding; universal coding bounds; Application software; Bipartite graph; Computer simulation; Decoding; Parity check codes; Performance analysis; Source coding; Statistics; Video compression; Wireless sensor networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2007. ISIT 2007. IEEE International Symposium on
  • Conference_Location
    Nice
  • Print_ISBN
    978-1-4244-1397-3
  • Type

    conf

  • DOI
    10.1109/ISIT.2007.4557405
  • Filename
    4557405