Low Encoding Complexity LDPC Codes Based on Block Inverse Jacket Matrices

摘要

In this paper, we will introduce a simple LDPC encoding algorithm based on the block inverse Jacket matrices. Let a square matrix J_(p×p) = [α_(j,j)]_(p×p), and its inverse is obtained simply by block-wise inverse which leads to the low complexity of our proposed LDPC encoding. The proposed LDPC codes have girth at least 6 and they perform well with iterative decoding. Simulation results show that the proposed codes perform better compared to randomly constructed LDPC codes.