A Fast Algorithm for Complete Minimization of Boolean Functions

摘要

Properties of the cellular n-cube representation are used to advantage in developing a fast algorithm for finding the Prime Implicants, Essential Prime Implicants and Non-essential Prime Implicants of a Boolean function. The algorithm is discussed and several examples are included showing computer solutions to selected Boolean function minimization problems. The complete FORTRAN source program listing for the automated algorithm is included. (Author)