Improved Belief Propagation (BP) decoding for LDPC codes with a large number of short cycles

Kyuhyuk Chung, Jun Heo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

15 Citations (Scopus)

Abstract

In this paper, we improve performance of Low Density Parity Check (LDPC) codes by adding a large number of short cycles. Short cycles, especially cycles of length 4, degrade performance of LDPC codes if the standard BP (Belief Propagation) decoding is used. Therefore current researches have focused on removing cycles of length 4 for designing good performance LDPC codes. We found that a large number of cycles of length 4 improve performance of LDPC codes if a modified BP decoding is used. We present the modified BP decoding algorithm for LDPC codes with a large number of short cycles. We show that the modified BP decoding performance of LDPC codes with a large number of short cycles is better than the standard BP decoding performance of LDPC codes designed by avoiding short cycles.

Original languageEnglish
Title of host publication2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring - Proceedings
Pages1464-1466
Number of pages3
Publication statusPublished - 2006
Event2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring - Melbourne, Australia
Duration: 2006 May 72006 Jul 10

Publication series

NameIEEE Vehicular Technology Conference
Volume3
ISSN (Print)1550-2252

Other

Other2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring
Country/TerritoryAustralia
CityMelbourne
Period06/5/706/7/10

Keywords

  • Belief propagation decoding
  • Bipartite graph
  • LDPC codes
  • Parity check
  • Short cycles

ASJC Scopus subject areas

  • Computer Science Applications
  • Electrical and Electronic Engineering
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Improved Belief Propagation (BP) decoding for LDPC codes with a large number of short cycles'. Together they form a unique fingerprint.

Cite this