This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Unate Cellular Logic
February 1969 (vol. 18 no. 2)
pp. 114-121
A fundamental problem in "cellular logic" is to be able to "synthesize" "cellular arrays" for arbitrary switching functions that minimize a set of design parameters like size of the arrays and complexity of the individual cells and of the interconnection pattern on the cells. This paper is an attempt to develop "minimization algorithms for cellular arrays."
Index Terms:
Cellular logic, minimization algorithms for cellular arrays, synthesis of cellular arrays, unate cellular arrays.
Citation:
A. Mukhopadhyay, "Unate Cellular Logic," IEEE Transactions on Computers, vol. 18, no. 2, pp. 114-121, Feb. 1969, doi:10.1109/T-C.1969.222614
Usage of this product signifies your acceptance of the Terms of Use.