Accession Number:

AD0744492

Title:

A Fast Algorithm for Complete Minimization of Boolean Functions

Descriptive Note:

Technical Report

Corporate Author:

AUBURN UNIV AUBURN United States

Personal Author(s):

• Shiva,S. G.
• Nagle,Troy Jr H.

Report Date:

1972-06-01

Pagination or Media Count:

77.0

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.

Descriptors:

• SPECIAL FUNCTIONS(MATHEMATICAL)
• OPTIMIZATION
• MATHEMATICAL LOGIC
• ALGEBRAS
• SET THEORY
• LOGIC CIRCUITS
• COMPUTER PROGRAMS
• THEOREMS
• ALGORITHMS

Subject Categories:

Distribution Statement:

APPROVED FOR PUBLIC RELEASE