A method for simplifying Boolean functions

This article presents an iterative technique for simplifying Boolean functions. The method enables the user to obtain prime implicants by simple operations on a set of decimal numbers which describe the function. This technique may be used for functions of any number of variables.

[1]  E. McCluskey.  Minimization of Boolean functions , 1956 .

[2]  Frank B. Hall.  Boolean prime implicants by the binary sieve method , 1962, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.