Large-neighborhood templates implementation in discrete-time CNN Universal Machine with a nearest-neighbor connection pattern
Krzysztof Ślot · 2002
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.>