Da-Ke He, Ashish Jagmohan, et al.
ISIT 2007
In this paper, two families of reduced-complexity algorithms for decoding low-density parity-check (LDPC) codes based on incorporating either a normalization or a correction term in the check-node update are presented. A simplified symbol-node update can also be used. Using simulations, it is shown that these simplified belief propagation (BP) approaches provide near optimum performance with different classes of LDPC codes.
Da-Ke He, Ashish Jagmohan, et al.
ISIT 2007
James Lee Hafner
Journal of Number Theory
Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering
Zhihua Xiong, Yixin Xu, et al.
International Journal of Modelling, Identification and Control