Journal ArticleDOI
Maxterm Type Expressions of Switching Functions and Their Prime Implicants
S. R. Das,A. K. Choudhury +1 more
Reads0
Chats0
TLDR
Algorithms have been formulated for this purpose which first generate all possible prime implicants corresponding to a specified switching function and then select minimal subsets of these primeimplicants for use in the formation of the minimal networks.Abstract:
One of the basic problems of combinational switching circuit theory is that of designing circuits with a minimum number of AND-gates or prime implicants. Algorithms have been formulated for this purpose which first generate all possible prime implicants corresponding to a specified switching function and then select minimal subsets of these prime implicants for use in the formation of the minimal networks [1]-[6]. In practically all the currently available methods of simplification of switching functions, use is made of the minterm type expression specified in the algebraic or its equivalent binary or decimal form. Operations with binary or decimal numbers have become very popular because of their inherent advantages.read more
Citations
More filters
Journal ArticleDOI
Polynomial-time algorithms for generation of prime implicants
TL;DR: It is shown that all presented algorithms are polynomial in the number of minterms occurring in the canonical disjunctive normal form representation of a Boolean function.
Journal ArticleDOI
Clause-Column Table Approach for Generating All the Prime Implicants of Switching Functions
S.R. Das,N.S. Khabra +1 more
TL;DR: This note describes an iterative procedure for generating the prime implicants of switching functions by utilizing a new tabular mode of functional representation called clause-column table, which can be applied equally well to functions given in the sum-of-products or in the product- of-sums froms.
Journal ArticleDOI
A Prime Implicant Algorithm with Factoring
B.L. Hulme,R.B. Worrell +1 more
TL;DR: It is shown that factoring accounts for a dramatic increase in efficiency over Nelson's algorithm, and the increased efficiency is illustrated with results obtained from several examples that were implemented for both algorithms using the symbolic manipulation systems SETS.
Journal ArticleDOI
Boolean function minimization in the class of disjunctive normal forms
A. A. Sapozhenko,I. P. Chukhrov +1 more
TL;DR: The survey focuses on minimization of boolean functions in the class of disjunctive normal forms (d.n.f.s) and covers the publications from 1953 to 1986, and presents a classification of minimization algorithms.
Journal ArticleDOI
Comments on " ANew Algorithm for Generating Prime Implicants"
TL;DR: A new algorithm for the generation of all the prime implicants of a Boolean function is described, which is different from those previously given in the literature and works equally well with either the conjunctive or the disjunctive form of the function.
References
More filters
Journal ArticleDOI
Minimization of Boolean functions
TL;DR: A systematic procedure is presented for writing a Boolean function as a minimum sum of products and specific attention is given to terms which can be included in the function solely for the designer's convenience.
Journal ArticleDOI
The Problem of Simplifying Truth Functions
TL;DR: The Problem of Simplifying Truth Functions is concerned with the problem of reducing the number of operations on a graph to a simple number.
Journal ArticleDOI
The synthesis of two-terminal switching circuits
TL;DR: A basic part of the general synthesis problem is the design of a two-terminal network with given operating characteristics, and this work shall consider some aspects of this problem.
Journal ArticleDOI
Simplest Normal Truth Functions
TL;DR: This paper develops a method for both disjunctive and conjunctive normal truth functions which is in some respects similar to Quine's but which does not involve prior expansion of a formula into developed normal form.
Journal ArticleDOI
A Topological Method for the Determination of the Minimal Forms of a Boolean Function
R. H. Urbano,R. K. Mueller +1 more
TL;DR: A numerical easily programmed procedure is given with which it is possible to treat problems with a greater number of variables than has heretofore been practical.