Approximated Box-Plus Decoding of LDPC Codes

The problem of how to approximate effectively the box-plus operation used in sum-product algorithm (SPA) decoding of low-density parity-check (LDPC) codes has been widely investigated over the past years of research. This letter deals, for the first time, with a totally different approach where a very simple, yet efficient, decoding algorithm for LDPC codes is proposed. The tremendous savings, in terms of required number of operations, offered by the proposed algorithm and its near optimal SPA performance are making it appealing in practical applications requiring very low complexity LDPC decoding architectures.