Novel method to simplify Boolean functions

Journal Title: Automatyka - Year 2018, Vol 22, Issue 2

Abstract

Most methods for determining the prime implicants of a Boolean function depend on the minterms of the function. Deviating from this philosophy, this paper presents a method that depends on maxterms (the minterms of the complement of the function) for this purpose. Normally, maxterms are used to get prime implicates and not prime implicants. It is shown that all prime implicants of a Boolean function can be obtained by expanding and simplifying any product of sums form of the function appropriately. No special form of the product of the sums is required. What is more, prime implicants can generally be generated from any form of the function by converting it into a POS using well-known techniques. The prime implicants of a product of Boolean functions can be obtained from the prime implicants of individual Boolean functions. This allows us to handle big functions by breaking them into the products of smaller functions. A simple method is presented to obtain one minimal set of prime implicants from all prime implicants without using minterms. Similar statements also hold for prime implicates. In particular, all prime implicates can be obtained from any sum of a product’s form. Twelve variable examples are solved to illustrate the methods.

Authors and Affiliations

V. C. Prasad

Keywords

Related Articles

On D-decomposition of periodically sampled systems

The problem of the stability of non-uniformly sampled systems is considered. For this purpose, the D-decomposition method for determining the stability region in parameter space is investigated. Moreover, basic informati...

Shape optimization of a flywheel

The article presents the problem of the use of flywheels as an energy storage. More specifically focused on the issue of the optimal shape for isotropic materials and shapes, for which you can analytically determine the...

The approximate location of imperfection in a unit circle using the spectrum of Laplace operator as a research tool

In the following article we will try to find the dependence between the location of imperfections in a closed domain and the spectrum of the Laplace operator for this region. In the theoretical part we will define the sp...

Design, construction and control of a spherical rolling robot with internal two-wheel cart

This elaboration presents a spherical rolling robot with a 2-wheel cart. The custom design of the hardware and control software is presented to demonstrate the solution. The robot was started to realize an autonomous tas...

A thermal model of the building for the design of temperature control algorithms

This paper presents an efficient and effective method for modeling the temperature dynamics in buildings. The method relies on the simultaneous application of heat transfer and engineering thermodynamics principles. The...

Download PDF file
  • EP ID EP531458
  • DOI 10.7494/automat.2018.22.2.29
  • Views 88
  • Downloads 0

How To Cite

V. C. Prasad (2018). Novel method to simplify Boolean functions. Automatyka, 22(2), 29-40. https://europub.co.uk/articles/-A-531458