{"title":"Design and simulations of cellular neural-like associative memory","authors":"O. Bandman, S. Pudov","doi":"10.1109/IDSRTA.1997.568657","DOIUrl":null,"url":null,"abstract":"A cellular-neuron associative memory (CNAM), which is an associative neural memory of the Hopfield type with a restricted number of connections, is investigated. Algorithms for designing CNAMs take advantage of the fine-grained parallelism induced both by independent cell operations and by connection locality. A very important property is the fact that learning and retrieval processes may be performed in the same cellular array. Some necessary and sufficient conditions for strong stability and k-attractability are obtained, which are expressed in terms of cell neighborhood relations of stored patterns. Simulation of learning and retrieval processes in a CNAM storing symbols drawn in thin lines showed that, for this class of patterns, it is possible to provide strong stability approximately for 2|Q| prototypes, where Q is the cardinality of the neuron neigborhood, with the capability of restoring 60-70% of 1-distortions.","PeriodicalId":117186,"journal":{"name":"Proceedings First International Workshop on Distributed Interactive Simulation and Real Time Applications","volume":"172 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings First International Workshop on Distributed Interactive Simulation and Real Time Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IDSRTA.1997.568657","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
A cellular-neuron associative memory (CNAM), which is an associative neural memory of the Hopfield type with a restricted number of connections, is investigated. Algorithms for designing CNAMs take advantage of the fine-grained parallelism induced both by independent cell operations and by connection locality. A very important property is the fact that learning and retrieval processes may be performed in the same cellular array. Some necessary and sufficient conditions for strong stability and k-attractability are obtained, which are expressed in terms of cell neighborhood relations of stored patterns. Simulation of learning and retrieval processes in a CNAM storing symbols drawn in thin lines showed that, for this class of patterns, it is possible to provide strong stability approximately for 2|Q| prototypes, where Q is the cardinality of the neuron neigborhood, with the capability of restoring 60-70% of 1-distortions.