TY - GEN
T1 - Estimation of the decoding threshold of LDPC codes over the q-ary partial erasure channel
AU - Cohen, Rami
AU - Cassuto, Yuval
N1 - Publisher Copyright: © 2014 IEEE.
PY - 2014/11/12
Y1 - 2014/11/12
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84911871382&partnerID=8YFLogxK
U2 - https://doi.org/10.1109/ISTC.2014.6955113
DO - https://doi.org/10.1109/ISTC.2014.6955113
M3 - منشور من مؤتمر
T3 - International Symposium on Turbo Codes and Iterative Information Processing, ISTC
SP - 198
EP - 202
BT - International Symposium on Turbo Codes and Iterative Information Processing, ISTC
T2 - 2014 8th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2014
Y2 - 18 August 2014 through 22 August 2014
ER -