• DocumentCode
    771639
  • 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
  • Volume
    31
  • Issue
    7
  • fYear
    1995
  • fDate
    3/30/1995 12:00:00 AM
  • Firstpage
    541
  • Lastpage
    542
  • 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;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

  • DOI
    10.1049/el:19950377
  • Filename
    381811
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=771639