Please use this identifier to cite or link to this item:
|Title:||Hopfield associative memory on mesh||Authors:||Ayoubi, Rafic
Bayoumi, Magdy A.
|Affiliations:||Department of Computer Engineering||Keywords:||Systolic arrays
Hopfield neural nets
|Issue Date:||2004||Part of:||2004 IEEE International Symposium on Circuits and Systems (ISCAS)||Conference:||IEEE International Symposium on Circuits and Systems (23-26 May 2004 : Vancouver, BC, Canada)||Abstract:||
The associative Hopfield memory is a very useful artificial neural network (ANN) that can be utilized in numerous applications. Examples include pattern recognition, noise removal, information retrieval, and combinatorial optimization problems. This paper provides an algorithm for implementing the Hopfield ANN on mesh parallel architectures. A Hopfield ANN model involves two major operations; broadcasting a value to a set of processors and summation of values in a set of processors. The main advantage of this algorithm is a high performance and cost effectiveness. An iteration of an N-bit (neuron) Hopfield associative memory only requires O(logN) time, whereas other known algorithms in literature of similar topology require O(N) time. Moreover, the proposed algorithm is cost effective because only higher dimension architectures were reported to achieve a complexity of O(logN) such as hypercubes.
|URI:||https://scholarhub.balamand.edu.lb/handle/uob/603||DOI:||10.1109/ISCAS.2006.1693205||Ezproxy URL:||Link to full text||Type:||Conference Paper|
|Appears in Collections:||Department of Computer Engineering|
Show full item record
checked on Sep 23, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.