Presentation | 2016-01-18 Reduction of Decoding Iterations for Zigzag Decodable Fountain Codes Takayuki Nozaki, |
---|---|
PDF Download Page | PDF download Page Link |
Abstract(in Japanese) | (See Japanese page) |
Abstract(in English) | Fountain codes are erasure correcting codes realizing the reliable communication for the multicast in the Internet. Zigzag decodable fountain (ZDF) codes have good decoding performance with the decoder combined the peeling algorithm with the zigzag decoding (ZD) algorithm. However, the number of iterations of the decoder is greater than the decoder for the Raptor codes. The tree-structure expectation propagation (TEP) is a decoding algorithm for the low-density parity-check codes over the binary erasure channels and an extension of peeling algorithm. In this paper, we extend the TEP for the ZDF codes and propose a decoding algorithm combined the TEP with the ZD algorithm. Simulation results show that the proposed decoding algorithm reduces the number of decoding iterations as compared with the previous decoding algorithm. Moreover, simulation results show that the proposed decoding algorithm has the same decoding performance as the previous decoding algorithm. |
Keyword(in Japanese) | (See Japanese page) |
Keyword(in English) | Fountain code / Zigzag decodable coding / tree-structure expectation propagation |
Paper # | IT2015-52,SIP2015-66,RCS2015-284 |
Date of Issue | 2016-01-11 (IT, SIP, RCS) |
Conference Information | |
Committee | RCS / IT / SIP |
---|---|
Conference Date | 2016/1/18(2days) |
Place (in Japanese) | (See Japanese page) |
Place (in English) | Kwansei Gakuin Univ. Osaka Umeda Campus |
Topics (in Japanese) | (See Japanese page) |
Topics (in English) | Signal Processing for Wireless Communications, Learning, Mathematical Science, Communication Theory, etc. |
Chair | Makoto Taromaru(Fukuoka Univ.) / Yasutada Oohama(Univ. of Electro-Comm.) / Osamu Houshuyama(NEC) |
Vice Chair | Hidekazu Murata(Kyoto Univ.) / Satoshi Denno(Okayama Univ.) / Yukitoshi Sanada(Keio Univ.) / Tadashi Wadayama(Nagoya Inst. of Tech.) / Makoto Nakashizuka(Chiba Inst. of Tech.) / Masahiro Okuda(Univ. of Kitakyushu) |
Secretary | Hidekazu Murata(Mitsubishi Electric) / Satoshi Denno(NTT DoCoMo) / Yukitoshi Sanada(Univ. of Electro-Comm.) / Tadashi Wadayama(Wakayama Univ.) / Makoto Nakashizuka(NEC) / Masahiro Okuda(Ritsumeikan Univ.) |
Assistant | Jun Mashino(NTT) / Tetsuya Yamamoto(Panasonic) / Takamichi Inoue(NEC) / Tomoya Tandai(Toshiba) / Toshihiko Nishimura(Hokkaido Univ.) / Takuya Kusaka(Okayama Univ.) / Takamichi Miyata(Chiba Inst. of Tech.) |
Paper Information | |
Registration To | Technical Committee on Radio Communication Systems / Technical Committee on Information Theory / Technical Committee on Signal Processing |
---|---|
Language | JPN |
Title (in Japanese) | (See Japanese page) |
Sub Title (in Japanese) | (See Japanese page) |
Title (in English) | Reduction of Decoding Iterations for Zigzag Decodable Fountain Codes |
Sub Title (in English) | |
Keyword(1) | Fountain code |
Keyword(2) | Zigzag decodable coding |
Keyword(3) | tree-structure expectation propagation |
1st Author's Name | Takayuki Nozaki |
1st Author's Affiliation | Yamaguchi University(Yamaguchi Univ.) |
Date | 2016-01-18 |
Paper # | IT2015-52,SIP2015-66,RCS2015-284 |
Volume (vol) | vol.115 |
Number (no) | IT-394,SIP-395,RCS-396 |
Page | pp.pp.25-30(IT), pp.25-30(SIP), pp.25-30(RCS), |
#Pages | 6 |
Date of Issue | 2016-01-11 (IT, SIP, RCS) |