Analog combinatorics and cellular automata - key algorithms and layout design

Peter L. Venetianer, Peter Szolgay, Kenneth R. Crounse, Tamas Roska, Leon O. Chua

Research output: Contribution to conferencePaper

7 Citations (Scopus)

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.

Original languageEnglish
Pages249-254
Number of pages6
Publication statusPublished - Dec 1 1994
EventProceedings of the 3rd IEEE International Workshop on Cellular Neural Networks and their Applications (CNNA-94) - Rome, Italy
Duration: Dec 18 1994Dec 21 1994

Other

OtherProceedings of the 3rd IEEE International Workshop on Cellular Neural Networks and their Applications (CNNA-94)
CityRome, Italy
Period12/18/9412/21/94

ASJC Scopus subject areas

  • Software

Fingerprint Dive into the research topics of 'Analog combinatorics and cellular automata - key algorithms and layout design'. Together they form a unique fingerprint.

  • Cite this

    Venetianer, P. L., Szolgay, P., Crounse, K. R., Roska, T., & Chua, L. O. (1994). Analog combinatorics and cellular automata - key algorithms and layout design. 249-254. Paper presented at Proceedings of the 3rd IEEE International Workshop on Cellular Neural Networks and their Applications (CNNA-94), Rome, Italy, .