CMOS programmable asynchronous neighborhood mechanism for WTM kohonen neural network

A new programmable neighborhood mechanism for the Winner Takes Most (WTM) self-organizing Kohonen map has been proposed in this paper. Described circuit is an asynchronous solution, which does not require the controlling clock generator. The winning neuron generates the `enable’ signal (EN) that spreads in all directions in the map, triggering adaptation process in all neurons that belong to the winner’s neighborhood. Time propagation of the EN signal is very short. In an example map that consists of 32x32 neurons, the propagation time between two neurons that are the most distant is equal to about 60 ns, which in practice means that adaptation in all neurons starts almost in the same time and is then performed in parallel. The proposed solution makes any hardware implemented WTM network almost as fast as the Winner Takes All (WTA) network, which does not contain the neighborhood mechanism and allows for adaptation only of the winning neuron in each of iterations.


Publié dans:
proc. of the 15th International Conference Mixed Design of Integrated Circuits and Systems (MIXDES), 197-201
Présenté à:
15th International Conference Mixed Design of Integrated Circuits and Systems (MIXDES), Poznan, Poland, June 19-21, 2008
Année
2008
Mots-clefs:
Laboratoires:


Note: Le statut de ce fichier est: Seulement EPFL


 Notice créée le 2010-08-17, modifiée le 2018-11-26

n/a:
Télécharger le document
PDF

Évaluer ce document:

Rate this document:
1
2
3
 
(Pas encore évalué)