The DOI matches its Crossref record.
Protograph-Based Raptor-Like LDPC Codes
Open accessAbstract
This paper proposes protograph-based Raptor-like (PBRL) codes as a class of rate-compatible low-density parity-check codes for binary-input AWGN channels. As with the Raptor codes, exclusive-OR operations on precoded bits produce additional parity bits providing extensive rate compatibility. Unlike Raptor codes, each additional parity bit in the protograph is explicitly designed to optimize the density evolution threshold. During the lifting process, approximate cycle extrinsic message degree (ACE) and circulant progressive edge growth (CPEG) constraints are used to avoid undesirable graphical structures. Some density-evolution performance is sacrificed to obtain lower error floors, particularly at short block-lengths. Simulation results are shown for information block sizes of k = 1032 and 16 384. For a target frame error rate of 10-5, at each rate, the k = 1032 and 16 384 code families perform within 1 dB and 0.4 dB of both the Gallager bound and the normal approximation, respectively. The 16 384 code family outperforms the best known standardized code family, namely, the AR4JA codes. The PBRL codes also outperform DVB-S2 codes that have the advantages of longer blocklengths and outer BCH codes. Performance is similar to RC code families designed by Nguyen et al. that do not constrain codes to have the PBRL structure and involve simulation in the optimization process at each rate.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cited by
Bandwidth Efficient and Rate-Matched Low-Density Parity-Check Coded Modulation
Bocherer, G., Steiner, F., & Schulte, P. (2015) · IEEE Transactions on Communications · doi:10.1109/tcomm.2015.2494016 · Cited by 828
Ultrareliable and Low-Latency Communication Techniques for Tactile Internet Services
Kim, K. S., Kim, D. K., Chae, C.-B., Choi, S., Ko, Y.-C., Kim, J., Lim, Y.-G., Yang, M., Kim, S., Lim, B., et al. (2019) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2868995 · Cited by 166
Metadata
- Authors
- Chen, T.-Y., Vakilinia, K., Divsalar, D., & Wesel, R. D.
- Venue
- IEEE Transactions on Communications
- Published
- 2015-05
- Volume
- 63
- Issue
- 5
- Pages
- 1522-1532
- ISSN
- 0090-6778 (ISSN-L)
- 1558-0857
- OpenAlex
- W2012642489
- Cited by
- 163
- References
- 0
- FWCI
- 19.95
- Type
- journal article
- Language
- en
- Open access
- green
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: Protograph-Based Raptor-Like LDPC Codes. https://app.cochat.ai/papers/10.1109/tcomm.2015.2404842
- The paper
- Chen, T.-Y., Vakilinia, K., Divsalar, D., & Wesel, R. D. (2015). Protograph-Based Raptor-Like LDPC Codes. IEEE Transactions on Communications. https://doi.org/10.1109/tcomm.2015.2404842
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.