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 Yier Yan and Moon Ho Lee},
  journal={2010 IEEE International Conference on Communications},
  year={2010},
  pages={1-5}
}
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
7 Extracted Citations
6 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.

Referenced Papers

Publications referenced by this paper.
Showing 1-6 of 6 references

Girth Quasi-Cyclic LDPC Codes based on the Chinese Remainder Theorem,

  • Xueqin Jiang, Moon Ho Lee, “Large
  • IEEE Commun. Lett., vol. 13,
  • 2009
2 Excerpts

Similar Papers

Loading similar papers…