No abstract

Boolean algebra is a set of rules, laws, and theorems by which logical operations can be expressed mathematically. In its application one has to reduce a particular expression to its simplest form. Karnaugh map and Quine McCluskey (Q-M) method are the systematic approach for simplifying and manipulating Boolean expressions. In this paper a simpler approach to minimize logical functions is introduced which will be followed by prime implicant chart as in the Q-M method to reduce the possibility of occurring an error. With this approach the number of gates required to realize a function gets reduced to a great extent with minimum effort as the manipulation is totally based on decimal values. This technique can be used to any number of variables to improve the performance of presently existing methods.

No abstract