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

Abstract

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1970
Accession Number
AD0711821

Entities

People

  • Chester C. Carroll
  • William A. Hornfeck

Organizations

  • Auburn University

Tags

Communities of Interest

  • Weapons Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Cells
  • Cellular Structures
  • Computations
  • Computer Programs
  • Computers
  • Contracts
  • Digital Computers
  • Electrical Engineering
  • Engineering
  • Equations
  • New York
  • Notation
  • Two Dimensional
  • Universities

Fields of Study

  • Computer science

Readers

  • Computer Science.
  • Graph Algorithms and Convex Optimization.