Low-Complexity Optimization Algorithm for Irregular Low-Density Parity-Check Codes
左健存, 邵宇丰, 桂林 · 东华大学学报：英文版 · 2013
A low-complexity algorithm is proposed in this paper in order to optimize irregular low-density parity-check(LDPC)codes.The algorithm proposed can calculate the noise threshold by means of a one-dimensional density evolution and search the optimal degree profiles with fast-convergence differential evolution,so that it has a lower complexity and a faster convergence speed.Simulation results show that the irregular LDPC codes optimized by the presented algorithm can also perform better than Turbo codes at moderate block length even with less computation cost.