A scaling method for stochastic LDPC decoding over the binary symmetric channel

Abstract

Stochastic decoding is a decoding algorithm for Low-Density Parity-Check (LDPC) codes that leads to lowered routing congestion. Randomization is crucial for generating stochastic bits in stochastic decoders. In this paper, we propose a scaling method for stochastic LDPC decoding over the binary symmetric channel model that is independent of the channel error probability, and thus reduces the complexity in the conversion of received messages into stochastic streams. The scaling method not only improves the error rate performance, but lowers the error floor for stochastic decoding.