Improved algorithm based on self-corrected min-sum decoding for LDPC codes
Low density parity check code is a kind of linear block code.Due to the low content of non-zero elements,there is a problem that the node information reliability determination is not accurate enough in the decoding process.Therefore,an improved LDPC decoding algorithm based on self correcting minimum sum is proposed.The iteration rule of BP decoding algorithm is analyzed.The first minimum and the second minimum of the minimum sum algorithm are used to set the correction threshold of variable node information,and the self-corrected min-sum algorithm is improved.The order statistics theory is used to obtain the normalization factor corresponding to the two minimum values to prevent the transmission and diffusion of unreliable variable node information in the iterative decoding process.Simulation results show that when the bit error rate is 10-5,the proposed algorithm can obtain about 0.2 dB of decoding performance gain,and the average number of iterations can be reduced by 18.2%at most,which proves that the proposed algorithm can effectively improve the decoding performance and iterative convergence performance.
NETL
NSTL
万方数据
