Abstract:

As for the sum-product decoding algorithm of LDPC codes, a new kind of difference-based decoding method is proposed. The main idea about it is that the messages passed on the bipartite graph of LDPC are based on the probability differences， and the renewal of both  check nodes and message nodes is carried out on the special addition domain. As for the renewal of check nodes, some differences possessing the minimum absolute values can be selected to further reduce the complexity of computation. In contrast with the traditional LLR-based decoding method, the proposed method has much lower complexity, while it has no obvious loss of performance and convergence.