Exchange of limits: why iterative decoding works

Jump to other IT Society Websites:

Exchange of limits: why iterative decoding works


Creation Date: Jul 06, 2008

Published In: Jul 2008

Paper Type: Conference Paper

Book Title: Proc. of IEEE International Symposium on Information Theory

Address: Toronto, ON, Canada


We consider communication over a family of binary-input memoryless output-symmetric channels using low-density parity-check codes under message passing decoding. The asymptotic (in the length) performance of such a combination for a fixed number of iterations is given by density evolution. It is customary to define the threshold of density evolution as the maximum channel parameter for which the bit error probability under density evolution converges to zero as a function of the iteration number. 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 weexchange 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.

IEEE Explore link:

Award(s) Received:

COVID-19 Updates

Read important changes and updates to the 2020 activities of the IEEE Information Theory Society due to the COVID-19 pandemic at:


Table of Contents

IEEE TechNav