A Cycle Search Algorithm Based on a Message-Passing for the Design of Good LDPC Codes
Sang Hyun Lee · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 2005
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.