The turbo decoding algorithm and its phase trajectories

This paper analyzes phase trajectories and fixed points of the turbo decoding algorithm as a function of the signal-to-noise ratio (SNR). By exploiting the large length of turbo codes, the turbo decoding algorithm is treated as a single-parameter dynamical system, parameterized (approximately) by the SNR. This parameterization, along "with" extensive simulations at practical SNRs and asymptotic analysis as SNR goes to zero and infinity, is used to subdivide the entire SNR range into three regions with the "waterfall region" in the middle. The turbo decoding algorithm has distinctive phase trajectories and convergence properties in these three SNR regions. This paper also investigates existence and properties of fixed points in these SNR regions. The main fixed points of the turbo decoding algorithm are classified into two categories. In a wide range of SNRs (corresponding to bit-error rates less than 10/sup -1/), the decoding algorithm has "unequivocal" fixed points which correspond to mostly correct decisions on the information bits. Within this range, toward the lower values of SNR, there is another fixed point which corresponds to many erroneous decision on the information bits. Fixed points of this type are referred to as "indecisive" fixed points. It turns out that the indecisive fixed points bifurcate and disappear for SNRs in the waterfall region. This paper associates the qualitative transition of phase trajectories in the waterfall region to the bifurcation of indecisive fixed points. These bifurcations also explain empirically observed quasi-periodic and periodic phase trajectories of the turbo decoding algorithm.

[1]  W. Boothby.  An introduction to differentiable manifolds and Riemannian geometry , 1975 .

[2]  Thomas J. Richardson,et al.  The geometry of turbo-decoding dynamics , 2000, IEEE Trans. Inf. Theory.

[3]  Rüdiger L. Urbanke,et al.  The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.

[4]  Alain Glavieux,et al.  Reflections on the Prize Paper : "Near optimum error-correcting coding and decoding: turbo codes" , 1998 .

[5]  Niclas Wiberg,et al.  Codes and Decoding on General Graphs , 1996 .

[6]  Daniel J. Costello,et al.  A distance spectrum interpretation of turbo codes , 1996, IEEE Trans. Inf. Theory.

[7]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[8]  Y. Kuznetsov.  Elements of Applied Bifurcation Theory , 2023, Applied Mathematical Sciences.

[9]  David J. C. MacKay,et al.  Good Error-Correcting Codes Based on Very Sparse Matrices , 1997, IEEE Trans. Inf. Theory.

[10]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[11]  Sergio Benedetto,et al.  Unveiling turbo codes: some results on parallel concatenated coding schemes , 1996, IEEE Trans. Inf. Theory.

[12]  Bixio Rimoldi,et al.  The turbo decoding algorithm has fixed points , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[13]  Marc P. C. Fossorier,et al.  Two simple stopping criteria for iterative decoding , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[14]  Joachim Hagenauer,et al.  Iterative decoding of binary block and convolutional codes , 1996, IEEE Trans. Inf. Theory.

[15]  D. Divsalar,et al.  On the Design of Turbo Codes , 1995 .

[16]  S. Wiggins.  Introduction to Applied Nonlinear Dynamical Systems and Chaos , 1989 .