Conference paper
Motion video analysis using planar parallax
Harpreet S. Sawhney
IS&T/SPIE Electronic Imaging 1994
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.
Harpreet S. Sawhney
IS&T/SPIE Electronic Imaging 1994
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007
A. Skumanich
SPIE OE/LASE 1992
John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence