A Cycle Search Algorithm Based on a Message-Passing for the Design of Good LDPC Codes

Sang Hyun LEE
Kwang Soon KIM
Yun Hee KIM
Jae Young AHN

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E88-A    No.6    pp.1599-1604
Publication Date: 2005/06/01
Online ISSN: 
DOI: 10.1093/ietfec/e88-a.6.1599
Print ISSN: 0916-8508
Type of Manuscript: PAPER
Category: Coding Theory
Keyword: 
LDPC codes,  message-passing decoding,  cycle search,  

Full Text: PDF(510.5KB)>>
Buy this Article


Summary: 
A cycle search algorithm based on a message-passing in a Tanner graph is proposed for designing good LDPC codes. By applying the message-passing algorithm with a message alphabet composed of only two messages to a cycle search, we can perform a cycle search with less computational complexity than tree-based search algorithms. Also, the proposed algorithm can be easily implemented by using an existing message-passing decoder and can easily adopt different kind of criteria for an LDPC code design with a slight modification in the node update equations.

open access publishing via