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.
This is a preview of subscription content, log in via an institution to check access.
References
Brayton R.K., e.a. Fast recursive Boolean function manipulation, Proc. Int. Symp. Circuits and Syst. Rome, Italy, May 1982, pp.58–62.
Brayton R.K., e.a. Logic minimization algorithms for VLSI synthesis. Norwell, MA: Kluwer Academic Publishers, 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goldberg, E., Krasilnikova, L. (1994). Using consensusless covers for fast operating on Boolean functions. In: Hartenstein, R.W., ServÃt, M.Z. (eds) Field-Programmable Logic Architectures, Synthesis and Applications. FPL 1994. Lecture Notes in Computer Science, vol 849. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58419-6_75
Download citation
DOI: https://doi.org/10.1007/3-540-58419-6_75
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58419-3
Online ISBN: 978-3-540-48783-8
eBook Packages: Springer Book Archive