Paper Info
Title
Circulant arrays: Rank analysis and construction of quasi-cyclic LDPC codes
Abstract
This paper consists of three parts. The first part presents a large class of new binary quasi-cyclic (QC)-LDPC codes with girth of at least 6 whose parity-check matrices are constructed based on cyclic subgroups of finite fields. Experimental results show that the codes constructed perform well over the binary-input AWGN channel with iterative decoding using the sum-product algorithm (SPA) and they outperform the corresponding pseudo-random QC-LDPC codes constructed with the PEG-algorithm. The second part analyzes the ranks of the parity-check matrices of codes constructed based on finite fields with characteristic of 2 and gives combinatorial expressions for these ranks. The third part identifies a subclass of constructed QC-LDPC codes that have large minimum distances. Decoding of codes in this subclass with the SPA converges very fast.
Year
DOI
Venue
2010
10.1109/ISIT.2010.5513640
ISIT
Keywords
Field
DocType
binary quasi-cyclic-ldpc codes,finite fields,awgn channels,cyclic codes,binary-input awgn channel,circulant arrays,parity-check matrix,code decoding,cyclic subgroups,sum-product algorithm,rank analysis,iterative decoding,parity check codes,galois fields,null space,parity check matrix,finite field,construction industry,ldpc code,bit error rate,dispersion
Discrete mathematics,Combinatorics,BCJR algorithm,Concatenated error correction code,Sequential decoding,Low-density parity-check code,Serial concatenated convolutional codes,Block code,Expander code,Linear code,Mathematics
Conference
ISBN
Citations 
PageRank 
978-1-4244-7891-0
0
0.34
References 
Authors
8
4
Name
Order
Citations
PageRank
Li Zhang11658.93
Shu Lin298572.16
Khaled A. S. Abdel-Ghaffar3616122.03
Bo Zhou41578.46