首页    期刊浏览 2024年07月05日 星期五
登录注册

文章基本信息

  • 标题:A Fast Raptor Codes Decoding Strategy for Real-Time Communication Systems
  • 本地全文:下载
  • 作者:Yeqing Wu ; Fei Hu ; Qingquan Sun
  • 期刊名称:Network and Communication Technologies
  • 印刷版ISSN:1927-064X
  • 电子版ISSN:1927-0658
  • 出版年度:2013
  • 卷号:2
  • 期号:2
  • 页码:29
  • DOI:10.5539/nct.v2n2p29
  • 出版社:Canadian Center of Science and Education
  • 摘要:We propose an efficient algorithm for Raptor decoding, which reduces the computational complexity of the most time-consuming steps in systematic decoding. Our proposed algorithm includes two aspects: First, to handle the decoding failure of the Raptor decoding, we propose a scheme, which is called the No-Wrapup Failure Handling scheme. It can resume the decoding process from where it fails after receiving a pre-defined number of additional encoded symbols, and thus avoids the repetition of time-consuming steps in the decoding process. Second, in order to reduce the time of finding the row with the minimum degree in the precode, we propose a Fast Min-Degree Seeking (FMDS) scheme. FMDS automatically maintains and updates the row degrees of the precode when converting the precode into an identity matrix through Gaussian elimination and Belief-propagation. Experimental results show that, compared to other Raptor decoding schemes, the proposed scheme achieves a much shorter decoding time, and can greatly speed up the data recovery in real-time applications.
  • 其他摘要:We propose an efficient algorithm for Raptor decoding, which reduces the computational complexity of the most time-consuming steps in systematic decoding. Our proposed algorithm includes two aspects: First, to handle the decoding failure of the Raptor decoding, we propose a scheme, which is called the No-Wrapup Failure Handling scheme. It can resume the decoding process from where it fails after receiving a pre-defined number of additional encoded symbols, and thus avoids the repetition of time-consuming steps in the decoding process. Second, in order to reduce the time of finding the row with the minimum degree in the precode, we propose a Fast Min-Degree Seeking (FMDS) scheme. FMDS automatically maintains and updates the row degrees of the precode when converting the precode into an identity matrix through Gaussian elimination and Belief-propagation. Experimental results show that, compared to other Raptor decoding schemes, the proposed scheme achieves a much shorter decoding time, and can greatly speed up the data recovery in real-time applications.
国家哲学社会科学文献中心版权所有