Premium
Implementation of large‐neighbourhood non‐linear templates on the CNN universal machine
Author(s) -
Kék László,
Zarándy Ákos
Publication year - 1998
Publication title -
international journal of circuit theory and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.364
H-Index - 52
eISSN - 1097-007X
pISSN - 0098-9886
DOI - 10.1002/(sici)1097-007x(199811/12)26:6<551::aid-cta33>3.0.co;2-4
Subject(s) - template , computer science , neighbourhood (mathematics) , cellular neural network , algorithm , decomposition , set (abstract data type) , artificial neural network , theoretical computer science , mathematics , artificial intelligence , mathematical analysis , ecology , biology , programming language
In this paper we present a general method for implementing certain types of arbitrary large neighbourhood non‐linear control (B) templates on the cellular neural network universal machine (CNNUM). First, we show how a 3×3 non‐linear B template can be replaced by a set of linear ones. We thereby obtain an analogic algorithm that, by using linear templates, yields the same result as when applying the original non‐linear template. It is then shown how the template decomposition problem can be solved for large neighbourhood non‐linear B templates. Thirdly, the question of template decomposition is discussed for arbitrary templates in case of discrete time CNN (DTCNN). Examples are given to highlight the main steps of the algorithm. The necessary and sufficient conditions for realizing the proposed method on any CNNUM chip are also specified. An idea for solving the non‐linear feedback (A) template decomposition problem is also proposed. © 1998 John Wiley & Sons, Ltd.