Regular quasi-cyclic LDPC codes with girth 6 from prime fields

Qingji Zheng; Xiangxue Li; Dong Zheng; Baoan Guo

doi:10.1109/IIHMSP.2010.120

Regular quasi-cyclic LDPC codes with girth 6 from prime fields

Qingji Zheng
, Xiangxue Li^*
, Dong Zheng
, Baoan Guo

^*Corresponding author for this work

Software Engineering Institute

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

Abstract

The short paper proposes a method for constructing regular quasi-cyclic (QC) LDPC codes based on circulant permutation matrices via simple prime field operations. The main advantage is that regular QC LDPC codes with a variety of block lengths and rates can be easily constructed which have no cycles of length four or less. Simulation results show that within only a maximum of ten decoding iterations of sum-product algorithm(SPA) the constructed regular codes of high rates have no error floor down to the bit-error rate of 10^-7.

Original language	English
Title of host publication	Proceedings - 2010 6th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIHMSP 2010
Pages	470-473
Number of pages	4
DOIs	https://doi.org/10.1109/IIHMSP.2010.120
State	Published - 2010
Event	6th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIHMSP 2010 - Darmstadt, Germany Duration: 15 Oct 2010 → 17 Oct 2010

Publication series

Name	Proceedings - 2010 6th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIHMSP 2010

Conference

Conference	6th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIHMSP 2010
Country/Territory	Germany
City	Darmstadt
Period	15/10/10 → 17/10/10

Keywords

Error floor
Prime field
Quasi-cyclic LDPC
Shannon limit

Access to Document

10.1109/IIHMSP.2010.120

Cite this

Zheng, Q., Li, X., Zheng, D., & Guo, B. (2010). Regular quasi-cyclic LDPC codes with girth 6 from prime fields. In Proceedings - 2010 6th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIHMSP 2010 (pp. 470-473). Article 5635634 (Proceedings - 2010 6th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIHMSP 2010). https://doi.org/10.1109/IIHMSP.2010.120

Zheng, Qingji ; Li, Xiangxue ; Zheng, Dong et al. / Regular quasi-cyclic LDPC codes with girth 6 from prime fields. Proceedings - 2010 6th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIHMSP 2010. 2010. pp. 470-473 (Proceedings - 2010 6th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIHMSP 2010).

@inproceedings{1c48f11c3205429099ed9f37d3566cfe,

title = "Regular quasi-cyclic LDPC codes with girth 6 from prime fields",

abstract = "The short paper proposes a method for constructing regular quasi-cyclic (QC) LDPC codes based on circulant permutation matrices via simple prime field operations. The main advantage is that regular QC LDPC codes with a variety of block lengths and rates can be easily constructed which have no cycles of length four or less. Simulation results show that within only a maximum of ten decoding iterations of sum-product algorithm(SPA) the constructed regular codes of high rates have no error floor down to the bit-error rate of 10-7.",

keywords = "Error floor, Prime field, Quasi-cyclic LDPC, Shannon limit",

author = "Qingji Zheng and Xiangxue Li and Dong Zheng and Baoan Guo",

year = "2010",

doi = "10.1109/IIHMSP.2010.120",

language = "英语",

isbn = "9780769542225",

series = "Proceedings - 2010 6th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIHMSP 2010",

pages = "470--473",

booktitle = "Proceedings - 2010 6th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIHMSP 2010",

note = "6th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIHMSP 2010 ; Conference date: 15-10-2010 Through 17-10-2010",

}

Zheng, Q, Li, X, Zheng, D & Guo, B 2010, Regular quasi-cyclic LDPC codes with girth 6 from prime fields. in Proceedings - 2010 6th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIHMSP 2010., 5635634, Proceedings - 2010 6th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIHMSP 2010, pp. 470-473, 6th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIHMSP 2010, Darmstadt, Germany, 15/10/10. https://doi.org/10.1109/IIHMSP.2010.120

Regular quasi-cyclic LDPC codes with girth 6 from prime fields. / Zheng, Qingji; Li, Xiangxue; Zheng, Dong et al.
Proceedings - 2010 6th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIHMSP 2010. 2010. p. 470-473 5635634 (Proceedings - 2010 6th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIHMSP 2010).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Regular quasi-cyclic LDPC codes with girth 6 from prime fields

AU - Zheng, Qingji

AU - Li, Xiangxue

AU - Zheng, Dong

AU - Guo, Baoan

PY - 2010

Y1 - 2010

N2 - The short paper proposes a method for constructing regular quasi-cyclic (QC) LDPC codes based on circulant permutation matrices via simple prime field operations. The main advantage is that regular QC LDPC codes with a variety of block lengths and rates can be easily constructed which have no cycles of length four or less. Simulation results show that within only a maximum of ten decoding iterations of sum-product algorithm(SPA) the constructed regular codes of high rates have no error floor down to the bit-error rate of 10-7.

AB - The short paper proposes a method for constructing regular quasi-cyclic (QC) LDPC codes based on circulant permutation matrices via simple prime field operations. The main advantage is that regular QC LDPC codes with a variety of block lengths and rates can be easily constructed which have no cycles of length four or less. Simulation results show that within only a maximum of ten decoding iterations of sum-product algorithm(SPA) the constructed regular codes of high rates have no error floor down to the bit-error rate of 10-7.

KW - Error floor

KW - Prime field

KW - Quasi-cyclic LDPC

KW - Shannon limit

UR - https://www.scopus.com/pages/publications/78650499355

U2 - 10.1109/IIHMSP.2010.120

DO - 10.1109/IIHMSP.2010.120

M3 - 会议稿件

AN - SCOPUS:78650499355

SN - 9780769542225

T3 - Proceedings - 2010 6th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIHMSP 2010

SP - 470

EP - 473

BT - Proceedings - 2010 6th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIHMSP 2010

T2 - 6th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIHMSP 2010

Y2 - 15 October 2010 through 17 October 2010

ER -

Zheng Q, Li X, Zheng D, Guo B. Regular quasi-cyclic LDPC codes with girth 6 from prime fields. In Proceedings - 2010 6th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIHMSP 2010. 2010. p. 470-473. 5635634. (Proceedings - 2010 6th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIHMSP 2010). doi: 10.1109/IIHMSP.2010.120

Regular quasi-cyclic LDPC codes with girth 6 from prime fields

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this