Analog combinatorics and cellular automata-key algorithms and layout design

P. L. Venetianer, P. Szolgay, K. R. Crounse, T. Roska, L. Chua
{"title":"Analog combinatorics and cellular automata-key algorithms and layout design","authors":"P. L. Venetianer, P. Szolgay, K. R. Crounse, T. Roska, L. Chua","doi":"10.1109/CNNA.1994.381671","DOIUrl":null,"url":null,"abstract":"This paper demonstrates how certain logic and combinatorial tasks can be solved using CNNs. The most important application generalizes a shortest path algorithm to design the layout of printed circuit boards. Besides, it is shown how cellular automata can be simulated on CNN, and tasks, such as sorting, parity analysis, histogram calculation of black-and-white images, and computing minimum Hamming distance are also solved.<<ETX>>","PeriodicalId":248898,"journal":{"name":"Proceedings of the Third IEEE International Workshop on Cellular Neural Networks and their Applications (CNNA-94)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","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.381671","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

Abstract

This paper demonstrates how certain logic and combinatorial tasks can be solved using CNNs. The most important application generalizes a shortest path algorithm to design the layout of printed circuit boards. Besides, it is shown how cellular automata can be simulated on CNN, and tasks, such as sorting, parity analysis, histogram calculation of black-and-white images, and computing minimum Hamming distance are also solved.<>
模拟组合学和元胞自动机-键算法和布局设计
本文演示了如何使用cnn解决某些逻辑和组合任务。最重要的应用是将最短路径算法推广到印刷电路板的布局设计中。此外,还展示了如何在CNN上模拟元胞自动机,并解决了黑白图像的排序、奇偶分析、直方图计算、最小汉明距离计算等任务。b>
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信