Bounds on the thresholds of non-binary LDPC codes

Oron Levi, David Burshtein

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

Abstract

LDPC codes over non-binary Galois fields were proposed for reliable transmission over arbitrary discrete memoryless channels and in particular for transmission in the bandwidth efficient regime. It was shown that some properties, originally derived for binary LDPC codes, extend to the appropriately defined non-binary ensemble. However, the extension of density evolution to this ensemble results in a prohibitive computational complexity. In this paper we analyze the performance by tracking the evolution of the Bhattacharya noise parameter associated with the decoding messages, and derive upper and lower bounds on its evolution. These bounds are then used to obtain upper and lower bounds on the asymptotic threshold required for reliable communication.

Original languageEnglish
Title of host publication2008 IEEE 25th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2008
Pages348-352
Number of pages5
DOIs
StatePublished - 2008
Event2008 IEEE 25th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2008 - Eilat, Israel
Duration: 3 Dec 20085 Dec 2008

Publication series

NameIEEE Convention of Electrical and Electronics Engineers in Israel, Proceedings

Conference

Conference2008 IEEE 25th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2008
Country/TerritoryIsrael
CityEilat
Period3/12/085/12/08

Keywords

  • Iterative decoding
  • Low-density parity-check (LDPC) codes
  • Nonbinary codes

Fingerprint

Dive into the research topics of 'Bounds on the thresholds of non-binary LDPC codes'. Together they form a unique fingerprint.

Cite this