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.
Math. Comput. Appl. 2003, 8(3), 271-278; https://doi.org/10.3390/mca8030271
Published: 1 December 2003
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).
Share and Cite
MDPI and ACS Style
Kahramanli, Ş.; Başçiftçi, F. Boolean Functions Simplification Algorithm of O(n) Complexity. Math. Comput. Appl. 2003, 8, 271-278. https://doi.org/10.3390/mca8030271
AMA Style
Kahramanli Ş, Başçiftçi F. Boolean Functions Simplification Algorithm of O(n) Complexity. Mathematical and Computational Applications. 2003; 8(3):271-278. https://doi.org/10.3390/mca8030271
Chicago/Turabian StyleKahramanli, Şirzat, and Fatih Başçiftçi. 2003. "Boolean Functions Simplification Algorithm of O(n) Complexity" Mathematical and Computational Applications 8, no. 3: 271-278. https://doi.org/10.3390/mca8030271
