Mario Blaum, John L. Fan, et al.
IEEE International Symposium on Information Theory - Proceedings
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.
Mario Blaum, John L. Fan, et al.
IEEE International Symposium on Information Theory - Proceedings
M. Tismenetsky
International Journal of Computer Mathematics
Leo Liberti, James Ostrowski
Journal of Global Optimization
S.F. Fan, W.B. Yun, et al.
Proceedings of SPIE 1989