UPPER BOUND ON NUMBER OF PRODUCTS IN AND-OR-XOR EXPANSION OF LOGIC FUNCTIONS

Authors
DUBROVA EV MILLER DM MUZIO JC
Citation
Ev. Dubrova et al., UPPER BOUND ON NUMBER OF PRODUCTS IN AND-OR-XOR EXPANSION OF LOGIC FUNCTIONS, Electronics Letters, 31(7), 1995, pp. 541-542
Citations number
4
Categorie Soggetti
Engineering, Eletrical & Electronic
Journal title
Electronics Letters → ACNP
ISSN journal
00135194
Volume
31
Issue
7
Year of publication
1995
Pages
541 - 542
Database
ISI
SICI code
0013-5194(1995)31:7<541:UBONOP>2.0.ZU;2-#
Abstract
The representation of logic functions consisting of an XOR sum ol two sum-of-products expressions is considered. The upper bound on the numb er of products in the representation is shown to be 5 . 2(n=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.