On Achieving an Asymptotically Error-Free Fixed-Point of Iterative Decoding for Perfect a Priori Information

In this paper the authors provide necessary and sufficient conditions for constituent codes in (multiple) concatenated and graph-based coding schemes to achieve an asymptotically error free iterative decoding fixed-point if the maximum possible a priori information is available. At least one constituent code in an iterative decoding scheme must satisfy these conditions in order to ensure an asymptotically vanishing bit error probability at the convergence point of the decoder. Their results are proved for arbitrary Binary-Input Symmetric Memory-less Channels (BISMCs) and thus can be universally applied to many transmission scenarios.

Provided by: Institute of Electrical & Electronic Engineers Topic: Networking Date Added: Apr 2013 Format: PDF

Find By Topic