The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - April (1971 vol.20)
pp: 418-423
ABSTRACT
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
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
20 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool