Minimization of Boolean Functions

1 August 1971

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers

Vol. C-20 (8) , 925-929
https://doi.org/10.1109/t-c.1971.223373

Abstract

The Quine–McCluskey method of minimizing a Boolean function gives all the prime implicants, from which the essential terms are selected by one or more cover tables known as the prime implicant tables. This note describes a tabular method where the essential prime implicants are selected during the process of forming the combination tables, and other essential terms are selected from what have been described in the note as chains of selective prime implicants. Consequently, the need for successive prime implicant tables is eliminated.

Keywords

This publication has 3 references indexed in Scilit:

A Method for Simplifying Boolean Functions
Bell System Technical Journal, 1962
The map method for synthesis of combinational logic circuits
Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics, 1953
The Problem of Simplifying Truth Functions
The American Mathematical Monthly, 1952