A new hybrid decoding algorithm based on multi-dimensional searching for regular LDPC codes in finite geometries

In this paper, a new fast convergence hybrid decoding algorithm based on multi-dimensional searhing is proposed for decoding LDPC codes. The main idea of this algorithm is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To this end, the algorithm does multidimensional searching between all possible bit positions that could flip in each iteration to select the best choices. Simulation results illustrate that the proposed algorithm converge significantly faster and have reduction in iteration number and also have excellent performance but with little performance difference than the robust Sum-Product algorithm.