A systematic map method for realizing minimal logic functions of arbitrary number of variables

A map method for reducing a logic function to its minimal form is presented. The function of N variables is first mapped into an m× n map such that m + n = N. Next the map size is reduced by 50% rows or columns by eliminating one of the variables at a time vertically or horizontally. The procedure is repeated till the size of the map becomes 1×1. Because of the inbuilt simplification of logic expressions, the resulting function is minimal. The method is systematic and definitely leads to the minimal function. It is simpler in operation than that based on only Boolean identities, Karnaugh map and Quine-McCluskey methods. It can handle any number of variables. It is explained with several examples.