Open Science Research Excellence
%0 Journal Article
%A Jean-Christophe Sibel and  Sylvain Reynal and  David Declercq
%D 2012 
%J  International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering
%B World Academy of Science, Engineering and Technology
%I International Science Index 65, 2012
%T Experimental Results about the Dynamics of the Generalized Belief Propagation Used on LDPC Codes
%U http://waset.org/publications/9701
%V 65
%X In the context of channel coding, the Generalized Belief Propagation (GBP) is an iterative algorithm used to recover the transmission bits sent through a noisy channel. To ensure a reliable transmission, we apply a map on the bits, that is called a code. This code induces artificial correlations between the bits to send, and it can be modeled by a graph whose nodes are the bits and the edges are the correlations. This graph, called Tanner graph, is used for most of the decoding algorithms like Belief Propagation or Gallager-B. The GBP is based on a non unic transformation of the Tanner graph into a so called region-graph. A clear advantage of the GBP over the other algorithms is the freedom in the construction of this graph. In this article, we explain a particular construction for specific graph topologies that involves relevant performance of the GBP. Moreover, we investigate the behavior of the GBP considered as a dynamic system in order to understand the way it evolves in terms of the time and in terms of the noise power of the channel. To this end we make use of classical measures and we introduce a new measure called the hyperspheres method that enables to know the size of the attractors.

%P 564 - 572