Efficient Linear Time Encoding for LDPC Codes
Summary :
In this paper, we propose a new encoding method applicable to any linear codes over arbitrary finite field whose computational complexity is O(δ*n) where δ* and n denote the maximum column weight of a parity check matrix of a code and the code length, respectively. This means that if a code has a parity check matrix with the constant maximum column weight, such as LDPC codes, it can be encoded with O(n) computation. We also clarify the relation between the proposed method and conventional methods, and compare the computational complexity of those methods. Then we show that the proposed encoding method is much more efficient than the conventional ones.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E97-A No.7 pp.1556-1567
- Publication Date
- 2014/07/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E97.A.1556
- Type of Manuscript
- PAPER
- Category
- Coding Theory
Authors
Tomoharu SHIBUYA
Sophia University
Kazuki KOBAYASHI
Fujitsu Software Technologies Limited.
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
Tomoharu SHIBUYA, Kazuki KOBAYASHI, "Efficient Linear Time Encoding for LDPC Codes" in IEICE TRANSACTIONS on Fundamentals,
vol. E97-A, no. 7, pp. 1556-1567, July 2014, doi: 10.1587/transfun.E97.A.1556.
Abstract: In this paper, we propose a new encoding method applicable to any linear codes over arbitrary finite field whose computational complexity is O(δ*n) where δ* and n denote the maximum column weight of a parity check matrix of a code and the code length, respectively. This means that if a code has a parity check matrix with the constant maximum column weight, such as LDPC codes, it can be encoded with O(n) computation. We also clarify the relation between the proposed method and conventional methods, and compare the computational complexity of those methods. Then we show that the proposed encoding method is much more efficient than the conventional ones.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E97.A.1556/_p
Copy
@ARTICLE{e97-a_7_1556,
author={Tomoharu SHIBUYA, Kazuki KOBAYASHI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Efficient Linear Time Encoding for LDPC Codes},
year={2014},
volume={E97-A},
number={7},
pages={1556-1567},
abstract={In this paper, we propose a new encoding method applicable to any linear codes over arbitrary finite field whose computational complexity is O(δ*n) where δ* and n denote the maximum column weight of a parity check matrix of a code and the code length, respectively. This means that if a code has a parity check matrix with the constant maximum column weight, such as LDPC codes, it can be encoded with O(n) computation. We also clarify the relation between the proposed method and conventional methods, and compare the computational complexity of those methods. Then we show that the proposed encoding method is much more efficient than the conventional ones.},
keywords={},
doi={10.1587/transfun.E97.A.1556},
ISSN={1745-1337},
month={July},}
Copy
TY - JOUR
TI - Efficient Linear Time Encoding for LDPC Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1556
EP - 1567
AU - Tomoharu SHIBUYA
AU - Kazuki KOBAYASHI
PY - 2014
DO - 10.1587/transfun.E97.A.1556
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E97-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 2014
AB - In this paper, we propose a new encoding method applicable to any linear codes over arbitrary finite field whose computational complexity is O(δ*n) where δ* and n denote the maximum column weight of a parity check matrix of a code and the code length, respectively. This means that if a code has a parity check matrix with the constant maximum column weight, such as LDPC codes, it can be encoded with O(n) computation. We also clarify the relation between the proposed method and conventional methods, and compare the computational complexity of those methods. Then we show that the proposed encoding method is much more efficient than the conventional ones.
ER -
English
