Cycle Properties Analysis of Matrix-Filled LDPC Codes
Jianquan Liu, Youyun Xu, Yueming Cai · 2006
In this paper, we present the upper and lower bounds of the girth of MF-LDPC codes which are determined by the shift times of cyclic shift matrices by analysis the properties of cyclic shift matrices in cycle, we also propose a concrete conditional-filling construction, the simulations prove that sufficient utilization of the properties can reduce the amount of least cycle of the MF-matrix remarkably and improve the performance to a larger extent