Faulty Gallager-B decoding with optimal message repetition

Leduc-Primeau, François; Gross, Warren J.

doi:10.1109/allerton.2012.6483266

Cited by 29 publications

(21 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The above works either consider permanent [19] or transient [14], [16], [18]- [22] errors. When permanent errors are considered, it is assumed that components in defect always return the 0090-6778 © 2015 IEEE.…”

mentioning

confidence: 99%

Analysis and Design of Finite Alphabet Iterative Decoders Robust to Faulty Hardware

Dupraz

Declercq

Vasić

et al. 2015

IEEE Trans. Commun.

View full text Add to dashboard Cite

This paper addresses the problem of designing lowdensity parity check decoders robust to transient errors introduced by faulty hardware. We assume that the faulty hardware introduces errors during the message-passing updates, and we propose a general framework for the definition of the message update faulty functions. Within this framework, we define symmetry conditions for the faulty functions and derive two simple error models used in the analysis. With this analysis, we propose a new interpretation of the functional density evolution threshold introduced by Kameni et al. in the recent literature and show its limitations in the case of highly unreliable hardware. However, we show that under restricted decoder noise conditions, the functional threshold can be used to predict the convergence behavior of finite alphabet iterative decoders (FAIDs) under faulty hardware. In particular, we reveal the existence of robust and nonrobust FAIDs and propose a framework for the design of robust decoders. We finally illustrate robust-and nonrobust-decoder behaviors of finite-length codes using Monte Carlo simulations.

show abstract

mentioning

confidence: 99%

Analysis and Design of Finite Alphabet Iterative Decoders Robust to Faulty Hardware

Dupraz

Declercq

Vasić

et al. 2015

IEEE Trans. Commun.

View full text Add to dashboard Cite

show abstract

“…failures (von Neumann failure model) [4]- [6]. Due to the decoder asymmetry, the density evolution technique cannot be applied to the timing error model, when failures are present in the first iteration.…”

Section: Numerical Resultsmentioning

confidence: 99%

On Fault Tolerance of the Gallager B Decoder Under Data-Dependent Gate Failures

et al. 2015

View full text Add to dashboard Cite

In this letter, we characterize the effect of datadependent gate failures on the performance of the Gallager B decoder of low-density parity-check codes. We show that this type of failures makes the decoder dependent on a transmitted codeword, thus rendering inapplicable the traditional analysis tools such as density evolution and trapping sets. By using Monte Carlo simulations, we identify two operating regions: one in which hardware unreliability leads to significant performance degradation and another in which the performance loss is negligible. Based on these results, we propose a simple modification of the decoder that ensures its fault tolerance.

show abstract

“…As shown in Figure 2, where the model shown as Figure 2(a) is adopted in [4,5,7], the model shown as Figure 2(b) is adopted in [8,9]. These models are both assumed to connect the error-free operation results with error channels, such as the binary symmetric channel (BSC) or the additive white Gaussian noise (AWGN) channel.…”

Section: Error Model Of Memorymentioning

confidence: 99%

“…Varshney considered the thresholds and residual errors of LDPC codes with the faulty Gallager A decoding in the earlier stage [4]. Extended studies on faulty Gallager B decoders were then developed in [5][6][7]. Besides these bit flipping decoding algorithms, the belief propagation (BP) decoding of LDPC on noisy hardware was studied in [8,9], where infinite-precision message with additive Gaussian noise was considered.…”

Section: Introductionmentioning

confidence: 99%

Design and Analysis of Adaptive Message Coding on LDPC Decoder with Faulty Storage

Yin

2018

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

Unreliable message storage severely degrades the performance of LDPC decoders. This paper discusses the impacts of message errors on LDPC decoders and schemes improving the robustness. Firstly, we develop a discrete density evolution analysis for faulty LDPC decoders, which indicates that protecting the sign bits of messages is effective enough for finite-precision LDPC decoders. Secondly, we analyze the effects of quantization precision loss for static sign bit protection and propose an embedded dynamic coding scheme by adaptively employing the least significant bits (LSBs) to protect the sign bits. Thirdly, we give a construction of Hamming product code for the adaptive coding and present low complexity decoding algorithms. Theoretic analysis indicates that the proposed scheme outperforms traditional triple modular redundancy (TMR) scheme in decoding both threshold and residual errors, while Monte Carlo simulations show that the performance loss is less than 0.2 dB when the storage error probability varies from 10 −3 to 10 −4 .

show abstract

Faulty Gallager-B decoding with optimal message repetition

Cited by 29 publications

References 9 publications

Analysis and Design of Finite Alphabet Iterative Decoders Robust to Faulty Hardware

Analysis and Design of Finite Alphabet Iterative Decoders Robust to Faulty Hardware

On Fault Tolerance of the Gallager B Decoder Under Data-Dependent Gate Failures

Design and Analysis of Adaptive Message Coding on LDPC Decoder with Faulty Storage

Contact Info

Product

Resources

About