A NEW NEAR MINIMUM SIMPLIFICATION ALGORITHM FOR SWITCHING FUNCTIONS

The minimization of Switching functions allows designers to make use of fewer components, thus reducing the cost of particular system. Simplified as a function requires less power consumption, less volume and less cost. Most of minimization techniques work on a two-step principle, the first step identifies all of the prime implicants and the second step selects the subset of prime implicants that covers the function(s) being minimized. All procedures for Boolean networks into prime and irredundant form have O(2(n)) complexity. Prime Implicants identification step can be computational impractical as n increases. Therfore, in this study, subsets of prime implicants that can prove direct cover principle which based on definite criterions use for mimimization method. The method has been tested on several different kinds of problems and results of which were compared with ESPRESSO Comparison of algorithms as benchmarks; solution as a result they find that their total number of product terms, the solution times and reach a solution when they reach the memory capacity is taken. According to the results of the comparison developed algorithm gives successful results.