A simplified decoding algorithm for nonbinary LDPC codes

Ce Lun Liu*, Jian Ping An, Xiang Yuan Bu

*Corresponding author for this work

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

1 Citation (Scopus)

Abstract

A simplified decoding algorithm for low-density parity-check (LDPC) codes over high order Galois field is proposed to reduce the complexity of traditional sum-product algorithm (SPA). There are only addition operation and comparison operation in this algorithm, without complex multiplication operation. The computation complexity of proposed algorithm is much smaller than the SPA. The signal-to-noise power ratio (SNR) isn't needed in this algorithm, so the process of SNR estimation can also be removed. The simulation results show that the bit error rate (BER) performance of proposed algorithm degrades only about 0.5dB than the SPA, so the proposed algorithm is an efficient simplified algorithm in engineering.

Original languageEnglish
Title of host publication2009 4th International Conference on Communications and Networking in China, CHINACOM 2009
Pages277-281
Number of pages5
DOIs
Publication statusPublished - 2009
Event2009 4th International Conference on Communications and Networking in China, CHINACOM 2009 - Xian, China
Duration: 26 Aug 200928 Aug 2009

Publication series

Name2009 4th International Conference on Communications and Networking in China, CHINACOM 2009

Conference

Conference2009 4th International Conference on Communications and Networking in China, CHINACOM 2009
Country/TerritoryChina
CityXian
Period26/08/0928/08/09

Keywords

  • Block codes
  • Galois field
  • Iteration decoding
  • Minsum algorithm
  • Nonbinary LDPC codes
  • Sum-product algorithm

Fingerprint

Dive into the research topics of 'A simplified decoding algorithm for nonbinary LDPC codes'. Together they form a unique fingerprint.

Cite this