Méthode du point proximal: principe et applications aux algorithmes itératifs - Computer Science > Information TheoryReport as inadecuate




Méthode du point proximal: principe et applications aux algorithmes itératifs - Computer Science > Information Theory - Download this document for free, or read online. Document in PDF available to download.

Abstract: This paper recalls the proximal point method. We study two iterativealgorithms: the Blahut-Arimoto algorithm for computing the capacity ofarbitrary discrete memoryless channels, as an example of an iterative algorithmworking with probability density estimates and the iterative decoding of theBit Interleaved Coded Modulation BICM-ID. For these iterative algorithms, weapply the proximal point method which allows new interpretations with improvedconvergence rate.



Author: Ziad Naja, Florence Alberge, P. Duhamel

Source: https://arxiv.org/







Related documents