Advertisement

Using consensusless covers for fast operating on Boolean functions

  • Eugene Goldberg
  • Ludmila Krasilnikova
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 849)

Abstract

The paper presents a method for fast operating on covers of Boolean functions. The method develops the one based on the unate paradigm (UP)[1]. The proposed method differs from the UP one in two aspects (1) the initial cover is decomposed into a set of prime rather than unate subcovers, (2) prime covers are obtained by applying to each reched not prime subcover either branching by the Shannon expansion or a procedure of making the subcover consensusless in a variable by the consensus operation. Experiments on MCNC-91 two-level logic benchmarks and random functions show that operations based on the proposed method are less laborious than their UP based counterparts.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Brayton R.K., e.a. Fast recursive Boolean function manipulation, Proc. Int. Symp. Circuits and Syst. Rome, Italy, May 1982, pp.58–62.Google Scholar
  2. [2]
    Brayton R.K., e.a. Logic minimization algorithms for VLSI synthesis. Norwell, MA: Kluwer Academic Publishers, 1984.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Eugene Goldberg
    • 1
  • Ludmila Krasilnikova
    • 1
  1. 1.Institute of Engineering CyberneticsThe Academy of Sciences of BelarusMinskRepublic of Belarus

Personalised recommendations