Approximated sum-product decoding for LDPC codes

摘要

This paper proposes an approximated sum-product decoding algorithm for LDPC codes. The proposed decoding algorithm may be efficiently implemented through integer additions, comparisons, and bit-shift operations without multiplications and memories. Moreover, it doesn't require any channel information such as signal to noise ratio and operate with just the received values from channel.