A Fast Algorithm for Complete Minimization of Boolean Functions

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1972
Accession Number
AD0744492

Entities

People

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

Organizations

  • Auburn University

Tags

Communities of Interest

  • Air Platforms
  • C4I
  • Weapons Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Assembly Languages
  • Cells
  • Cellular Structures
  • Computer-Aided Design
  • Computers
  • Contracts
  • Coverings
  • Electrical Engineering
  • Engineering
  • Information Processing
  • Language
  • Notation
  • Procedures (Computers)
  • Universities

Fields of Study

  • Computer science

Readers

  • Computer Science.
  • Graph Algorithms and Convex Optimization.