8 research outputs found

    Merging Belief Propagation and the Mean Field Approximation: A Free Energy Approach

    Get PDF
    We present a joint message passing approach that combines belief propagation and the mean field approximation. Our analysis is based on the region-based free energy approximation method proposed by Yedidia et al. We show that the message passing fixed-point equations obtained with this combination correspond to stationary points of a constrained region-based free energy approximation. Moreover, we present a convergent implementation of these message passing fixedpoint equations provided that the underlying factor graph fulfills certain technical conditions. In addition, we show how to include hard constraints in the part of the factor graph corresponding to belief propagation. Finally, we demonstrate an application of our method to iterative channel estimation and decoding in an orthogonal frequency division multiplexing (OFDM) system

    Information Geometry of Turbo and Low-Density Parity-Check Codes

    No full text
    Abstract — Since the proposal of turbo codes in 1993, many studies have appeared on this simple and new type of codes which give a powerful and practical performance of error correction. Although experimental results strongly support the efficacy of turbo codes, further theoretical analysis is necessary, which is not straightforward. It is pointed out that the iterative decoding algorithm of turbo codes shares essentially similar ideas with low-density parity-check (LDPC) codes, with Pearl’s belief propagation algorithm applied to a cyclic belief diagram, and with the Bethe approximation in statistical physics. Therefore the analysis of the turbo decoding algorithm will reveal the mystery of those similar iterative methods. In this paper, we recapture and extend the geometrical framework initiated by Richardson to the information geometrical framework of dual affine connections, focusing on both of the turbo and LDPC decoding algorithms. The framework helps our intuitive understanding of the algorithms and opens a new prospect of further analysis. We reveal some properties of these codes in the proposed framework, including the stability and error analysis. Based on the error analysis, we finally propose a correction term for improving the approximation. Index Terms — belief propagation, information geometry, lowdensity parity-check (LDPC) codes, perturbation analysis, turbo codes. I

    Méthodes de codage et d'estimation adaptative appliquées aux communications sans fil

    Get PDF
    Les recherches et les contributions présentées portent sur des techniques de traitement du signal appliquées aux communications sans fil. Elles s’articulent autour des points suivants : (1) l’estimation adaptative de canaux de communication dans différents contextes applicatifs, (2) la correction de bruit impulsionnel et la réduction du niveau de PAPR (Peak to Average Power Ratio) dans un système multi-porteuse, (3) l’optimisation de schémas de transmission pour la diffusion sur des canaux gaussiens avec/sans contrainte de sécurité, (4) l’analyse, l’interprétation et l’amélioration des algorithmes de décodage itératif par le biais de l’optimisation, de la théorie des jeux et des outils statistiques. L’accent est plus particulièrement mis sur le dernier thème
    corecore