Presentation 2005-03-17
Design of LDPC codes using degree distributions of Tanner graphs
Shinya MIYAMOTO, Kenta KASAI, Kohichi SAKANIWA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Decoding performance of LDPC(Low-Density Parity-Check) codes over a binary erasure channel(BEC) is highly dependent on the degree distributions of the Tanner graphs. We compare two types of LDPC code ensembles having uniform degree distributions and non-uniform ones respectively. Then we provide a sufficient condition for the erasure probability of a BEC for which the decoding performance for the ensembles with uniform degree distributions is superior to that with non-uniform ones.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Low-Density Parity-Check Codes / Density Evolution / Belief Propagation
Paper # IT2004-60,ISEC2004-116,WBS2004-175
Date of Issue

Conference Information
Committee ISEC
Conference Date 2005/3/10(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) Design of LDPC codes using degree distributions of Tanner graphs
Sub Title (in English)
Keyword(1) Low-Density Parity-Check Codes
Keyword(2) Density Evolution
Keyword(3) Belief Propagation
1st Author's Name Shinya MIYAMOTO
1st Author's Affiliation Dept. of Computer Science, Tokyo Institute of Techonology()
2nd Author's Name Kenta KASAI
2nd Author's Affiliation Dept. of Communications and Integrated Systems, Tokyo Institute of Techonology
3rd Author's Name Kohichi SAKANIWA
3rd Author's Affiliation Dept. of Communications and Integrated Systems, Tokyo Institute of Techonology
Date 2005-03-17
Paper # IT2004-60,ISEC2004-116,WBS2004-175
Volume (vol) vol.104
Number (no) 731
Page pp.pp.-
#Pages 6
Date of Issue