22078 articles – 15904 references  [version française]

hal-00445731, version 1

Méthode du point proximal: principe et applications aux algorithmes itératifs

Ziad Naja 1, Florence Alberge () 1, Pierre Duhamel 1

GRETSI (2009) O

Abstract: This paper recalls the proximal point method. We study two iterative algorithms: the Blahut-Arimoto algorithm for computing the capacity of arbitrary discrete memoryless channels, as an example of an iterative algorithm working with probability density estimates and the iterative decoding of the Bit Interleaved Coded Modulation (BICM-ID). For these iterative algorithms, we apply the proximal point method which allows new interpretations with improved convergence rate.

  • 1:  Laboratoire des signaux et systèmes (L2S)
  • UMR8506 CNRS – SUPELEC – Université Paris XI - Paris Sud
  • Domain : Engineering Sciences/Signal and Image processing
    Mathematics/Information Theory
    Computer Science/Information Theory and Coding
    Computer Science/Signal and Image Processing
 
  • hal-00445731, version 1
  • oai:hal.archives-ouvertes.fr:hal-00445731
  • From: 
  • Submitted on: Monday, 11 January 2010 11:17:51
  • Updated on: Friday, 2 March 2012 13:02:57