Skip to Main content Skip to Navigation
Conference papers

A Game-Theoretic interpretation of iterative decoding

Abstract : Bit interleaved Coded Modulation with iterative decoding is known to provide excellent performance over both Gaussian and fading channels. However a complete analysis of the iterative demodulation is still missing. In this paper, the iterative decoding is analyzed from a game-theoretic point of view in order to explain the good performance of turbo-decoding. It is shown that iterative decoding is a game seeking a solution to an optimization problem obtained from parallel approximations of the maximum likelihood decoding. Surprisingly, the decoder and demapper are not antagonist players. They are involved in a cooperative process in which n selfish players attempt to optimize their own bit-marginals. An interpretation is given in terms of pure Nash Equilibrium and social welfare. The approximate criterion of the sub-optimal problem is the social welfare of the game and is also a performance rating on the distributed optimization process. The convergence is analysed and it is proved that it always exists a convergent iterative sequence leading to a Nash equilibrium of the game. Experimental results are provided in the particular case of BICM decoding.
Complete list of metadata
Contributor : Florence Alberge Connect in order to contact the contributor
Submitted on : Friday, August 26, 2011 - 4:43:49 PM
Last modification on : Thursday, June 17, 2021 - 3:47:54 AM


  • HAL Id : hal-00617257, version 1



Florence Alberge. A Game-Theoretic interpretation of iterative decoding. European Signal Processing Conference 2011, Aug 2011, Barcelona, Spain. pp.CD-Rom Proceedings. ⟨hal-00617257⟩



Les métriques sont temporairement indisponibles