A FAST ALGORITHM FOR BOOLEAN FUNCTION MINIMIZATION.
AUBURN UNIV ALA
Pagination or Media Count:
The structure of the cellular n-dimensional cube is studied with emphasis placed on containment of vertices by cells. The isomorphic relation between the cells of the n-Cube and the products of a Boolean function is discussed. A computer oriented algorithm is derived in terms of the cellular representation for the generation of prime implicants for Boolean functions. Time consuming numerical calculations are replaced by logical operations and storage of terms is limited to minterms and prime implicants. Author
- Electrical and Electronic Equipment
- Theoretical Mathematics