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

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)1599-1604
Number of pages6
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE88-A
Issue number6
DOIs
Publication statusPublished - 2005 Jun

Keywords

  • Cycle search
  • LDPC codes
  • Message-passing decoding

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics

Fingerprint Dive into the research topics of 'A cycle search algorithm based on a message-passing for the design of good LDPC codes'. Together they form a unique fingerprint.

  • Cite this