The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Efficient encoding of quasi-cyclic low-density parity-check codes
Abstract
Quasi-cyclic (QC) low-density parity-check (LDPC) codes form an important subclass of LDPC codes. These codes have encoding advantage over other types of LDPC codes. This paper addresses the issue of efficient encoding of QC-LDPC codes. Two methods are presented to find the generator matrices of QC-LDPC codes in systematic-circulant (SC) form from their parity-check matrices, given in circulant form. Based on the SC form of the generator matrix of a QC-LDPC code, various types of encoding circuits using simple shift registers are devised. It is shown that the encoding complexity of a QC-LDPC code is linearly proportional to the number of parity bits of the code for serial encoding, and to the length of the code for high-speed parallel encoding.
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
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
Error control coding : fundamentals and applications
Lin, S., & Costello, D. J. (1983) · Medical Entomology and Zoology · Cited by 4,296
Self-citationGood 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
Design of capacity-approaching irregular low-density parity-check codes
Richardson, T. J., Shokrollahi, M. A., & Urbanke, R. L. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910578 · Cited by 3,335
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
The capacity of low-density parity-check codes under message-passing decoding
Richardson, T. J., & Urbanke, R. L. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910577 · Cited by 3,065
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
Near Shannon limit performance of low density paritycheck codes
MacKay, D. J. C., & Neal, R. M. (1996) · Electronics Letters · doi:10.1049/el:19961141 · Cited by 1,923
Stiffler, J. J. (1971) · Cited by 1,438
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-citationEfficient encoding of low-density parity-check codes
Richardson, T. J., & Urbanke, R. L. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910579 · Cited by 1,028
Error Control Coding: Fundamentals and Applications
Darnell, M. (1985) · IEE Proceedings F Communications, Radar and Signal Processing · doi:10.1049/ip-f-1.1985.0011 · Cited by 991
Codes and Decoding on General Graphs
Wiberg, N. (1996) · Cited by 869
Toeplitz and Circulant Matrices: A Review
Gray, R. M. (2005) · now publishers, Inc. eBooks · doi:10.1561/9781933019680 · Cited by 759
Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding
Vasic, B., & Milenkovic, O. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.828066 · Cited by 263
Tang, H., Xu, J., Lin, S., & Abdel-Ghaffar, K. A. S. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.840867 · Cited by 176
Self-citationConstruction of Low-Density Parity-Check Codes Based on Balanced Incomplete Block Designs
Ammar, B., Honary, B., Kou, Y., Xu, J., & Lin, S. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.828144 · Cited by 157
Self-citationOn Algebraic Construction of Gallager and Circulant Low-Density Parity-Check Codes
Tang, H., Xu, J., Kou, Y., Lin, S., & Abdel-Ghaffar, K. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.828088 · Cited by 105
Self-citation
Cited by
Lan, L., Zeng, L., Tai, Y. Y., Chen, L., Lin, S., & Abdel-Ghaffar, K. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.899516 · Cited by 263
Self-citationChannel Coding for DTTB System
(2015) · Digital Terrestrial Television Broadcasting · doi:10.1002/9781119084365.ch03
Metadata
- Authors
- Li, Z., Chen, L., Zeng, L., Lin, S., & Fong, W. H.
- Venue
- IEEE Transactions on Communications
- Published
- 2006-01
- Volume
- 54
- Issue
- 1
- Pages
- 71-81
- ISSN
- 0090-6778 (ISSN-L)
- OpenAlex
- W2147776616
- Cited by
- 463
- References
- 20
- FWCI
- 47.86
- 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.