Analysis of Reduced Complexity Nonbinary LDPC Coding Based on Matrix Structure Modifications
M. Anbuselvi, S. Salivahanan · 2013
Nonbinary LDPC coding is a class of excellent error correcting codes in wireless communication systems. The hardware realization of this decoder architecture put forth a challenge at making a better tradeoff between the computation complexities and decoding performance. This letter proposes modifications in the structure of H-matrix which characterizes the Low Density Parity Check (LDPC) codes. The modification is aimed towards the reduction of computation complexity by retaining the properties of H-matrix. Two masking matrices are proposed with reduced number of non- zero elements, forming the diagonals of the parity check matrix. Simulation results indicate improved decoding performance and reduced computational complexity with the proposed H-matrix structures.