Two bit-flipping decoding algorithms for low-density parity-check codes

  • Authors:
  • Telex Magloire Nkouatchah Ngatched;Martin Bossert;Achim Fahrner;Fambirai Takawira

  • Affiliations:
  • Department of Electrical and Computer Engineering, University of Manitoba, Winnipeg, Manitoba, Canada and School of Electrical, Electronic and Computer Engineering, University of KwaZulu-Natal, Du ...;Department of Telecommunications and Applied Information Theory, University of Ulm, Ulm, Germany;Department of Telecommunications and Applied Information Theory, University of Ulm, Ulm, Germany;School of Electrical, Electronic and Computer Engineering, University of KwaZulu-Natal, Durban, South Africa

  • Venue:
  • IEEE Transactions on Communications
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this letter, a low complexity decoding algorithm for binary linear block codes is applied to low-density parity-check (LDPC) codes and improvements are described, namely an extension to soft-decision decoding and a loop detection mechanism. For soft decoding, only one real-valued addition per code symbol is needed, while the remaining operations are only binary as in the hard decision case. The decoding performance is considerably increased by the loop detection. Simulation results are used to compare the performance with other known decoding strategies for LDPC codes, with the result that the presented algorithms offer excellent performances at smaller complexity.