Construction of irregular low-density parity-check codes based on V-matrix

Traditional irregular low-density parity-check (IR-LDPC) codes are constructed based on the irregular bipartite graphs with carefully chosen degree patterns on both sides and computer searching is usually applied, which leads complexity to be relatively high. In this paper, we introduce the concept of V-matrix which is a matrix composed of vectors and propose a new approach to construct the IR-LDPC codes. By introducing some special operations, we can obtain the desired sparse parity-check matrix for IR-LDPC codes design. Because computer searching is avoided, the complexity is efficiently reduced. Computer simulation results show that our approach can achieve good tradeoff between complexity and performance