Zigzag Decodable Fountain Codes
Summary :
This paper proposes a fountain coding system which has lower decoding erasure rate and lower space complexity of the decoding algorithm than the Raptor coding systems. A main idea of the proposed fountain code is employing shift and exclusive OR to generate the output packets. This technique is known as the zigzag decodable code, which is efficiently decoded by the zigzag decoder. In other words, we propose a fountain code based on the zigzag decodable code in this paper. Moreover, we analyze the overhead, decoding erasure rate, decoding complexity, and asymptotic overhead of the proposed fountain code. As a result, we show that the proposed fountain code outperforms the Raptor codes in terms of the overhead and decoding erasure rate. Simulation results show that the proposed fountain coding system outperforms Raptor coding system in terms of the overhead and the space complexity of decoding.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E100-A No.8 pp.1693-1704
- Publication Date
- 2017/08/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E100.A.1693
- Type of Manuscript
- PAPER
- Category
- Coding Theory
Authors
Takayuki NOZAKI
Yamaguchi University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Takayuki NOZAKI, "Zigzag Decodable Fountain Codes" in IEICE TRANSACTIONS on Fundamentals,
vol. E100-A, no. 8, pp. 1693-1704, August 2017, doi: 10.1587/transfun.E100.A.1693.
Abstract: This paper proposes a fountain coding system which has lower decoding erasure rate and lower space complexity of the decoding algorithm than the Raptor coding systems. A main idea of the proposed fountain code is employing shift and exclusive OR to generate the output packets. This technique is known as the zigzag decodable code, which is efficiently decoded by the zigzag decoder. In other words, we propose a fountain code based on the zigzag decodable code in this paper. Moreover, we analyze the overhead, decoding erasure rate, decoding complexity, and asymptotic overhead of the proposed fountain code. As a result, we show that the proposed fountain code outperforms the Raptor codes in terms of the overhead and decoding erasure rate. Simulation results show that the proposed fountain coding system outperforms Raptor coding system in terms of the overhead and the space complexity of decoding.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E100.A.1693/_p
Copy
@ARTICLE{e100-a_8_1693,
author={Takayuki NOZAKI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Zigzag Decodable Fountain Codes},
year={2017},
volume={E100-A},
number={8},
pages={1693-1704},
abstract={This paper proposes a fountain coding system which has lower decoding erasure rate and lower space complexity of the decoding algorithm than the Raptor coding systems. A main idea of the proposed fountain code is employing shift and exclusive OR to generate the output packets. This technique is known as the zigzag decodable code, which is efficiently decoded by the zigzag decoder. In other words, we propose a fountain code based on the zigzag decodable code in this paper. Moreover, we analyze the overhead, decoding erasure rate, decoding complexity, and asymptotic overhead of the proposed fountain code. As a result, we show that the proposed fountain code outperforms the Raptor codes in terms of the overhead and decoding erasure rate. Simulation results show that the proposed fountain coding system outperforms Raptor coding system in terms of the overhead and the space complexity of decoding.},
keywords={},
doi={10.1587/transfun.E100.A.1693},
ISSN={1745-1337},
month={August},}
Copy
TY - JOUR
TI - Zigzag Decodable Fountain Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1693
EP - 1704
AU - Takayuki NOZAKI
PY - 2017
DO - 10.1587/transfun.E100.A.1693
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E100-A
IS - 8
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - August 2017
AB - This paper proposes a fountain coding system which has lower decoding erasure rate and lower space complexity of the decoding algorithm than the Raptor coding systems. A main idea of the proposed fountain code is employing shift and exclusive OR to generate the output packets. This technique is known as the zigzag decodable code, which is efficiently decoded by the zigzag decoder. In other words, we propose a fountain code based on the zigzag decodable code in this paper. Moreover, we analyze the overhead, decoding erasure rate, decoding complexity, and asymptotic overhead of the proposed fountain code. As a result, we show that the proposed fountain code outperforms the Raptor codes in terms of the overhead and decoding erasure rate. Simulation results show that the proposed fountain coding system outperforms Raptor coding system in terms of the overhead and the space complexity of decoding.
ER -
English
