On Simplification of Boolean Functions

Abstract

The first part of the article presents an iterative technique for simplifying Boolean functions. The method enables one to obtain prime implicants by simple operations on a set of decimal numbers describing the function. The second part describes a set theoretic approach to find a minimal cover of a switching function from the prime implicant decimal sets. A systematic process of search of redundant and selected prime implicant covers are performed by means of an algorithm.

Indexing Terms:

• Computer Meta-Theory
• Logic Circuits
• Mathematical Techniques