Reduced Complexity and Improved Performance for Short Regular LDPC Codes Based on Select Updating Schedule

In this paper, we present a modified BP decoding algorithm based on select updating schedule by analyzing the properties of message-passing through cycles, we also proposed a concrete scheme to obtain the select updating schedule, the simulations prove that we could improve performance and reduce complexity at the same time for short regular LDPC codes which have a small difference between the maximal and minimal single bit node girths by select updating schedule compared with the conventional BP decoding algorithm.