Abstract
ABSTRACT The present paper is basically concerned with the problem of decomposition of general Boolean functions into unate sub-functions and a study of the associated properties. It is shown that the primary information regarding such a decomposition into unate functions can be had from the cover table representation of the given function. It is also shown how a knowledge of some of the geometrical properties of Boolean functions greatly facilitates recognition of threshold functions in certain special cases. A simplified procedure is finally suggested for realizing a given Boolean function with a fewer number of threshold logic elements. At every stage examples are worked out to show the decomposition and the recognition procedures and to illustrate the synthesis method.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
