Presentation 2012-09-27
On Computing the Weight Spectrum of LDPC Convolutional Codes Constructed from Quasi-Cyclic Codes
Masanori HIROTOMO, Masakatu MORII,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this paper, we propose an efficient method for computing the weight spectrum of LDPC convolutional codes constructed from quasi-cyclic block codes. In the proposed method, we reduce the memory size of their parity-check matrices with the same distance profile as 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 minimum free distance and the low-part weight spectrum of LDPC convolutional codes of memory about 130.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) LDPC convolutional codes / weight spectrum / tree search algorithm / quasi-cyclic codes
Paper # IT2012-31
Date of Issue

Conference Information
Committee IT
Conference Date 2012/9/20(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Theory (IT)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) On Computing the Weight Spectrum of LDPC Convolutional Codes Constructed from Quasi-Cyclic Codes
Sub Title (in English)
Keyword(1) LDPC convolutional codes
Keyword(2) weight spectrum
Keyword(3) tree search algorithm
Keyword(4) quasi-cyclic codes
1st Author's Name Masanori HIROTOMO
1st Author's Affiliation Computer and Network Center, Saga Univerisity()
2nd Author's Name Masakatu MORII
2nd Author's Affiliation Graduate School of Engneering, Kobe University
Date 2012-09-27
Paper # IT2012-31
Volume (vol) vol.112
Number (no) 215
Page pp.pp.-
#Pages 6
Date of Issue