Minimization method of Boolean functions

Bohdan Rytsar

doi:10.1117/12.284818

20 October 1997 Minimization method of Boolean functions

Bohdan Rytsar

Proceedings Volume 3238, Current Ukrainian Research in Optics and Photonics: Optoelectronic and Hybrid Optical/Digital Systems for Image Processing; (1997) https://doi.org/10.1117/12.284818
Event: Optoelectronic and Hybrid Optical/Digital Systems for Image Processing, 1997, none, Ukraine

Abstract

A new minimization method of Boolean functions of many variables is based on the comparison of numerical data of given function with any numbers of so-called conjuncterm field. Such conjuncterm field contains the set of conjuncterm values of all ranks, which are defined before. Comparing with traditional ones, the proposed algorithm provides the reducing of an operations number. Two application aspects are proposed in this paper. The first one is manual with using of a pattern of a graph function, and the second - computing method - with using of the conjuncterm field matrix of given n-variables function. This approach is suitable for minimization of Boolean functions system, too.

Citation Download Citation

Bohdan Rytsar "Minimization method of Boolean functions", Proc. SPIE 3238, Current Ukrainian Research in Optics and Photonics: Optoelectronic and Hybrid Optical/Digital Systems for Image Processing, (20 October 1997); https://doi.org/10.1117/12.284818

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available