Construction of QC LDPC codes based on cyclic subgroup over GF(q)

Authors:
Deng Xiaotao;Gao Jun;Dou Gaoqi
Affiliations:
Department of Communication Engineering, Naval University of Engineering, Wuhan, Hubei, China;Department of Communication Engineering, Naval University of Engineering, Wuhan, Hubei, China;Department of Communication Engineering, Naval University of Engineering, Wuhan, Hubei, China
Venue:
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Year:
2009

Citing 5
Cited 0

Error Control Coding, Second Edition

Error Control Coding, Second Edition
Good error-correcting codes based on very sparse matrices

IEEE Transactions on Information Theory
Low-density parity-check codes based on finite geometries: a rediscovery and new results

IEEE Transactions on Information Theory
Quasicyclic low-density parity-check codes from circulant permutation matrices

IEEE Transactions on Information Theory
Construction of Quasi-Cyclic LDPC Codes for AWGN and Binary Erasure Channels: A Finite Field Approach

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we proposed a novel method for constructing quasi-cyclic low-density parity-check (QC LDPC) codes based on cyclic subgroup over GF(q) . LDPC codes constructed by this method are quasi-cyclic (QC) and they perform very well over the additive white Gaussian noise (AWGN) with sum product algorithm (SPA). The main advantage is that QC LDPC codes with a variety of block lengths and rates can be easily constructed with no cycles of length four or less. Simulation results show that the proposed QC LDPC codes perform slight better than the random regular LDPC codes for short to moderate block lengths. Since the codes are QC, they can be encoded using simple shift registers with linear complexity.