On the Design of Universal Boolean Functions
Author:
- 1 April 1971
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-20 (4) , 418-423
Abstract
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 simplicity, the designs obtained are the best known to be offered by a systematic procedure for the same specifications.Keywords
This publication has 5 references indexed in Scilit:
- Generation of near-optimal universal Boolean functionsJournal of Computer and System Sciences, 1970
- Universal Logic Modules and Their ApplicationsIEEE Transactions on Computers, 1970
- Universal logic circuits and their modular realizations1968
- A complex logic module for the synthesis of combinational switching circuits1967
- The universal logic block (ULB) and its application to logic design7th Annual Symposium on Switching and Automata Theory (swat 1966), 1966