Construction and VHDL implementation of a fully local network with good reconstruction properties of the inputs

  • Authors:
  • Joël Chavas;Demian Battaglia;Andres Cicuttin;Riccardo Zecchina

  • Affiliations:
  • ISI Foundation, Torino, Italy;SISSA, Trieste, Italy;ICTP-INFN MLab Laboratory, Trieste, Italy;ICTP, Trieste, Italy

  • Venue:
  • IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

This report shows how one can find a solution to the K-SAT equations with the use of purely local computations. Such a local network, inspired by the Survey Propagation equations driven by an external input vector, potentially has an exponential number of attractors. This gives the network powerful classification properties, and permits to reconstruct either noisy or incomplete inputs. It finds applications from bayesian inference to error-correcting codes and gene-regulatory networks, and its local structure is ideal for an implementaion on FPGA. Here we write its algorithm, characterize its main properties and simulate the corresponding VHDL code. One shows that the time of convergence towards a solution optimally scales with the size of the network.