Improving BER performance of LDPC codes based on intermediate decoding results

  • Esa Alghonaim*
  • , Mohamed Adnan Landolsi
  • , Aiman El-Maleh
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations

Abstract

The paper presents a novel approach to reduce the bit error rate (BER) in iterative belief propagation (BP) decoding of low density parity check (LDPC) codes. The behavior of the BP algorithm is first investigated as a function of number of decoder iterations, and it is shown that typical uncorrected error patterns can be classified into 3 categories: oscillating, nearly-constant, or randomlike, with a predominance of oscillating patterns at high Signal-to-Noise (SNR) values. A proposed decoder modification is then introduced based on tracking the number of failed parity check equations in the intermediate decoding iterations, rather than relying on the final decoder output (after reaching the maximum number of iterations). Simulation results with a rate 1/2 (1024, 512) progressive edge-growth (PEG) LDPC code show that the proposed modification can decrease the BER by as much as 10-to-40%, particularly for high SNR values.

Original languageEnglish
Title of host publicationICSPC 2007 Proceedings - 2007 IEEE International Conference on Signal Processing and Communications
Pages1547-1550
Number of pages4
DOIs
StatePublished - 2007

Publication series

NameICSPC 2007 Proceedings - 2007 IEEE International Conference on Signal Processing and Communications

Keywords

  • BER performance
  • Belief propagation iterative decoding
  • Error correction coding
  • LDPC codes

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Signal Processing
  • Communication

Fingerprint

Dive into the research topics of 'Improving BER performance of LDPC codes based on intermediate decoding results'. Together they form a unique fingerprint.

Cite this