A hybrid low complexity decoding of LDPC codes

Hua Wang*, Guangrong Fan, Jingming Kuang

*Corresponding author for this work

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

2 Citations (Scopus)

Abstract

An efficient early stopping criterion based on the evolution of the number of reliable variable nodes (NRVN) is proposed for low density parity check (LDPC) codes in this paper. This criterion can significantly reduce the average number of iterations (ANI) at low to middle signal to noise ratios (SNRs) with minimal performance degradation. Furthermore, a hybrid decoding method is presented to reduce the decoding complexity of LDPC codes by combining the proposed stopping criterion and forced convergence (FC) decoding algorithm. Compared with the classic belief propagation (BP) decoding, significant computation complexity reduction can be achieved with small computation overhead.

Original languageEnglish
Title of host publicationIET 3rd International Conference on Wireless, Mobile and Multimedia Networks, ICWMMN 2010
Pages108-112
Number of pages5
Edition569 CP
DOIs
Publication statusPublished - 2010
EventIET 3rd International Conference on Wireless, Mobile and Multimedia Networks, ICWMMN 2010 - Beijing, China
Duration: 26 Sept 201029 Sept 2010

Publication series

NameIET Conference Publications
Number569 CP
Volume2010

Conference

ConferenceIET 3rd International Conference on Wireless, Mobile and Multimedia Networks, ICWMMN 2010
Country/TerritoryChina
CityBeijing
Period26/09/1029/09/10

Keywords

  • Early stopping criterion
  • Iterative decoding
  • LDPC codes
  • Reduced complexity decoding

Fingerprint

Dive into the research topics of 'A hybrid low complexity decoding of LDPC codes'. Together they form a unique fingerprint.

Cite this