Paper Info
Title
Asymptotic distance properties of protograph-based spatially coupled LDPC codes over GF(q)
Abstract
In this paper, asymptotic methods are used to form lower and upper bounds on the typical free distance growth rate of ensembles of periodically time-varying protograph-based spatially coupled low-density parity-check (SC-LDPC) codes over GF(q). By evaluating and comparing these bounds, we find that the typical free distance of q-ary SC-LDPC codes increases linearly with constraint length and that the bounds coincide for a sufficiently large period. In particular, we show that the free distance to constraint length ratio of (3, 6)-regular q-ary SC-LDPC code ensembles exceeds the minimum distance to block length ratio of an underlying q-ary LDPC block code (LDPC-BC) ensemble. We also show that, similar to the minimum distance growth rate of the (3, 6)-regular q-ary LDPC-BC ensemble, the free distance growth rate of (3, 6)-regular q-ary SC-LDPC code ensembles increases with the field size q up to a certain point, and then it decreases as q increases further.
Year
DOI
Venue
2015
10.1109/ITW.2015.7133099
ITW
Field
DocType
ISBN
Discrete mathematics,Hamming code,Forward error correction,Concatenated error correction code,Low-density parity-check code,Turbo code,Serial concatenated convolutional codes,Block code,Theoretical computer science,Linear code,Mathematics
Conference
978-1-4799-5524-4
Citations 
PageRank 
References 
1
0.35
15
Authors
4
Name
Order
Citations
PageRank
Kechao Huang1605.65
David G. M. Mitchell214720.94
Xiao Ma348764.77
Daniel J. Costello Jr.437539.29