Fast Serial Iterative Decoding Algorithm for Zigzag Decodable Fountain Codes by Efficient Scheduling

• MURAYAMA Yoshihiro

  Dept. of Informatics, Division of Fundamental Sciences, Graduate School of Sciences and Technology for Innovation, Yamaguchi University

• NOZAKI Takayuki

  Dept. of Informatics, Division of Fundamental Sciences, Graduate School of Sciences and Technology for Innovation, Yamaguchi University The Research Institute for Time Studies, Yamaguchi University

抄録

Fountain codes are erasure correcting codes realizing reliable communication systems for the multicast on the Internet. The zigzag decodable fountain (ZDF) codes are one of generalization of the Raptor codes, i.e., applying shift operation to generate the output packets. The ZDF codes are decoded by a two-stage iterative decoding algorithm, which combines the packet-wise peeling algorithm and the bit-wise peeling algorithm. By the bit-wise peeling algorithm and shift operation, ZDF codes outperform Raptor codes under iterative decoding in terms of decoding erasure rates and overheads. However, the bit-wise peeling algorithm spends long decoding time. This paper proposes fast bit-wise decoding algorithms for the ZDF codes. Simulation results show that the proposed algorithm drastically reduces the decoding time compared with the previous algorithm.

収録刊行物

• IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

  IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E102.A (12), 1600-1610, 2019-12-01

  一般社団法人 電子情報通信学会

キーワード

• fountain code
• zigzag decodable fountain code
• iterative decoding

詳細情報

• CRID: 1390282752375904640
• NII論文ID: 130007754019
• DOI: 10.1587/transfun.e102.a.1600
• ISSN: 17451337
• ISSN: 09168508
• Web Site: https://www.jstage.jst.go.jp/article/transfun/E102.A/12/E102.A_1600/_pdf
• 本文言語コード: en
• データソース種別:
  • JaLC
  • Crossref
  • CiNii Articles
  • KAKEN
• 抄録ライセンスフラグ: 使用不可