Presentation 2011-03-03
Constructing Algorithms of Large-Girth LDPC Codes Based on the Shortest Paths in Tanner Graphs
Kenya SUGIHARA, Hideo YOSHIDA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) It is known that the error floor performance of LDPC codes depends on the girth in the underlying Tanner graphs. In this paper, we first show the relation between the length of the shortest paths and that of cycles in the Tanner graphs. Next, we derive an algorithm that calculates the length of shortest path. By means of this algorithm, we show a method of constructing LDPC codes with a desired girth. Moreover, we propose the developed method of constructing QC LDPC codes. We also present the comparison between our proposed method and known methods by computer experiment.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) LDPC code / parity-check matrix / girth / shortest path
Paper # IT2010-79,ISEC2010-83,WBS2010-58
Date of Issue

Conference Information
Committee ISEC
Conference Date 2011/2/24(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 Security (ISEC)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Constructing Algorithms of Large-Girth LDPC Codes Based on the Shortest Paths in Tanner Graphs
Sub Title (in English)
Keyword(1) LDPC code
Keyword(2) parity-check matrix
Keyword(3) girth
Keyword(4) shortest path
1st Author's Name Kenya SUGIHARA
1st Author's Affiliation Information Technology R&D Center, Mitsubishi Electric Corporation()
2nd Author's Name Hideo YOSHIDA
2nd Author's Affiliation Information Technology R&D Center, Mitsubishi Electric Corporation
Date 2011-03-03
Paper # IT2010-79,ISEC2010-83,WBS2010-58
Volume (vol) vol.110
Number (no) 443
Page pp.pp.-
#Pages 6
Date of Issue