Karnaugh map analysis and synthesis of threshold functions

Srivatsa, SK and Biswas, NN (1977) Karnaugh map analysis and synthesis of threshold functions. In: International Journal of Systems Science, 8 (12). 1385 -1399.

PDF 836870__776250739.pdf - Published Version Restricted to Registered users only Download (5MB) | Request a copy

Abstract

A unate function can easily be identified on a Karnaugh map from the well-known property that it cons ist s only ofess en ti al prime implicante which intersect at a common implicant. The additional property that the plot of a unate function F(x, ... XII) on a Karnaugh map should possess in order that F may also be Ivrealizable (n';:; 6) has been found. It has been sh own that the I- realizability of a unate function F corresponds to the ' compac tness' of the plot of F. No resort to tho inequalities is made, and no pre-processing such as positivizing and ordering of the given function is required.

Item Type:	Journal Article
Publication:	International Journal of Systems Science
Publisher:	Taylor and Francis Ltd
Additional Information:	Copyright for this article belongs to Taylor and Francis Ltd.
Keywords:	Artificial Intelligence; Automation; Automation Control; Control Engineering; Cybernetics; Dynamical Control Systems; Dynamical Systems; Electronics; Evolutionary Computing; General Systems; Intelligent Systems; Networks; Non-Linear Systems; Statistics & Probability: Operations Research; Industrial Engineering & Manufacturing: Operations Research; Simulation & Modeling; Supply Chain Management; Systems & Control Engineering; Systems & Controls; Systems Architecture; Systems Engineering
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	15 Jan 2010 07:03
Last Modified:	19 Sep 2010 05:48
URI:	http://eprints.iisc.ac.in/id/eprint/24003

Actions (login required)

View Item