A fast APL algorithm for logic minimization

  • Authors:

  • Alfred A. Schwartz

  • Affiliations:

  • Advisory Engineer/Advanced Information Products, IBM Corporation, Entry Systems Division, 11400 Burnet Road, Austin, Texas

  • Venue:
  • APL '84 Proceedings of the international conference on APL
  • Year:
  • 1984

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents an algorithm for logic reduction which exploits APL's array and Boolean processing capabilities. The traditional algorithm, the Quine-McCluskey method, requires extensive looping and hence is very slow when implemented in an interpretive language. The APL algorithm accomplishes the same function as the Quine-McCluskey method, but in a totally different way and much faster.