When a computational task tolerates a relaxation of its specification or when an algorithm
tolerates the effects of noise in its execution, hardware, system software, and programming …

We propose a gradient descent type bit flipping algorithm for decoding low density parity
check codes on the binary symmetric channel. Randomness introduced in the bit flipping …

We consider the problem of computing a binary linear transformation when all circuit
components are unreliable. Two models of unreliable components are considered …

We analyze the performance of quantized min-sum decoding of low-density parity-check
codes under unreliable message storage. To this end, we introduce a simple bit-level error …

This paper studies the performance of a noisy Gallager B decoder for regular LDPC codes.
We assume that the noisy decoder is subject to both transient processor errors and …

This paper investigates the behavior of the Min-Sum decoder running on noisy devices. Our
aim is to evaluate the robustness of the decoder to computation noise caused by the faulty …

In this paper, we propose a Gradient Descent Bit-Flipping (GDBF) decoding with momentum,
which considers past updates to provide inertia to the decoding process. We show that …

Computing systems are evolving rapidly. At the device level, emerging devices are
beginning to compete with traditional CMOS systems. At the architecture level, novel …

This paper deals with Low-Density Parity-Check decoders running on noisy hardware. This
represents an unconventional paradigm in communication theory, since it is traditionally …

The wide recognition that emerging nano-devices will be inherently unreliable motivates the
evaluation of information processing algorithms running on noisy hardware as well as the …