A boolean herb rule for binary associative memory design

Müezzinoǧlu M. K., Güzeliş C.

2001 Midwest Symposium on Circuits and Systems (MWSCAS 2001), Dayton, OH, Amerika Birleşik Devletleri, 14 - 17 Ağustos 2001, cilt.2, ss.713-716, (Tam Metin Bildiri) identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Cilt numarası: 2
  • Basıldığı Şehir: Dayton, OH
  • Basıldığı Ülke: Amerika Birleşik Devletleri
  • Sayfa Sayıları: ss.713-716
  • Dokuz Eylül Üniversitesi Adresli: Evet

Özet

We propose a binary associative memory design method to be applied to a class of dynamical neural networks. The method is based on introducing the memory vectors as maximal independent sets to an undirected graph and on designing a dynamical network in order to find a maximal independent set whose characteristic vector is close to the given distorted vector. We show that our method provides the attractiveness for each memory vector and avoids the occurance of spurious states whenever the set of given memory vectors satisfies certain compatibility conditions. We also analyze the application of this design method to the discrete Hopfield network.