Skip to main navigation Skip to search Skip to main content

Set min-sum decoding algorithm for non-binary LDPC codes

  • Beihang University
  • Wuhan University

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

Abstract

This paper reduces the complexity of decoding non-binary low-density parity-check (LDPC) codes by set partition. In the check node update, the input vectors are partitioned into several sets such that different elements in the virtual matrix enjoy various computational strategies. As a result, the proposed algorithm achieves high computational efficiency by setting strategies according to the correct probability of these elements. Simulation results indicate that it significantly decreases the complexity of check node update with negligible performance loss.

Original languageEnglish
Title of host publicationProceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages3008-3012
Number of pages5
ISBN (Electronic)9781509018062
DOIs
StatePublished - 10 Aug 2016
Event2016 IEEE International Symposium on Information Theory, ISIT 2016 - Barcelona, Spain
Duration: 10 Jul 201615 Jul 2016

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2016-August
ISSN (Print)2157-8095

Conference

Conference2016 IEEE International Symposium on Information Theory, ISIT 2016
Country/TerritorySpain
CityBarcelona
Period10/07/1615/07/16

Keywords

  • Non-binary LDPC codes
  • check node update
  • correct probability distribution
  • set partition

Fingerprint

Dive into the research topics of 'Set min-sum decoding algorithm for non-binary LDPC codes'. Together they form a unique fingerprint.

Cite this