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 rule makes this class of decoders not only superior to other decoding algorithms of this type, but also robust to logic-gate failures. We report a surprising discovery that for a broad range of gate failure probability our decoders actually benefit from faults in logic gates which serve as an inherent source of randomness and help the decoding algorithm to escape from local minima associated with trapping sets.
- Bit-flipping algorithm
- decoding by unreliable hardware
- low-density parity check codes
ASJC Scopus subject areas
- Modeling and Simulation
- Computer Science Applications
- Electrical and Electronic Engineering