TY - GEN
T1 - Hard-decision decoding of LDPC codes under timing errors
T2 - 25th Telecommunications Forum, TELFOR 2017
AU - Brkic, Srdan
AU - Ivanis, Predrag
AU - Vasić, Bane
N1 - Funding Information:
ACKNOWLEDGEMENT This work was supported by the Serbian Ministry of Science under project TR32028, and in part by the NSF under Grant ECCS-1500170, and the Indo-US Science and Technology Forum (IUSSTF) through the Joint Networked Center for Data Storage Research (JC-16-2014-US). The results presented in this paper are in parts published in IEEE Transactions on Information Theory, IEEE Communication Letters and presented at IEEE International Symposium on Information Theory 2014 and 2016 and Information Theory Workshop 2015.
Funding Information:
This work was supported by the Serbian Ministry of Science under project TR32028, and in part by the NSF under Grant ECCS-1500170, and the Indo-US Science and Technology Forum (IUSSTF) through the Joint Networked Center for Data Storage Research (JC-16-2014-US). The results presented in this paper are in parts published in IEEE Transactions on Information Theory, IEEE Communication Letters and presented at IEEE International Symposium on Information Theory 2014 and 2016 and Information Theory Workshop 2015.
Publisher Copyright:
© 2017 IEEE.
PY - 2018/1/5
Y1 - 2018/1/5
N2 - This paper contains a survey on iterative decoders of low-density parity-check (LDPC) codes built form unreliable logic gates. We assume that hardware unreliability comes from supply voltage reduction, which causes probabilistic gate failures, called timing errors. We are able to demonstrate robustness of simple Gallager B decoder to timing errors, when applied on codes free of small trapping sets, as well as positive effects that timing errors have on the decoding of codes with contain small trapping sets. Furthermore, we show that concept of guaranteed error correction can be applied to the decoders made partially from unreliable components. In contrast to the decoding under uncorrelated gate failures, we prove that bit-flipping decoding under timing errors can achieve arbitrary low error probability. Consequently, we formulate condition sufficient that memory architecture, which employs bit-flipping decoder, preserved all stored information.
AB - This paper contains a survey on iterative decoders of low-density parity-check (LDPC) codes built form unreliable logic gates. We assume that hardware unreliability comes from supply voltage reduction, which causes probabilistic gate failures, called timing errors. We are able to demonstrate robustness of simple Gallager B decoder to timing errors, when applied on codes free of small trapping sets, as well as positive effects that timing errors have on the decoding of codes with contain small trapping sets. Furthermore, we show that concept of guaranteed error correction can be applied to the decoders made partially from unreliable components. In contrast to the decoding under uncorrelated gate failures, we prove that bit-flipping decoding under timing errors can achieve arbitrary low error probability. Consequently, we formulate condition sufficient that memory architecture, which employs bit-flipping decoder, preserved all stored information.
KW - Bit-flipping
KW - Gallager B
KW - data-dependence
KW - fault-tolerance
KW - low-density parity-check codes
KW - timing errors
UR - http://www.scopus.com/inward/record.url?scp=85045834902&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85045834902&partnerID=8YFLogxK
U2 - 10.1109/TELFOR.2017.8249332
DO - 10.1109/TELFOR.2017.8249332
M3 - Conference contribution
AN - SCOPUS:85045834902
T3 - 2017 25th Telecommunications Forum, TELFOR 2017 - Proceedings
SP - 1
EP - 8
BT - 2017 25th Telecommunications Forum, TELFOR 2017 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 21 November 2017 through 22 November 2017
ER -