Irregular Repeat Accumulate Codes Based on Max-Flow Algorithm for Energy-Saving Networks

Ryuichi Tatsukawa; Akiko Manada; Hiroyoshi Morita

9th International Conference on Body Area Networks

Research Article

Irregular Repeat Accumulate Codes Based on Max-Flow Algorithm for Energy-Saving Networks

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.4108/icst.bodynets.2014.256920,
    author={Ryuichi Tatsukawa and Akiko Manada and Hiroyoshi Morita},
    title={Irregular Repeat Accumulate Codes Based on Max-Flow Algorithm for Energy-Saving Networks},
    proceedings={9th International Conference on Body Area Networks},
    publisher={ICST},
    proceedings_a={BODYNETS},
    year={2014},
    month={11},
    keywords={max-flow algorithm tanner graphs ira code ldpc code},
    doi={10.4108/icst.bodynets.2014.256920}
}

Ryuichi Tatsukawa
Akiko Manada
Hiroyoshi Morita
Year: 2014
Irregular Repeat Accumulate Codes Based on Max-Flow Algorithm for Energy-Saving Networks
BODYNETS
ACM
DOI: 10.4108/icst.bodynets.2014.256920

Ryuichi Tatsukawa¹, Akiko Manada¹^,*, Hiroyoshi Morita¹

1: The University of Electro-Communications

*Contact email: amanada@is.uec.ac.jp

Abstract

The efficiency of Error Correcting Codes (ECCs) arises when data should be transmitted via noisy channel. Many types of ECCs have been proposed so far, but ECCs with low encoding/decoding complexity are demanded when energy consumption is highly considered (e.g. networks using nanoscale devices). For such a situation, Irregular Repeat Accumulate (IRA) codes, a class of Low Density Parity Check (LDPC) codes, can be suitable candidates as ECCs since their encoding and decoding complexities are known to be low. In this paper, we introduce a construction method of IRA codes based on Max-flow algorithm and show the performance of robustness for the Binary Erasure Channel (BEC).

Keywords: max-flow algorithm tanner graphs ira code ldpc code

Published: 2014-11-21
Publisher: ICST

: http://dx.doi.org/10.4108/icst.bodynets.2014.256920