Exchange of Limits: Why Iterative Decoding Works

TL;DR

This paper investigates the theoretical justification for iterative decoding of LDPC codes over symmetric channels, showing that under certain conditions, the bit error probability vanishes below the density evolution threshold regardless of the order of limits taken.

Contribution

It provides a rigorous analysis of the exchange of limits in density evolution, confirming that the decoding performance remains reliable below the threshold even when considering finite-length codes and many iterations.

Findings

Bit error probability vanishes below the density evolution threshold

Exchange of limits is valid under certain technical conditions

Supports empirical observations about iterative decoding performance

Abstract

We consider communication over binary-input memoryless output-symmetric channels using low-density parity-check codes and message-passing decoding. The asymptotic (in the length) performance of such a combination for a fixed number of iterations is given by density evolution. Letting the number of iterations tend to infinity we get the density evolution threshold, the largest channel parameter so that the bit error probability tends to zero as a function of the iterations. In practice we often work with short codes and perform a large number of iterations. It is therefore interesting to consider what happens if in the standard analysis we exchange the order in which the blocklength and the number of iterations diverge to infinity. In particular, we can ask whether both limits give the same threshold. Although empirical observations strongly suggest that the exchange of limits is valid for all channel parameters, we limit our discussion to channel parameters below the density evolution threshold. Specifically, we show that under some suitable technical conditions the bit error probability vanishes below the density evolution threshold regardless of how the limit is taken.