IEICE TRANSACTIONS on Fundamentals
A Method for Computing the Weight Spectrum of LDPC Convolutional Codes Based on Circulant Matrices
Summary :
In this paper, we propose an efficient method for computing the weight spectrum of LDPC convolutional codes based on circulant matrices of quasi-cyclic codes. In the proposed method, we reduce the memory size of their parity-check matrices with the same distance profile as the original codes, and apply a forward and backward tree search algorithm to the parity-check matrices of reduced memory. We show numerical results of computing the free distance and the low-part weight spectrum of LDPC convolutional codes of memory about 130.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E97-A No.12 pp.2300-2308
- Publication Date
- 2014/12/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E97.A.2300
- Type of Manuscript
- Special Section PAPER (Special Section on Information Theory and Its Applications)
- Category
- Coding Theory
Authors
Masanori HIROTOMO
Saga University
Masakatu MORII
Kobe 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
Masanori HIROTOMO, Masakatu MORII, "A Method for Computing the Weight Spectrum of LDPC Convolutional Codes Based on Circulant Matrices" in IEICE TRANSACTIONS on Fundamentals,
vol. E97-A, no. 12, pp. 2300-2308, December 2014, doi: 10.1587/transfun.E97.A.2300.
Abstract: In this paper, we propose an efficient method for computing the weight spectrum of LDPC convolutional codes based on circulant matrices of quasi-cyclic codes. In the proposed method, we reduce the memory size of their parity-check matrices with the same distance profile as the original codes, and apply a forward and backward tree search algorithm to the parity-check matrices of reduced memory. We show numerical results of computing the free distance and the low-part weight spectrum of LDPC convolutional codes of memory about 130.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E97.A.2300/_p
Copy
@ARTICLE{e97-a_12_2300,
author={Masanori HIROTOMO, Masakatu MORII, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Method for Computing the Weight Spectrum of LDPC Convolutional Codes Based on Circulant Matrices},
year={2014},
volume={E97-A},
number={12},
pages={2300-2308},
abstract={In this paper, we propose an efficient method for computing the weight spectrum of LDPC convolutional codes based on circulant matrices of quasi-cyclic codes. In the proposed method, we reduce the memory size of their parity-check matrices with the same distance profile as the original codes, and apply a forward and backward tree search algorithm to the parity-check matrices of reduced memory. We show numerical results of computing the free distance and the low-part weight spectrum of LDPC convolutional codes of memory about 130.},
keywords={},
doi={10.1587/transfun.E97.A.2300},
ISSN={1745-1337},
month={December},}
Copy
TY - JOUR
TI - A Method for Computing the Weight Spectrum of LDPC Convolutional Codes Based on Circulant Matrices
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2300
EP - 2308
AU - Masanori HIROTOMO
AU - Masakatu MORII
PY - 2014
DO - 10.1587/transfun.E97.A.2300
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E97-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2014
AB - In this paper, we propose an efficient method for computing the weight spectrum of LDPC convolutional codes based on circulant matrices of quasi-cyclic codes. In the proposed method, we reduce the memory size of their parity-check matrices with the same distance profile as the original codes, and apply a forward and backward tree search algorithm to the parity-check matrices of reduced memory. We show numerical results of computing the free distance and the low-part weight spectrum of LDPC convolutional codes of memory about 130.
ER -
English
