DocumentCode
2198873
Title
On minimal modulo 2 sums of products for switching functions
Author
Even, S. ; Kohavi, I. ; Paz, A.
fYear
1966
fDate
26-28 Oct. 1966
Firstpage
201
Lastpage
206
Abstract
The minimal number of terms required for representing any switching function as a modulo-2 sums of products is investigated, and algorithm for obtaining economical realizations is described. The main result is the following: Every symmetric function of 2m+1 variables has a modulo-2 sum of products realization with at most 3m terms, but there are functions of n variables which require at least 2n/n long23 terms, for sufficiently large n.
Keywords
Minimization methods;
fLanguage
English
Publisher
ieee
Conference_Titel
Switching and Automata Theory, 1966., IEEE Conference Record of Seventh Annual Symposium on
Conference_Location
Berkeley, CA, USA
ISSN
0272-4847
Type
conf
DOI
10.1109/SWAT.1966.13
Filename
4569535
Link To Document