Next Article in Journal
Solvability Conditions and Green Functional Concept for Local and Nonlocal Linear Problems for a Second Order Ordinary Differential Equation
Previous Article in Journal
On the Mathematical Modeling of Beams Rotating about a Fixed Axis
Article Menu

Article Versions

Export Article

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

Boolean Functions Simplification Algorithm of O(n) Complexity

1
Selcuk University, Department of Computer Engineering
2
Selcuk University, Department of Electronic and Computer Systems Education
*
Authors to whom correspondence should be addressed.
Published: 1 December 2003
Download PDF [568 KB, uploaded 31 March 2016]

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(2n) 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(2n).
Keywords: Boolean function, simplification; minimization, Boolean expression; prime implicant; cube algebra; covering algorithm; simplification complexity; cube operations Boolean function, simplification; minimization, Boolean expression; prime implicant; cube algebra; covering algorithm; simplification complexity; cube operations
This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Kahramanli, Ş.; Başçiftçi, F. Boolean Functions Simplification Algorithm of O(n) Complexity. Math. Comput. Appl. 2003, 8, 271-278.

Show more citation formats Show less citations formats

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Math. Comput. Appl. EISSN 2297-8747 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top