ROBUST TEMPLATE DECOMPOSITION WITH RESTRICTED WEIGHTS FOR CELLULAR NEURAL NETWORKS IMPLEMENTING AN ARBITRARY BOOLEAN FUNCTION
From MaRDI portal
Publication:3498775
DOI10.1142/S0218127407018920zbMath1185.37023OpenAlexW1995960464MaRDI QIDQ3498775
Jer-Guang Hsieh, Yih-Lon Lin, Jyh-Horng Jeng
Publication date: 16 May 2008
Published in: International Journal of Bifurcation and Chaos (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218127407018920
Learning and adaptive systems in artificial intelligence (68T05) Analytic circuit theory (94C05) Dynamical aspects of cellular automata (37B15)
Cites Work
- Unnamed Item
- Cellular neural networks: theory
- An analytic method for designing simple cellular neural networks
- Implementation of arbitrary Boolean functions on a CNN Universal Machine
- The CNN universal machine: an analogic array computer
- Designing cellular neural networks for the evaluation of local Boolean functions
This page was built for publication: ROBUST TEMPLATE DECOMPOSITION WITH RESTRICTED WEIGHTS FOR CELLULAR NEURAL NETWORKS IMPLEMENTING AN ARBITRARY BOOLEAN FUNCTION
