Performance Analysis and Design of (3,ρ) — Regular Quasi Cyclic LDPC Codes
Xu Xia, Moon Ho Lee, Choi Seung Je, Moon Myung Ryong · 2005
In this paper we construct a novel family of (3,rho)-regular quasi-cyclic (QC) low-density parity-check (LDPC) codes, derived from permutation theorem for Latin squares, when used over binary input additive white Gaussian noise (BIAWGN) channel. The codes have high code rate, girth absence of 4, good minimum distance, and sparse parity check matrices. They are designed to perform well when iteratively decoding with sum-product decoding algorithm and to allow low complexity encoding