2008
DOI: 10.1109/tsp.2008.929671
|View full text |Cite
|
Sign up to set email alerts
|

Fully Parallel Stochastic LDPC Decoders

Abstract: Abstract-Stochastic decoding is a new approach to iterative decoding on graphs. This paper presents a hardware architecture for fully parallel stochastic low-density parity-check (LDPC) decoders. To obtain the characteristics of the proposed architecture, we apply this architecture to decode an irregular state-of-the-art (1056,528) LDPC code on a Xilinx Virtex-4 LX200 field-programmable gate-array ( Index Terms-Field programmable gate arrays (FPGAs), iterative decoding, low-density parity-check (LDPC) codes , … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
68
0

Year Published

2009
2009
2021
2021

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 183 publications
(71 citation statements)
references
References 43 publications
0
68
0
Order By: Relevance
“…A decoding cycle corresponds to 1 bit being processed by the variable nodes, sent to the check nodes and sent back to the variable nodes. We note that a decoding cycle in a stochastic decoding algorithm is not equivalent to an iteration in a message passing algorithm such as SPA [7]. The code used for the simulations is a (6, 32)-regular RS-based LDPC code of size 2048 and rate 0.84, which has a girth of 6.…”
Section: Simulation Results For the Rhs Algorithmmentioning
confidence: 99%
See 4 more Smart Citations
“…A decoding cycle corresponds to 1 bit being processed by the variable nodes, sent to the check nodes and sent back to the variable nodes. We note that a decoding cycle in a stochastic decoding algorithm is not equivalent to an iteration in a message passing algorithm such as SPA [7]. The code used for the simulations is a (6, 32)-regular RS-based LDPC code of size 2048 and rate 0.84, which has a girth of 6.…”
Section: Simulation Results For the Rhs Algorithmmentioning
confidence: 99%
“…The results reported in [7] reduce the upper limit to 700 iterations, but the performance is approximately 0.5 dB away from 32-iterations floating-point SPA (at a BER of 10 −8 ). A very attractive aspect of stochastic decoders is that they only require two wires per bidirectional edge of the Tanner graph, therefore bringing the circuit's interconnect to its simplest expression.…”
Section: Introductionmentioning
confidence: 85%
See 3 more Smart Citations