A Heuristic Approach to Two Level Boolean Minimization Derived from Karnaugh Mapping

08/21/2020 ∙ by Ethan L. Childerhose, et al. ∙ 0 ∙ share

The following paper presents a heuristic method by which sum-of-product Boolean expressions can be simplified with a specific focus on the removal of redundant and selective prime implicants. Existing methods, such as the Karnaugh map and the Quine-McCluskey method [1, 2], fail to scale since they increase exponentially in complexity as the quantity of literals increases, doing as such to ensure the solution is algorithmically obtained. By employing a heuristic model, nearly all expressions can be simplified at an overall reduction in computational complexity. This new method was derived from the fundamental Boolean laws, Karnaugh mapping, as well as truth tables.

READ FULL TEXT

Computing the Boolean product of two n× n Boolean matrices using O(n^2) mechanical operation

We study the problem of determining the Boolean product of two n× n Bool...
04/27/2020 ∙ by Andrzej Lingas, et al. ∙ 0 ∙ share

read it
Prime Clocks

Physical implementations of digital computers began in the latter half o...
10/02/2019 ∙ by Michael Stephen Fiske, et al. ∙ 0 ∙ share

read it
The Complexity of Boolean State Separation (Technical Report)

For a Boolean type of nets τ, a transition system A is synthesizeable in...
10/02/2020 ∙ by Ronny Tredup, et al. ∙ 0 ∙ share

read it
A Method Expanding 2 by 2 Contingency Table by Obtaining Tendencies of Boolean Operators: Boolean Monte Carlo Method

A medical test and accuracy of diagnosis are often discussed with contin...
02/11/2020 ∙ by Takuma Usuzaki, et al. ∙ 0 ∙ share

read it
Hardware realization of residue number system algorithms by Boolean functions minimization

Residue number systems (RNS) represent numbers by their remainders modul...
08/09/2018 ∙ by Danila Gorodecky, et al. ∙ 0 ∙ share

read it
Obesity Heuristic, New Way On Artificial Immune Systems

There is a need for new metaphors from immunology to flourish the applic...
11/24/2012 ∙ by Mohammed El-Dosuky, et al. ∙ 0 ∙ share

read it
Generalizing Boolean Satisfiability II: Theory

This is the second of three planned papers describing ZAP, a satisfiabil...
09/09/2011 ∙ by H. E. Dixon, et al. ∙ 0 ∙ share

read it

A Heuristic Approach to Two Level Boolean Minimization Derived from Karnaugh Mapping

Authors

Computing the Boolean product of two n× n Boolean matrices using O(n^2) mechanical operation

Prime Clocks

The Complexity of Boolean State Separation (Technical Report)

A Method Expanding 2 by 2 Contingency Table by Obtaining Tendencies of Boolean Operators: Boolean Monte Carlo Method

Hardware realization of residue number system algorithms by Boolean functions minimization

Obesity Heuristic, New Way On Artificial Immune Systems

Generalizing Boolean Satisfiability II: Theory

This week in AI