Minimization algorithm for multiple input to two input variables

Modern society developed on the base of technology improvement. Progress in technologies based on computer, communication and automatic controls engineering all are depends on Integrated Circuit(IC). In the first half of 1990s, the electronic industry experienced an explosion in the demand for personal computers, cellular telephones, and high speed data communication devices. Vying for market share, vendors built products increasingly greater functionality, higher performance; lower cost, lower power consumption, and smaller in dimensions. To do these, vendors created highly integrated, complex systems with fewer IC devices and less printed-circuit-board (PCB) area. Minimizations of combinational logic functions before implementation in hardware have many advantages. A reduced number of gates considerably decreases the cost of the hardware, reduces the heat generated by the chip and most importantly increases the speed. Boolean functions may be simplified by algebraic means by applying the basic laws and theorems. However, this procedure is awkward because it lacks specific rules to predict each succeeding step in the minimization process for multi-input variables. The simplification by K-mapping has many disadvantages of redundant grouping and non-unique solution. But no method is effective for the simplification of Boolean functions, if it involves more than six variables. A few algorithm and modified technique are found in literature. This paper proposes an algorithm for reduction from multi input into two input variables.