arXiv (All)
open access
Low-Latency LDPC Decoding Based on Consensus and Return Residual Belief Propagation
We propose two new decoding algorithms for low-density parity-check (LDPC) codes. The Consensus and Return residual belief propagation (C&R-RBP) algorithm reduces the number of iterations required to achieve a target decoding error rate over an AWGN channel by exploiting the availability of updated
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Limits of Weight-Bounded Redundant Checks for Peeling Decoding of Random Regular LDPC Codes#1201273
- Learning LDPC codes with density evolution over relaxed protographs#1202144
- Statistical mechanics of broadcast channels using low-density parity-check codes#230080
- Critical noise levels for LDPC decoding#978338
- Improved rate-compatible low-density parity-check codes with applications to wireless channels#284559
Record · ID 1325283
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive