PDA‐based Boolean Function Simplification: a Useful Educational Tool

Article type: Research Article

Authors: Bitincka, Ledion | Antoniou, George E.

Affiliations: Department of Biochemistry and Biophysics, University of California San Francisco, San Francisco, CA, 94143, USA, e‐mail: ledion@bitincka.com | Image Processing and Systems Laboratory, Department of Computer Science, Montclair State University, Upper Montclair, New Jersey 07043, USA, e‐mail: george.antoniou@montclair.edu

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.

Keywords: Boolean simplification, digital logic tool, Karnaugh maps, Palm and PDA application

Journal: Informatica, vol. 15, no. 3, pp. 329-336, 2004