The Community for Technology Leaders
Green Image
Issue No. 04 - April (1971 vol. 20)
ISSN: 0018-9340
pp: 418-423
A Boolean function U( z<inf>1</inf>,...,z<inf>m</inf>) is universal for given n=1 and a set I of variables if it realizes all Boolean functions f(x<inf>1</inf>,..., x<inf>n</inf>) 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
Functional standardization, logical design, minterm partitions, modularity, number of terminals, polynomial orbits, universal Boolean functions, universal logic modules (ULM).

F. Preparata, "On the Design of Universal Boolean Functions," in IEEE Transactions on Computers, vol. 20, no. , pp. 418-423, 1971.
191 ms
(Ver 3.3 (11022016))