Decomposition of systems of Boolean functions determined by binary decision diagrams

  • Authors:
  • P. N. Bibilo;P. V. Leonczyk

  • Affiliations:
  • United Institute of Informatics Problems, National Academy of Sciences of Belarus, Minsk, Belarus BY-220012;United Institute of Informatics Problems, National Academy of Sciences of Belarus, Minsk, Belarus BY-220012

  • Venue:
  • Journal of Computer and Systems Sciences International
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

A method for the decomposition of systems of completely defined Boolean functions given a two-block partition of the set of variables and a decision algorithm for the partition of this set are proposed. The system of functions is determined by a binary decision diagram, which simplifies the search for the variable partition and the decomposition based on this partition. Results of experimental studies demonstrating the efficiency of the proposed decomposition in the synthesis of logic circuits are presented.