A Novel Stochastic Decoding of LDPC Codes with Quantitative Guarantees

05/25/2014
by   Nima Noorshams, et al.
0

Low-density parity-check codes, a class of capacity-approaching linear codes, are particularly recognized for their efficient decoding scheme. The decoding scheme, known as the sum-product, is an iterative algorithm consisting of passing messages between variable and check nodes of the factor graph. The sum-product algorithm is fully parallelizable, owing to the fact that all messages can be update concurrently. However, since it requires extensive number of highly interconnected wires, the fully-parallel implementation of the sum-product on chips is exceedingly challenging. Stochastic decoding algorithms, which exchange binary messages, are of great interest for mitigating this challenge and have been the focus of extensive research over the past decade. They significantly reduce the required wiring and computational complexity of the message-passing algorithm. Even though stochastic decoders have been shown extremely effective in practice, the theoretical aspect and understanding of such algorithms remains limited at large. Our main objective in this paper is to address this issue. We first propose a novel algorithm referred to as the Markov based stochastic decoding. Then, we provide concrete quantitative guarantees on its performance for tree-structured as well as general factor graphs. More specifically, we provide upper-bounds on the first and second moments of the error, illustrating that the proposed algorithm is an asymptotically consistent estimate of the sum-product algorithm. We also validate our theoretical predictions with experimental results, showing we achieve comparable performance to other practical stochastic decoders.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/15/2020

Matched Quantized Min-Sum Decoding of Low-Density Parity-Check Codes

A quantized message passing decoding algorithm for low-density parity-ch...
research
01/09/2019

Binary Message Passing Decoding of Product Codes Based on Generalized Minimum Distance Decoding

We propose a binary message passing decoding algorithm for product codes...
research
02/10/2019

Binary Message Passing Decoding of Product-like Codes

We propose a novel binary message passing decoding algorithm for product...
research
10/21/2018

Decoding of Non-Binary LDPC Codes Using the Information Bottleneck Method

Recently, a novel lookup table based decoding method for binary low-dens...
research
12/01/2010

Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function

We present a combinatorial characterization of the Bethe entropy functio...
research
03/16/2017

A 594 Gbps LDPC Decoder Based on Finite-Alphabet Message Passing

An ultra-high throughput low-density parity check (LDPC) decoder with an...
research
11/07/2019

Performance Bounds and Estimates for Quantized LDPC Decoders

The performance of low-density parity-check (LDPC) codes at high signal-...

Please sign up or login with your details

Forgot password? Click here to reset