INFORMATICA International Journal Main Page Editorial Board Abstracting/Indexing Instructions to Authors Subscription Information Contents Author Index Papers in Production		INFORMATICA, 2004, Vol. 15, No. 3, 329-336 © Institute of Mathematics and Informatics, ISSN 0868-4952 PDA-based Boolean Function Simplification: a Useful Educational Tool Ledion BITINCKAa, George E. ANTONIOUb aDepartment of Biochemistry and Biophysics, University of California San Francisco San Francisco, CA, 94143, USA E-mail: ledion@bitincka.com bImage 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 To preview Lithuanian abstract see full article text To preview full article text in PDF format click here You could obtain free Acrobat Reader from Adobe
Top		Copyright © INFORMATICA, Vilnius University Institute of Mathematics and Informatics, 2010