TY - JOUR
T1 - Combinatorial design-based Quasi-cyclic LDPC codes with girth eight
AU - Vafi, Sina
AU - Majid, Narges Rezvani
PY - 2018/11
Y1 - 2018/11
N2 - This paper presents a novel regular Quasi-cyclic (QC) Low Density Parity Check (LDPC) codes with column-weight three and girth at least eight. These are designed on the basis of combinatorial design in which subsets applied for the construction of circulant matrices are determined by a particular subset. Considering the non existence of cycles four and six in the structure of the parity check matrix, a bound for their minimum weight is proposed. The simulations conducted confirm that without applying a masking technique, the newly implemented codes have a performance similar to or better than other well-known codes. This is evident in the waterfall region, while their error floor at very low bit error rate (BER) is expected.
AB - This paper presents a novel regular Quasi-cyclic (QC) Low Density Parity Check (LDPC) codes with column-weight three and girth at least eight. These are designed on the basis of combinatorial design in which subsets applied for the construction of circulant matrices are determined by a particular subset. Considering the non existence of cycles four and six in the structure of the parity check matrix, a bound for their minimum weight is proposed. The simulations conducted confirm that without applying a masking technique, the newly implemented codes have a performance similar to or better than other well-known codes. This is evident in the waterfall region, while their error floor at very low bit error rate (BER) is expected.
KW - Combinatorial design
KW - Girth
KW - Minimum weight
KW - Quasi-cyclic LDPC codes
UR - http://www.scopus.com/inward/record.url?scp=85048187065&partnerID=8YFLogxK
U2 - 10.1016/j.dcan.2018.01.001
DO - 10.1016/j.dcan.2018.01.001
M3 - Article
AN - SCOPUS:85048187065
SN - 2468-5925
VL - 4
SP - 296
EP - 300
JO - Digital Communications and Networks
JF - Digital Communications and Networks
IS - 4
ER -