The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Reduced complexity iterative decoding of low-density parity check codes based on belief propagation
Abstract
Two simplified versions of the belief propagation algorithm for fast iterative decoding of low-density parity check codes on the additive white Gaussian noise channel are proposed. Both versions are implemented with real additions only, which greatly simplifies the decoding complexity of belief propagation in which products of probabilities have to be computed. Also, these two algorithms do not require any knowledge about the channel characteristics. Both algorithms yield a good performance-complexity trade-off and can be efficiently implemented in software as well as in hardware, with possibly quantized received values.
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
Cites
(1988) · Cited by 16,582
Low-density parity-check codes
Gallager, R. (1962) · IEEE Transactions on Information Theory · doi:10.1109/tit.1962.1057683 · Cited by 10,602
Low-Density Parity-Check Codes
Gallager, R. G. (1963) · The MIT Press eBooks · doi:10.7551/mitpress/4347.001.0001 · Cited by 4,401
Good error-correcting codes based on very sparse matrices
MacKay, D. J. C. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.748992 · Cited by 3,684
A recursive approach to low complexity codes
Tanner, R. (1981) · IEEE Transactions on Information Theory · doi:10.1109/tit.1981.1056404 · Cited by 3,138
Near Shannon limit performance of low density paritycheck codes
MacKay, D. J. C., & Neal, R. M. (1997) · Electronics Letters · doi:10.1049/el:19970362 · Cited by 2,678
Iterative decoding of binary block and convolutional codes
Hagenauer, J., Offer, E., & Papke, L. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.485714 · Cited by 2,303
A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain
Robertson, P., Villebrun, E., & Hoeher, P. (2002) · Proceedings IEEE International Conference on Communications ICC '95 · doi:10.1109/icc.1995.524253 · Cited by 1,695
Sipser, M., & Spielman, D. A. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.556667 · Cited by 931
Turbo decoding as an instance of Pearl's "belief propagation" algorithm
McEliece, R. J., MacKay, D. J. C., & Cheng, J.-F. (1998) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.661103 · Cited by 904
Fast correlation attacks on certain stream ciphers
Meier, W., & Staffelbach, O. (1989) · Journal of Cryptology · doi:10.1007/bf02252874 · Cited by 489
Iterative decoding of compound codes by probability propagation in graphical models
Kschischang, F. R., & Frey, B. J. (1998) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.661110 · Cited by 388
A decoding algorithm for binary block codes andJ-ary output channels (Corresp.)
Dorsch, B. G. (1974) · IEEE Transactions on Information Theory · doi:10.1109/tit.1974.1055217 · Cited by 117
Cited by
Secure quantum key distribution with realistic devices
Xu, F., Ma, X., Zhang, Q., Lo, H.-K., & Pan, J.-W. (2020) · Reviews of Modern Physics · doi:10.1103/revmodphys.92.025002 · Cited by 1,543
Low-density parity-check codes based on finite geometries: a rediscovery and new results
Kou, Y., Lin, S., & Fossorier, M. P. C. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.959255 · Cited by 1,302
Self-citationDecoding Algorithms for Nonbinary LDPC Codes Over GF$(q)$
Declercq, D., & Fossorier, M. (2007) · IEEE Transactions on Communications · doi:10.1109/tcomm.2007.894088 · Cited by 724
Self-citationNear optimum universal belief propagation based decoding of low-density parity check codes
Chen, J., & Fossorier, M. P. C. (2002) · IEEE Transactions on Communications · doi:10.1109/26.990903 · Cited by 661
Self-citationCellular, Wide-Area, and Non-Terrestrial IoT: A Survey on 5G Advances and the Road Toward 6G
Vaezi, M., Azari, A., Khosravirad, S. R., Shirvanimoghaddam, M., Azari, M. M., Chasaki, D., & Popovski, P. (2022) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2022.3151028 · Cited by 631
Metadata
- Authors
- Fossorier, M. P. C., Mihaljevic, M., & Imai, H.
- Venue
- IEEE Transactions on Communications
- Published
- 1999-05
- Volume
- 47
- Issue
- 5
- Pages
- 673-680
- ISSN
- 0090-6778 (ISSN-L)
- OpenAlex
- W2123530431
- Cited by
- 1,041
- References
- 13
- FWCI
- 10.68
- 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
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.