A Fast Algorithm for the Disjunctive Decomposition of Switching Functions

  • Authors:

  • V. Yun-Shen Shen;A. C. McKellar;P. Weiner

  • Affiliations:

  • -;-;-

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1971

Quantified Score

Hi-index 14.99

Visualization

Abstract

An algorithm for obtaining all simple disjunctive decompositions of a switching function is described. It operates on a function given as an expression using the operations AND, EXCLUSIVE OR, and complementation. It uses necessary conditions for the existence of a decomposition to eliminate sets of bound sets from consideration. Thus this technique differs from existing methods in that it attempts