Determining the possible minimal Boolean expressions via a newly developed procedure and tool

This paper proposes a new idea and implementation tool for two level minimization of Boolean expressions. A simpler and more versatile method is developed by exploiting the adjacency field relationships between Gray code and decimal numbers. Our algorithmic procedures also consider the optimal use of don´t care terms. We implemented our algorithm in MATLAB and tested accuracy and efficiency for large values of input variables (more than 25). This developed novel technique is bound to provide all possible optimally minimized Boolean expressions.