Construction of Quasi-Cyclic LDPC Codes based on Euclidean Geometries

Yuan-hua Liu; Mei-ling Zhang

8th International Conference on Communications and Networking in China

Research Article

Construction of Quasi-Cyclic LDPC Codes based on Euclidean Geometries

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1109/ChinaCom.2013.6694726,
    author={Yuan-hua Liu and Mei-ling Zhang},
    title={Construction of Quasi-Cyclic LDPC Codes based on Euclidean Geometries},
    proceedings={8th International Conference on Communications and Networking in China},
    publisher={IEEE},
    proceedings_a={CHINACOM},
    year={2013},
    month={11},
    keywords={low-density parity-check codes quasi-cyclic euclidean geometries},
    doi={10.1109/ChinaCom.2013.6694726}
}

Yuan-hua Liu
Mei-ling Zhang
Year: 2013
Construction of Quasi-Cyclic LDPC Codes based on Euclidean Geometries
CHINACOM
IEEE
DOI: 10.1109/ChinaCom.2013.6694726

Yuan-hua Liu¹^,*, Mei-ling Zhang¹

1: Xi’an University of Posts and Telecommunications

*Contact email: yuanhliu@163.com

Abstract

A new method for constructing quasi-cyclic (QC) low-density parity-check (LDPC) codes based on the structural properties of Euclidean geometries is presented. The proposed method changes the incidence vectors of some lines in the original Euclidean geometry method to construct much more parity check matrices and results in a large class of QC-LDPC codes with girth of at least 6. Simulations show that some codes in this class have better performance and lower error floor than the original Euclidean geometry codes.

Keywords: low-density parity-check codes quasi-cyclic euclidean geometries

Published: 2013-11-14
Publisher: IEEE

: http://dx.doi.org/10.1109/ChinaCom.2013.6694726