Boolean Functions Simplification Algorithm of O(n) Complexity

Şirzat Kahramanli; Fatih Başçiftçi

doi:10.3390/mca8030271

You are currently viewing a new version of our website. To view the old version click .

Mathematical and Computational Applications is published by MDPI from Volume 21 Issue 1 (2016). Previous articles were published by another publisher in Open Access under a CC-BY (or CC-BY-NC-ND) licence, and they are hosted by MDPI on mdpi.com as a courtesy and upon agreement with Association for Scientific Research (ASR).

Article

1 December 2003

Boolean Functions Simplification Algorithm of O(n) Complexity

and

Selcuk University, Department of Computer Engineering

Selcuk University, Department of Electronic and Computer Systems Education

Authors to whom correspondence should be addressed.

Math. Comput. Appl.2003, 8(3), 271-278;https://doi.org/10.3390/mca8030271

Version Notes

Order Reprints

Abstract

The minimization of Boolean functions allows designers to make use of fewer components, thus reducing the cost of particular system. All procedures for reducing either two-level or multilevel Boolean networks into prime and irredundant form have O(2ⁿ) complexity. Prime Implicants identification step can be computational impractical as n increases. Thus it is possible to get method in order to find the minimal set of Prime Implicants of O(n) complexity instead of O(2ⁿ).

Keywords:

Boolean function, simplification; minimization, Boolean expression; prime implicant; cube algebra; covering algorithm; simplification complexity; cube operations

Article Metrics

Citations

Article Access Statistics

Journal Statistics

Multiple requests from the same IP address are counted as one view.

On the Mathematical Modeling of Beams Rotating about a Fixed Axis

Solvability Conditions and Green Functional Concept for Local and Nonlocal Linear Problems for a Second Order Ordinary Differential Equation