The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.08 - August (1971 vol.20)
pp: 925-929
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.
INDEX TERMS
Minimization method, tabular method, selective prime implicants.
CITATION
N.N. Biswas, "Minimization of Boolean Functions", IEEE Transactions on Computers, vol.20, no. 8, pp. 925-929, August 1971, doi:10.1109/T-C.1971.223373
25 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool