Presentation 2002/3/12
A Study of Decoding Algorithm of Low Density Parity Check Code
Naoto KOBAYASHI, Ryo NOMURA, Toshiyasu MATSUSHIMA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The maximum a posteriori probability decoding of Turbo Code and Low Density Parity Check Code is one of the most active subjects in research of error correcting code. Sum-Product(SP) algorithm is used for those, but the performance of SP becomes bad when a small loop of length 4 is in the Bayesian Network .An algorithm proposed by Matsushima on the probabilistic model equal to Junction Graph does not have such a fault. In this paper we propose a method of construction of (Normalized) Junction Graph using the algorithm for decoding of LDPC code, and compare the performance of it and SP.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) maximum a posteriori probability decoding / Low Density Parity check code / Junction Graph
Paper # ISEC2001-119
Date of Issue

Conference Information
Committee ISEC
Conference Date 2002/3/12(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) A Study of Decoding Algorithm of Low Density Parity Check Code
Sub Title (in English)
Keyword(1) maximum a posteriori probability decoding
Keyword(2) Low Density Parity check code
Keyword(3) Junction Graph
1st Author's Name Naoto KOBAYASHI
1st Author's Affiliation Dep. of Industrial and Management Systems Engineering Waseda University()
2nd Author's Name Ryo NOMURA
2nd Author's Affiliation Dep. of Industrial and Management Systems Engineering Waseda University
3rd Author's Name Toshiyasu MATSUSHIMA
3rd Author's Affiliation Dep. of Industrial and Management Systems Engineering Waseda University
Date 2002/3/12
Paper # ISEC2001-119
Volume (vol) vol.101
Number (no) 728
Page pp.pp.-
#Pages 6
Date of Issue