UNIVERSAL FUNCTIONS,
Abstract
The report deals with the theory and application of 'universal functions,' with some attention to current and future logic design and technology. A universal function module is a logical network which is capable of performing every Boolean function of a fixed set of inputs by biasing its remaining inputs appropriately with zeros and ones; a universal function is the function the network, as a whole, performs. After an introductory section, there is a study of a universal function based on the EXCLUSIVE OR decomposition as an alternative to the universal function based on the minterm decomposition; a two-element EXCLUSIVE OR gate is suggested. Section III lists and discusses the 24 universal functions for one variable. The general theory of universal functions is developed in Section IV; their number, interrelationship, and relationship to other Boolean functions is determined. Section V considers certain kinds of universal function and multifunction modules. The report concludes with indications of areas for future research. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Apr 01, 1968
- Accession Number
- AD0669849
Entities
People
- James T. Ellison
Organizations
- Sperry Corporation