Estimation of the decoding threshold of LDPC codes over the q-ary partial erasure channel

Rami Cohen, Yuval Cassuto

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

Abstract

In this paper, we discuss bounds and approximations for the decoding threshold of LDPC codes over the q-ary partial erasure channel (QPEC), introduced in [1]. The QPEC has a q-ary input, and its output is either one symbol or a set of 2 ≤ M ≤ q possible symbols. We show how an upper bound on the decoding threshold can be derived using a single-letter recurrence relation, when M > q/2. In addition, we discuss complexity issues in the calculation of the threshold, and provide two approximation models that lead to reasonable results with a fraction of the complexity required for the exact calculation.

Original languageEnglish
Title of host publicationInternational Symposium on Turbo Codes and Iterative Information Processing, ISTC
Pages198-202
Number of pages5
ISBN (Electronic)9781479959853
DOIs
StatePublished - 12 Nov 2014
Event2014 8th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2014 - Bremen, Germany
Duration: 18 Aug 201422 Aug 2014

Publication series

NameInternational Symposium on Turbo Codes and Iterative Information Processing, ISTC

Conference

Conference2014 8th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2014
Country/TerritoryGermany
CityBremen
Period18/08/1422/08/14

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Information Systems
  • Theoretical Computer Science

Fingerprint

Dive into the research topics of 'Estimation of the decoding threshold of LDPC codes over the q-ary partial erasure channel'. Together they form a unique fingerprint.

Cite this