{"title":"Large-neighborhood templates implementation in discrete-time CNN Universal Machine with a nearest-neighbor connection pattern","authors":"Krzysztof Slot","doi":"10.1109/CNNA.1994.381677","DOIUrl":null,"url":null,"abstract":"The paper presents the method of large neighborhood templates realization (i.e. templates with r>1) in a nearest-neighbor connected (i.e. r=1) discrete-time CNN Universal Machine. This is accomplished by decomposing an objective template into a sum of two-dimensional 3/spl times/3 template correlations. An appropriate procedure which ensures a desired circuit operation is given in an algorithmic form.<<ETX>>","PeriodicalId":248898,"journal":{"name":"Proceedings of the Third IEEE International Workshop on Cellular Neural Networks and their Applications (CNNA-94)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Third IEEE International Workshop on Cellular Neural Networks and their Applications (CNNA-94)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CNNA.1994.381677","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 21
Abstract
The paper presents the method of large neighborhood templates realization (i.e. templates with r>1) in a nearest-neighbor connected (i.e. r=1) discrete-time CNN Universal Machine. This is accomplished by decomposing an objective template into a sum of two-dimensional 3/spl times/3 template correlations. An appropriate procedure which ensures a desired circuit operation is given in an algorithmic form.<>