LDPC Code Design via Masking Technology and Progressive Optimization

Abstract

A design of low-density parity-check (LDPC) code via the masking technology and progressive optimization is proposed. The code generated by this method has lower computational complexity, and their parity-check matrices can effectively refrain from the girth −4 phenomenon. The proposed method has the superiorities such as better girth-length characteristic and more flexible trim in the length and rate of the code. Experiment results indicate that the error-correction performance of the new code should be better than or as good as the capability of the code which is constructed without been masking. Futhermore, under the condition of short code length, the performance is better than that of LDPC codes via the randomized construction methods.