Presentation 2006-05-25
Generalization of "Algorithm E" for Decoding LDPC Codes Over GF(q)(HISC2006)
Brian M. Kurkoski, Kazuhiko Yamaguchi, Kingo Kobayashi,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) A generalization of Richardson and Urbanke's "Algorithm E" to the decoding of LDPC codes over GF(q) is given. In the proposed message-passing algorithm, the message set consists of one message for each field element, plus an erasure message. With a low message cardinality of q+1, true density evolution for this decoder is feasible, and we give explicit forms to compute the probability densities at the variable node and check node outputs. Noise thresholds are then obtained for regular LDPC codes when used on a class of q-ary discrete memoryless channels.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) q-ary LDPC codes / density evolution / discrete memoryless channel / message-passing decoding
Paper # IT2006-24
Date of Issue

Conference Information
Committee IT
Conference Date 2006/5/18(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 ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Generalization of "Algorithm E" for Decoding LDPC Codes Over GF(q)(HISC2006)
Sub Title (in English)
Keyword(1) q-ary LDPC codes
Keyword(2) density evolution
Keyword(3) discrete memoryless channel
Keyword(4) message-passing decoding
1st Author's Name Brian M. Kurkoski
1st Author's Affiliation Dept. of Information and Communication Engineering University of Electro-Communications()
2nd Author's Name Kazuhiko Yamaguchi
2nd Author's Affiliation Dept. of Information and Communication Engineering University of Electro-Communications
3rd Author's Name Kingo Kobayashi
3rd Author's Affiliation Dept. of Information and Communication Engineering University of Electro-Communications
Date 2006-05-25
Paper # IT2006-24
Volume (vol) vol.106
Number (no) 60
Page pp.pp.-
#Pages 6
Date of Issue