By Topic

Associative digital neural network based on code and graph theories

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Tanaka, M. ; Dept. of Electr. & Electron. Eng., Sophia Univ., Tokyo, Japan ; Takeya, K. ; Kanaya, M. ; Chigusa, Y.

An associative DNN (digital neural network) called SANNET, which is based on code and graph theories, is presented. Each neuron is an exclusive-OR unit. In the learning process, all node syndromes from all neurons are constrained to be zero, and a binary `current' code that expresses a loop on each subnetwork is generated on the basis of the orthogonality of loops and cutsets. Only information on the tree is stored in each subnetwork. In the associative process, the incomplete code on the cotree of each subnetwork is corrected to the complete code according to the error-correcting capacity. SANNET has structural redundancy, sparsity, cellular structure, high concurrency, variable code length, robustness, testability, reliability, logical neurons, unions of logic and storage elements, no crosstalk, high speed, and a unique solution. The SANNET can be fabricated as a CMOS gate array. It can be applied to recognition and classification in which the recognized items are expressed by feature vectors with different lengths. Some simulation results for pattern completion are given

Published in:

Circuits and Systems, 1989., IEEE International Symposium on

Date of Conference:

8-11 May 1989