A Survey of Recent Information Combining Bounds for Iterative Decoding of LDPC codes
Bobak Nazer
Abstract
In this survey paper, we cover two very recent papers on bounds for EXIT chart analysis of LDPC codes that make minimal assumptions on the probability distribution of the messages passed between decoders. It is shown that the BEC and the BSC are always the maximizing and minimizing distributions on messages. From this, analytical bounds on EXIT charts are given. 1