Accession Number : AD0744492

Title :   A Fast Algorithm for Complete Minimization of Boolean Functions.

Descriptive Note : Technical rept.,

Corporate Author : AUBURN UNIV ALA DIGITAL SYSTEMS LAB

Personal Author(s) : Shiva,S. G. ; Nagle,H. Troy , Jr

Report Date : JUN 1972

Pagination or Media Count : 77

Abstract : 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)

Descriptors :   (*SPECIAL FUNCTIONS(MATHEMATICAL), OPTIMIZATION), MATHEMATICAL LOGIC, ALGEBRAS, SET THEORY, LOGIC CIRCUITS, COMPUTER PROGRAMS, THEOREMS, ALGORITHMS

Subject Categories : Theoretical Mathematics
      Computer Programming and Software

Distribution Statement : APPROVED FOR PUBLIC RELEASE