• DocumentCode
    233113
  • Title

    A Low-Complexity Decoding Algorithm for RaptorQ Code

  • Author

    Rucheng Zhang ; Yajun Kou

  • Author_Institution
    Nanjing Univ. of Posts & Telecommun., Nanjing, China
  • fYear
    2014
  • fDate
    8-10 Nov. 2014
  • Firstpage
    145
  • Lastpage
    150
  • Abstract
    RaptorQ code, as an advanced Raptor code with great flexibility and fine reception performance, has been widely adopted in international standards. Extensive research has been focused on the design and implementation of efficient decoding algorithms for Raptor codes. In this paper, a new low-complexity decoding algorithm for RaptorQ code is proposed, where the on-the-fly decoding and the incremental decoding techniques are exploited to achieve early decoding and to reduce overall computational complexity. Computer simulations show that for the proposed algorithm the decoding process may start when thirty percents of the minimum required encoded symbols are received and the overall computational complexity can be reduced by fifty percents with regards to the ML decoding algorithm in [6].
  • Keywords
    codes; computational complexity; maximum likelihood decoding; ML decoding algorithm; computational complexity; incremental decoding technique; low-complexity decoding algorithm; on-the-fly decoding technique; raptorQ code; Algorithm design and analysis; Computational complexity; Encoding; Maximum likelihood decoding; Standards; Vectors; Fountain code; RaptorQ code; incremental decoding; on-the-fly decoding;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Broadband and Wireless Computing, Communication and Applications (BWCCA), 2014 Ninth International Conference on
  • Conference_Location
    Guangdong
  • Print_ISBN
    978-1-4799-4174-2
  • Type

    conf

  • DOI
    10.1109/BWCCA.2014.58
  • Filename
    7016060