提出一种基于位翻转的低复杂度、便于硬件实现的LDPC码解码算法.该算法充分利用变量节点的本征信息来计算翻转判决函数,减少了对其它变量节点软信息的需求,因此大大降低了解码硬件实现的复杂度,同时保证翻转判决函数具有较高的可靠性.利用该算法,对RS-based LDPC码进行的仿真结果表明,改进算法的解码性能接近甚至略优于IMWBF算法.
A new low complexity and implement efficient bit-flipping decoding algorithm for Low-Density Parity-Check (LDPC) codes is presented in this paper. The proposed algorithm computes the flipping function by the intrinsic value of the message node, and it reduces the requirement of the information from other message nodes. So, it has a lower com- plexity and still guarantees the reliability of the flipping function. The simulation results for RS-based LDPC codes using the proposed algorithm show that it has the performance approaching the IMWBF algorithm or even better.