Journal ArticleDOI
A Method for Generating Prime Implicants of a Boolean Expression
Reads0
Chats0
TLDR
This correspondence gives a method which generates prime implicants in a simple one-pass procedure, starting from the lowest (or highest) points in the function lattice, it generates successive subcubes in a unique sequence.Abstract:
This correspondence gives a method which generates prime implicants in a simple one-pass procedure. Starting from the lowest (or highest) points in the function lattice, it generates successive subcubes in a unique sequence. Each subcube is formed only once.read more
Citations
More filters
Journal ArticleDOI
Two-level logic minimization: an overview
TL;DR: This paper exposes the classical approach for two-level logic minimization, and presents the recent developments that overcome the limitations of the procedures proposed in the past, and reveals a minimizer that is 10 up to 50 times faster than the previously best known ones, and that is able to handle more complex functions.
Journal ArticleDOI
An incremental method for generating prime implicants/implicates
Alex Kean,George K. Tsiknis +1 more
TL;DR: The correctness proof and complexity analysis of the incremental method and the role of prime implicants in the CMS is mentioned and the intricacy of subsumptions in the incremental process is examined.
Book ChapterDOI
Consequence Finding Algorithms
TL;DR: In this section, the notion of consequence finding is introduced and motivated in informal terms and the scope of the chapter and its organization are successively pointed out.
Patent
Prime implicates and query optimization in relational databases
TL;DR: In this paper, an improved normalization methodology for SQL queries is described, which enables better optimization of the original query without the system overhead that would result from full normalization of the query.
Book ChapterDOI
Two-level logic minimization
Olivier Coudert,Tsutomu Sasao +1 more
TL;DR: This chapter presents both exact and heuristic two-level logic minimization algorithms, and shows various techniques to reduce the complexity of covering problems and discusses branching heuristics.
References
More filters
Journal ArticleDOI
Minimization of Boolean functions
TL;DR: A systematic procedure is presented for writing a Boolean function as a minimum sum of products and specific attention is given to terms which can be included in the function solely for the designer's convenience.
Journal ArticleDOI
A Way to Simplify Truth Functions
TL;DR: In this paper, a way to simplify truth functions is proposed. But it is difficult to verify the correctness of truth functions and it is not easy to find the truth functions in practice.
Journal ArticleDOI
The map method for synthesis of combinational logic circuits
TL;DR: The problem in this area which has been attacked most energetically is that of the synthesis of efficient combinational that is, nonsequential, logic circuits.
Journal ArticleDOI
Minimization over Boolean graphs
J. Paul Roth,R. M. Karp +1 more
TL;DR: A general approach to functional decomposition is given and efficient tests for the detection of decompositions are derived and these results are employed in the development of an alphabetic search procedure for determining minimum-cost Boolean graphs which satisfy any given design specifications.
Journal ArticleDOI
On Cores and Prime Implicants of Truth Functions
TL;DR: In this article, the problem of reducing an arbitrary truth-functional formula to a shortest equivalent in normal form was studied, and a theorem was established that a normal formula is uniliterally redundant if and only if not all its clauses are prime implicants of it.