2003
DOI: 10.3390/mca8030271
|View full text |Cite
|
Sign up to set email alerts
|

Boolean Functions Simplification Algorithm of O(n) Complexity

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).

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2007
2007
2022
2022

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…Reducing rules makes ESs more efficient, saves time and makes it easier to transfer rules to the ES. BFM rules, methods and practices are explained in the literature (Basciftci and Hatay, 2011; Basciftci and Eldem, 2013; Kahramanlı and Basciftci, 2003; Basciftci and Kahramanlı, 2010; Malik et al , 1991).…”
Section: Methodsmentioning
confidence: 99%
“…Reducing rules makes ESs more efficient, saves time and makes it easier to transfer rules to the ES. BFM rules, methods and practices are explained in the literature (Basciftci and Hatay, 2011; Basciftci and Eldem, 2013; Kahramanlı and Basciftci, 2003; Basciftci and Kahramanlı, 2010; Malik et al , 1991).…”
Section: Methodsmentioning
confidence: 99%