Title :
Upper bound on number of products in AND-OR-XOR expansion of logic functions
Author :
Dubrova, E.V. ; Miller, D.M. ; Muzio, J.C.
Author_Institution :
Dept. of Comput. Sci., Victoria Univ., BC, Canada
fDate :
3/30/1995 12:00:00 AM
Abstract :
The representation of logic functions consisting of an XOR sum of two sum-of-products expressions is considered. The upper bound on the number of products in the representation is shown to be 5.2n-4, which is 37.50% smaller than the upper bound for a sum-of-product expression and 16.67% smaller than the bound for an AND-XOR expression
Keywords :
Boolean functions; CMOS logic circuits; combinational circuits; AND-OR-XOR expansion; CMOS logic circuits; XOR sum; logic functions; sum-of-products expressions; upper bound;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:19950377
