Measures for Tracing Convergence of Iterative Decoding Algorithms (2002)
| Venue: | in Proc. 4th IEEE/ITG Conf. on Source and Channel Coding |
| Citations: | 22 - 5 self |
BibTeX
@INPROCEEDINGS{Tüchler02measuresfor,
author = {M. Tüchler and S. Ten Brink and J. Hagenauer},
title = {Measures for Tracing Convergence of Iterative Decoding Algorithms},
booktitle = {in Proc. 4th IEEE/ITG Conf. on Source and Channel Coding},
year = {2002},
pages = {53--60}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We study the convergence behavior of turbo decoding, turbo equalization, and turbo bit-interleaved coded modulation in a unified framework, which is to regard all three principles as instances of iterative decoding of two serially concatenated codes. There is a collection of measures in the recent literature, which trace the convergence of iterative decoding algorithms based on a single parameter. This parameter is assumed to completely describe the behavior of the soft-in soft-out decoders being part of the iterative algorithm. The measures observe different parameters and were originally applied to different types of decoders. In this paper, we show how six of those measures are related to each other and we compare their convergence prediction capability for the decoding principles mentioned above. We observed that two measures predict the convergence very well for all regarded decoding principles and others suffer from systematic prediction errors independent of the decoding principle.
