Design of Quasi-Cyclic Cycle LDPC Codes over GF(q)

ShuKai HU  Chao CHEN  Rong SUN  XinMei WANG  

IEICE TRANSACTIONS on Communications   Vol.E95-B   No.3   pp.983-986
Publication Date: 2012/03/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.E95.B.983
Print ISSN: 0916-8516
Type of Manuscript: LETTER
Category: Fundamental Theories for Communications
low-density parity-check (LDPC) codes,  nonbinary,  quasi-cyclic,  minimum Hamming distance,  fast encoding,  

Full Text: PDF>>
Buy this Article

Quasi-cyclic (QC) low-density parity-check (LDPC) codes have several appealing properties regarding decoding, storage requirements and encoding aspects. In this paper, we focus on the QC LDPC codes over GF(q) whose parity-check matrices have fixed column weight j = 2. By investigating two subgraphs in the Tanner graphs of the corresponding base matrices, we derive two upper bounds on the minimum Hamming distance for this class of codes. In addition, a method is proposed to construct QC LDPC codes over GF(q), which have good Hamming distance distributions. Simulations show that our designed codes have good performance.