Semi-Random and Quasi-Cyclic LDPC Codes Based on Multiple Parity-Check Codes

@article{Jiang2010SemiRandomAQ,
  title={Semi-Random and Quasi-Cyclic LDPC Codes Based on Multiple Parity-Check Codes},
  author={Xueqin Jiang and Y. Yan and M. Lee},
  journal={2010 IEEE International Conference on Communications},
  year={2010},
  pages={1-5}
}
  • Xueqin Jiang, Y. Yan, M. Lee
  • Published 2010
  • Computer Science
  • 2010 IEEE International Conference on Communications
  • This paper introduces a class of Semi-Random (SR) Low-Density Parity-Check (LDPC) codes and a class of Quasi-Cyclic (QC) LDPC codes. Both of them are derived from Multiple Serially Concatenated Multiple Parity-Check (M-SC-MPC) codes and interleavers, therefore, have low encoding complexities. These two codes are called M-SR-LDPC codes and M-QC-LDPC codes, respectively, in this paper. The M-SR-LDPC codes are designed with the modified Progressive Edge-Growth (PEG) algorithm and the M-QC-LDPC… CONTINUE READING
    Design of permuted Serially Concatenated Multiple Parity-Check codes
    • 3
    • Highly Influenced
    Construct Parity-check Matrix H of QC LDPC Codes via Arithmetic Progression
    Selective bit mapping for Chinese DTMB LDPC coded QAM modulation scheme
    • 1

    References

    Publications referenced by this paper.
    SHOWING 1-7 OF 7 REFERENCES
    Large girth quasi-cyclic LDPC codes based on the chinese remainder theorem
    • 30
    LDPC codes based on serially concatenated multiple parity-check codes
    • 28
    • Highly Influential
    • Open Access
    Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
    • 828
    • Open Access
    Multiple serial and parallel concatenated single parity-check codes
    • 44
    Large Girth Non-Binary LDPC Codes Based on Finite Fields and Euclidean Geometries
    • 18
    Regular and irregular progressive edge-growth tanner graphs
    • 1,252
    • Open Access
    Girth Quasi-Cyclic LDPC Codes based on the Chinese Remainder Theorem,
    • 2009