Topic 10: Application of 2-valued Boolean algebra for design

and analysis of logic circuits.

Logic circuits are structures that are built from elementary circuits called logic
gates. Logic gates implement logic functions.

Example: Function OR and OR gate.

x y x˅y function
0 0 0
0 1 1
1 0 1
1 1 1
symbol of OR gate

x z=x˅y
OR
y

logic values

x=0

States of a switches
y=0 determine the values of x,

∩ y and z
Lamp z = 0
Electronic circuit:

3,5 v =1 logic

x 3,5v=1 logic Voltage levels represent

OR
logic values 0 and 1
y
 0,5 v = 0 logic

x
AND
y z=x ∧ y

x y x˄y
0 0 0
0 1 0
1 0 0
1 1 1

x=0
y=1

Lamp z = 0 ( no light )

z=x
x

x x

0 1

1 0
A Boolean function f(x,y,z)= (x  y  z )  (x  y  z )
can be implemented by a logic circuit so:

x
AND OR
y f(x,y,z)
AND
z

AND
OR

The above logic circuit is not the best for this function:

- It contains too many gates (9);

- There are 5 gates connected sequentially (too many delays for a signal propagation
from input to output)

We simplify the formula into SPF: (x  y  z )  ( x  y  z) =

(x ∧ y ∨ z¿)∨( x ∨ y ∧¿ z )=¿ ¿ ¿ (( x ∧ y )∧ z ¿ ∨ ( x ∧ ( y ∧ z ) ) =( x ¿∧ z )∨ ( y ∧ z ) ∨ ( x ∧ y ) ∨ ¿ ¿

x AND

z
AND

OR f(x,y,z)

Now the circuit contains:

AND
- 8 gates (cheaper).

-at most 3gates connected

AND
sequentially (faster)
There are different methods to simplify formulas into a SPF (Sum-of-Products
Form) or PSF(Product-of-Sums Form)with the minimum number of variables.

One of them is based on Karnaugh maps.

Definition: AKarnaugh map is the truth table of a Boolean function presented as a

matrix. The sets of variable values follow in a circular order.

Given a function f5(x,y)

y 0 1
x y f5(x,y) circular order:
x 1 each set differs
0 0 1 Karnaugh 0 from its previous
0 1 0 0
in one position
1 0 1 1
1 0
1 1 0 map
f5(x,y) = y 0= y

2 neighboring cells are united in one rectangle

i

(i = 0,1,2,…)

Given a function f(x,y,z).

yz
x y z f(x,y,z)
Karnaugh 00 01 11 10
0 0 0 1 x
0 0 1 0 0 1 0 1 1
0 1 0 1 map
1
1 0 1 1
0 1 1 1
1 0 0 1 2
2 neighboring cells
1 0 1 0 z y are united in one
rectangle
1 1 0 1

1 1 1 1 f(x,y,z)= y ∨ z
Note: we unite 2ineighboring cells with unities into a common rectangle of the largest
possible size.

Note: coordinates of two neighboringsells differ in one position

Given function f"(x,y,z,t) t ∨x y

X Y Z T f''(x,y,z,t)
0 0 0 0 1
0 0 0 1 0
0 0 1 0 1 zt 00 01 11 10
0 0 1 1 0
0 1 0 0 1 1 0 0 1
0 1 0 1 0
0 1 1 0 1 The rulexy
0 1 1 1 0 for writing
00 1 0 0 1
1 0 0 0 1 a
1 0 0 1 1 conjunctive 1 0 0 1
1 0 1 0 1 term that
1 0 1 1 1 represents
1 1 0 0 1 1 1 1 1
2 cells with
i
1 1 0 1 0
1 1 1 0 1 1s in a
1 1 1 1 0 common rectangle on a Karnaugh map.

1.Move along the sides of the rectangle.

2. A variable that changes its value while moving along one side is not included into
the conjunctive term.

3. A variable (say, x) that keeps its value 1 unchangeable is included in the term
without negation ( as x).

4. A variable (x) that keeps its value 0 unchangeable is included in the term with
negation (as x ).

H/a. Simplify the above given functions f5 (x,y), f(x,y,z), f''(x,y,z,t) by transforming
them into CSPF and applying the laws of Boolean algebra.
H/a. Think how to write a simplified formula base on zeroes in a Karnaugh map.
Example of finding of a minimum product of sums ( Minimum conjunctive normal
form)


zt 00 01 11 10 
xy
10
00 0
1 1 0

01 1 0 0 1

11 0 1
1 0

0
10 0 1 1




β=x ∨t ; α = y ∨t

f ( x , y , z , t)=( y ∨t) ∧(x ∨t)

MCNF

H/a.Given a Karnaugh map.

- Find Min DNF and make a diagram of a logic circuit

- Find Min CNF and make a diagram of a logic circuit

Note: each gate and OR should have only 2 inputs.

0 0 0 0
0 0 1 1
1 1 1 1 F(x,y,z,t)
0 1 1 0