Please use this identifier to cite or link to this item:
Title: Fault tolerant hopfield associative memory on torus
Authors: Ayoubi, Rafic 
Ziade, Haissam
Bayoumi, Magdy A.
Affiliations: Department of Computer Engineering 
Keywords: Digital arithmetic
Hopfield neural nets
Fault tolerance
Content-addressable storage
Parallel architectures
Issue Date: 2003
Publisher: IEEE
Part of: Proceedings 18th IEEE Symposium on Defect and Fault Tolerance in VLSI Systems
Conference: IEEE Symposium on Defect and Fault Tolerance in VLSI Systems (18th : 5-5 Nov. 2003 : Boston, MA, USA, USA) 
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 efficient and fault tolerant algorithm for implementing the Hopfield ANN on a torus parallel architecture. The main advantage of this algorithm is fault tolerance, high performance, and cost effectiveness. The developed algorithm is much faster than other known algorithms of its class and comparable in speed to more complex architectures such as the hypercube without the added cost. It requires O(1) multiplications and O(log N) additions, whereas most others require O(N) multiplications and O(N) additions. Moreover, the developed algorithm has an added advantage over other known algorithms due to its fault tolerance feature, which is based on ABFT techniques. The main advantage of our ABFT (algorithm-based fault tolerance) method over other existing ABFT methods is its ability to detect and correct several faults without any additional hardware overhead (i.e. no extra row or column is needed).
Ezproxy URL: Link to full text
Type: Conference Paper
Appears in Collections:Department of Computer Engineering

Show full item record

Record view(s)

checked on Oct 19, 2021

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.