Document Type
Article
Publication Date
1-1-2004
Journal / Book Title
Informatica
Abstract
In this paper a useful educational tool is presented for minimizing low order Boolean expressions. The algorithm follows the Karnaugh map looping approach and provides optimal results. For the implementation, C++ was used on the CodeWarrior for Palm Operating System environment. In order to make the overall implementation efficient, the object oriented approach was used. Two step-by-step examples are presented to illustrate the efficiency of the proposed algorithm. The proposed application can be used by students and professors in the fields of electrical and computer engineering and computer science. © 2004 Institute of Mathematics and Informatics Vilnius.
DOI
10.15388/informatica.2004.064
Montclair State University Digital Commons Citation
Bitincka, Ledion and Antoniou, George E., "PDA-based boolean function simplification: A useful educational tool" (2004). Department of Computer Science Faculty Scholarship and Creative Works. 763.
https://digitalcommons.montclair.edu/compusci-facpubs/763
Rights
This article is Open Access and distributed under a Creative Commons 4.0 license.
Published Citation
Bitincka, L., & Antoniou, G. E. (2004). PDA‐based Boolean Function Simplification: a Useful Educational Tool. Informatica, 15(3), 329-336. doi:10.15388/Informatica.2004.064