This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Design of Universal Boolean Functions
April 1971 (vol. 20 no. 4)
pp. 418-423
A Boolean function U( z1,...,zm) is universal for given n=1 and a set I of variables if it realizes all Boolean functions f(x1,..., xn) by substituting for each zj a variable of I. Designs of universal Boolean functions for various specifications of I are considered for the practical cases of n<10. Assuming the number m of input terminals as criterion of
Index Terms:
Functional standardization, logical design, minterm partitions, modularity, number of terminals, polynomial orbits, universal Boolean functions, universal logic modules (ULM).
Citation:
F.P. Preparata, "On the Design of Universal Boolean Functions," IEEE Transactions on Computers, vol. 20, no. 4, pp. 418-423, April 1971, doi:10.1109/T-C.1971.223257
Usage of this product signifies your acceptance of the Terms of Use.