The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Fully Parallel Stochastic LDPC Decoders
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 (FPGA) device. The implemented decoder achieves a clock frequency of 222 MHz and a throughput of about 1.66 Gb/s at$E_{b}/N_{0}={\hbox {4.25~dB}}$(a bit error rate of$10^{-8}$). It provides decoding performance within 0.5 and 0.25 dB of the floating-point sum-product algorithm with 32 and 16 iterations, respectively, and similar error-floor behavior. The decoder uses less than 40% of the lookup tables, flip-flops, and IO ports available on the FPGA device. The results provided in this paper validate the potential of stochastic LDPC decoding as a practical and competitive fully parallel decoding approach.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Factor graphs and the sum-product algorithm
Kschischang, F. R., Frey, B. J., & Loeliger, H.-A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910572 · Cited by 6,486 · cited 4×
“1This is without loss of generality since a higher degree nodes can be converted to subgraphs containing only degree three nodes [ 9 ].”
BackgroundMethodInfluential
Cited by
Approximate computing: An emerging paradigm for energy-efficient design
Han, J., & Orshansky, M. (2013) · 2013 18TH IEEE EUROPEAN TEST SYMPOSIUM (ETS) · doi:10.1109/ets.2013.6569370 · Cited by 1,098
The Promise and Challenge of Stochastic Computing
Alaghi, A., Qian, W., & Hayes, J. P. (2018) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2017.2778107 · Cited by 276
VLSI Implementation of Deep Neural Network Using Integral Stochastic Computing
Ardakani, A., Leduc-Primeau, F., Onizawa, N., Hanyu, T., & Gross, W. J. (2017) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/tvlsi.2017.2654298 · Cited by 254
Self-citation
Metadata
- Authors
- Sharifi Tehrani, S., Mannor, S., & Gross, W. J.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2008-11
- Volume
- 56
- Issue
- 11
- Pages
- 5692-5703
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2144024329
- Cited by
- 204
- References
- 1
- FWCI
- 15.36
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Fully Parallel Stochastic LDPC Decoders. https://app.cochat.ai/papers/10.1109/tsp.2008.929671
- The paper
- Sharifi Tehrani, S., Mannor, S., & Gross, W. J. (2008). Fully Parallel Stochastic LDPC Decoders. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2008.929671
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.