Performance bounds for quantized LDPC decoders based on absorbing sets
A code independent performance bound for a given absorbing set is derived for quantized low density parity check (LDPC) decoders. The analysis demonstrates that each absorbing set in the Tanner graph imposes a specific lower bound on the frame error rate (FER) of any code containing that absorbing set under a given quantization scheme. This approach is applicable to any message passing (MP) decoding algorithm and any uniform or non uniform quantization scheme for LDPC codes. Simulation results using the sum product algorithm (SPA) provide FERs that are consistent with the obtained bounds. In addition, the bounds demonstrate that the conventional quantized SPA is not capable of achieving very low FERs if the LDPC codes contain certain absorbing sets.
2016 IEEE International Symposium on Information Theory (ISIT)