|
| 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
| ASCII Text | x | ||
| F.P. Preparata, "On the Design of Universal Boolean Functions," IEEE Transactions on Computers, vol. 20, no. 4, pp. 418-423, April, 1971. | |||
| BibTex | x | ||
| @article{ 10.1109/T-C.1971.223257, author = {F.P. Preparata}, title = {On the Design of Universal Boolean Functions}, journal ={IEEE Transactions on Computers}, volume = {20}, number = {4}, issn = {0018-9340}, year = {1971}, pages = {418-423}, doi = {http://doi.ieeecomputersociety.org/10.1109/T-C.1971.223257}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - On the Design of Universal Boolean Functions IS - 4 SN - 0018-9340 SP418 EP423 EPD - 418-423 A1 - F.P. Preparata, PY - 1971 KW - Functional standardization KW - logical design KW - minterm partitions KW - modularity KW - number of terminals KW - polynomial orbits KW - universal Boolean functions KW - universal logic modules (ULM). VL - 20 JA - IEEE Transactions on Computers ER - | |||
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.