PDA-Based Boolean Function Simplification: A Useful Educational Tool
Document Type
Article
Publication Date
1-1-2004
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.
Montclair State University Digital Commons Citation
Bitincka, Ledion and Antoniou, George, "PDA-Based Boolean Function Simplification: A Useful Educational Tool" (2004). Department of Computer Science Faculty Scholarship and Creative Works. 474.
https://digitalcommons.montclair.edu/compusci-facpubs/474