Ministry of Education, Culture and Research of the Republic of Moldova

Technical University of Moldova

Department of Automation and Software Engineering

Project in LogicWorks 4.06

„The minimization of the Boolean functions”

Galaju Margareta, gr FAF-182

Computer Architecture
Associate Professor, Phd, Sudacevshi Viorica

2019
Definitions:
Truth Table - a mathematical table used in logic—specifically in connection with Boolean
algebra, boolean functions, and propositional calculus—which sets out the functional values of
logical expressions on each of their functional arguments, that is, for each combination of values
taken by their logical variables. On the other hand, a truth table is a handy little logical device that
shows up not only in mathematics, but also in Computer Science and Philosophy, making it an
awesome interdisciplinary tool. The notation may vary depending on what discipline you’re
working in, but the basic concepts are the same. In particular, truth tables can be used to show
whether a propositional expression is true for all legitimate input values, that is, logically valid.
Minterms - Boolean expressions resulting in 1 for the output of a single cell, and 0s for all other
cells in a Karnaugh map, or truth table. If a minterm has a single 1 and the remaining cells as 0s, it
would appear to cover a minimum area of 1s. There are used for sum of product(SOP) canonical
forms, which is also called disjunctive normal form(DNF). The value corresponds to 1 or true is
selected as minterm.
Maxterms - Boolean expressions resulting in a 0 for the output of a single cell expression, and 1s
for all other cells in the Karnaugh map, or truth table. If a maxterm has a single 0 and the
remaining cells as 1s, it would appear to cover a maximum area of 1s. There are used for product
of sum(POS) canonical forms, which is also called conjunctive normal form(CNF). The value
corresponds to 0 or false is selected as maxterm.
SOP and POS -the minterms and maxterms may be used to define the two standard forms for
logic expressions, namely the sum of products (SOP), or sum of minterms, and the product of sums
(POS), or product of maxterms. These standard forms of expression aid the logic circuit designer
by simplifying the derivation of the function to be implemented. Boolean functions expressed as a
sum of products or a product of sums are said to be in canonical form. Note the POS is not the
complement of the SOP expression. The SOP expression is the equation of the logic function as
read off the truth table to specify the input combinations when the output is a logical 1. The POS
expression is the equation of the logic function as read off the truth table to specify the input
combinations when the output is a logical 0.
Circuits - a model of computation in which input values proceed through a sequence of gates, each
of which computes a function. Circuits of this kind provide a generalization of Boolean circuits
and a mathematical model for digital logic circuits. Circuits are defined by the gates they contain
and the values the gates can produce.
Timing diagram - graphical representation of input and output signals as functions of time. Since
the inputs and outputs can only take the values 0 or 1, their graphical representations are series of
square pulses with a variety of time lengths.
Given:
Y = (1,2,4,5,6,8,10,14,15)
To find:
1. Truth Table
2. Minimum sum
3. Minimum product
4. Draw circuits for SOP and POS
5. Timing diagram
 I. Minimum sum

y = ∑ (1,2,4,5,6,8,10,14,15) = x1`x3`x4 + x1’x2x3`+ x1x2x3+x3x4’+x1x2’x3x4’

Truth table:

0 1 0 1
0 1 0 0
0 0 1 0
1 1 1 1

Logical circuit:
 II. Minimum product

y = ∑ (1,2,4,5,6,8,10,14,15) = (x1`+x3`+x4) (x1’+x2+x3`)( x1+x2+x3)(x3+x4’)(x1+x2’+x3+x4’)

Truth table:

0 1 0 1
0 1 0 0
0 0 1 0
1 1 1 1

Logical circuit:
 III. Conclusions:

Digital circuits use digital signals to operate. These signals have binary values; they can be
either one or zero. Zero represents false or low state whereas one represents true or high state.
Boolean algebra helps to describe the binary numbers and binary variables. To be more specific, a
Boolean function is an algebraic form of Boolean expression. It is also possible to simplify
Boolean functions of digital circuits using Boolean laws and theorems.
The main difference between SOP and POS is that SOP is a way of representing a Boolean
expression using min terms or product terms while POS is a way of representing a Boolean
expression using max terms or sum terms.
With a truth table, we can determine whether or not an argument is valid. Based on the
“truth tables” described above, each truth table shows how unique each gate is. Furthermore, the
different gates work in their own ways. For instance, an AND Gate requires both inputs to be 1 in
order for the circuit to function, hence “AND Gate”. An “OR Gate” works in the opposite way of
an AND Gate. In order for an OR Gate to make the circuit work, it at least needs one of the inputs
to have a 1 value hence “OR Gate”. All it does, is give an output that is opposite to its inputs
making the gate the simplest one to use out of the rest of the gates. AND Gate, OR Gate and NOT
Gate are the basic gates. All the combinational logic gates are made of these three basic gates.
Output from one logic gate can be used as input for another logic gate to form combinational logic
gate. Thus, each gate has their own unique way to make a circuit work.