EFFICIENT RECOVERY TECHNIQUE FOR LOW-DENSITY PARITY-CHECK CODES USING REDUCED-SET DECODING
K. M. S. Soyjaudah, Pierre Clarel Catherine · Journal of Circuits Systems and Computers · 2008
We introduce a recovery algorithm for low-density parity-check codes that provides substantial coding gain over the conventional method. Concisely, it consists of an inference procedure based on successive decoding rounds using different subsets of bit nodes from the bipartite graph representing the code. The technique also sheds light on certain characteristics of the sum–product algorithm and effectively copes with the problems of trapping sets, cycles, and other anomalies that adversely affect the performance LDPC codes.