An Algorithm for Fast Boolean Function Minimization Using Properties of the Cellular N-Cube

摘要

Properties of the cellular n-cube representation are used to advantage in developing a fast algorithm for finding the 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 PL/I source program listing for the automated algorithm is included. (Author)