The variable-entered Karnaugh map (VEKM) is a powerful manual tool of many pictorial and pedagogical advantages and a variety of medium-sized applications. This paper presents a novel VEKM procedure f...
Abstract
An algorithm for finding the prime implicants of a Boolean function is given. The algorithm is similar to Nelson's algorithm since both involve the operations of complementing, expanding, an...
Abstract
Solving prime implicant tables is greatly facilitated by reduction techniques such as row dominance, column dominance and essential row selection. This paper presents a new reduction techniq...
Abstract
Solving prime implicant tables is greatly facilitated by reduction techniques such as row dominance, column dominance and essential row selection. This paper presents a new reduction techniq...
Abstract
A common recursive formulation is presented for determining: 1) all the prime implicants, and 2) an irredundant normal form of any completely or incompletely specified Boolean function given...
Rating: Views: (2000)
Pages: (0)
Uploaded: Publication Date: June 1970
Abstract
A simple refinement of Morreale's method yields a useful criterion to identify and cancel the redundant subfunctions generated in the application of the Pi-algorithm. Use of such a criterion...
The Implicant Network is a neural network model capable of storing an arbitrary boolean function F:{0,1}^n -> {0,1}. The difference from previous one-shot learning models is that the training algorith...
Abstract. Thelen?s algorithm is an efficient method for generation of the prime implicants of a Boolean function represented in CNF. In the paper new heuristics are presented, allowing to accelerate t...