A Programme for Computer-Aided Design of Logic Circuits

Abstract

In spite of growing application of MSI and LSI circuits, the interest in minimizing of Boolean functions continues for several reasons. Modern minimizing methods, however, should be matched to computer-aided design.

It turned out that classical methods like e.g. Quine-McCluskey method arc not extremely suitable for this purpose, due to their high memory demand and long CPU time requirements.

The paper describes a minimizing programme requiring only about half the storage space, and working at speeds approximately two orders of magnitude higher than programme using the Quine-McCluskey method. In addition, it produces all irredundant forms of the function.

Indexing Terms:

• Minimization Methods
• Computer-Aided Design
• Logic Circuits