19/04/2012

Boolean Algebra

4/19/2012 Ms S.Sivananthini 1

Logic gates and Truth Table

• Logic gates vd;gJ 1 my;yJ 1 ,w;F
Nkw;gl;l ju;f;f cs;sPLfSf;fhd ju;f;f
ntspaPL xd;iwj; jUtjw;F ju;f;ftpay;
gzpia Nkw;nfhs;Sk; xU cgfuzk;
MFk;.
• ,q;F G+ypad; ju;f;fq;fs; ghtpf;fg;gLk;.

4/19/2012 Ms S.Sivananthini 2

1
19/04/2012

Truth Table
• ju;f;f thapy;fspd; elj;ijfis tpgupf;Fk;
xU tpNrl ml;ltiz MFk;.
• ju;f;f thapy;fSf;F ,Uf;ff;$ba vy;yh
tpjkhd cs;sPl;Lr; Nru;khdq;fs;
mjw;Fupa ntspaPLfspd; gl;bayhf
cz;ik ml;ltiz milahsk;
fhzg;gLk;.

4/19/2012 Ms S.Sivananthini 3

Logical Operations
• %d;W tpjkhd mbg;gil logical
operations cs;sd. mitahtd:
– AND
– OR
– NOT
• AND MdJ dot (·) ,dhy; Fwpf;fg;gLk;.
• OR MdJ plus (+) ,dhy; Fwpf;fg;gLk;.
• NOT MdJ ( ¯ ) or (') or (~) ,dhy;
Fwpf;fg;gLk;.
4/19/2012 Ms S.Sivananthini 4

2
19/04/2012

Operator Definitions

AND OR NOT
0·0=0 0+0=0 0 =1
0·1=0 0+1=1 1 =0
1·0=0 1+0=1
1·1=1 1+1=1

4/19/2012 Ms S.Sivananthini 5

Truth Tables
AND OR NOT
X Y Z = X·Y X Y Z = X+Y X Z =X
0 0 0 0 0 0 0 1
0 1 0 0 1 1 1 0
1 0 0 1 0 1
1 1 1 1 1 1

4/19/2012 Ms S.Sivananthini 6

3
19/04/2012

Logic Gate Symbols and Behavior

• ju;f;f thapy;fs; xt;nthd;wpw;Fk; tpNrl FwpaPLfs; cs;sd:
X X
Z = X ·Y Z=X1 Y X Z= X
Y Y
AND gate OR gate NOT gate or
(a) Graphic symbols inverter

X 0 0 1 1

Y 0 1 0 1

(AND) X ·Y 0 0 0 1

(OR) X1 Y 0 1 1 1

(NOT) X 1 1 0 0
4/19/2012 (b)Ms S.Sivananthini
Timing diagram 7

Logic Gates

• X, Y Mfpa ,uz;bdJk; ju;ff; cs;sPL NtWgl;ljhf

,Uf;Fk; NghJ khj;jpuk; ntspaPL cz;ikahFk;.
• Rkdhd ,U cs;sPLfs; fpilf;Fk; NghJ ntspaPL
cz;ikaw;wjhf ,Uf;Fk;.

Note the special symbol 

for the XOR operation.
4/19/2012 Ms S.Sivananthini 8

4
19/04/2012

Logic Gates

4/19/2012 Ms S.Sivananthini 9

Logic Diagrams and Expressions

Logic Diagram Equation
X

F
F =X +Y Z
Y

Z Truth Table
XYZ F = X + Y Z
000 0
001 1
010 0
011 0
100 1
101 1
110 1
111 1
4/19/2012 Ms S.Sivananthini 10

5
19/04/2012

Boolean Algebra

1. X +0 = X 2. X .1 = X
3. X +1 = 1 4. X .0 = 0
5. X+X = X 6. X .X = X
7. X+X = 1 8. X .X = 0
9. X=X
10. X+Y =Y+X 11. XY = YX Commutative
12. (X + Y) + Z = X + (Y + Z) 13. (XY) Z = X(Y Z) Associative
14. X(Y + Z) = XY + XZ 15. X + YZ = (X + Y) (X + Z) Distributive
16. X+Y =X .Y 17. X .Y = X+Y DeMorgan ’s

4/19/2012 Ms S.Sivananthini 11

Simplify of the following Boolean

expression
AB C +AB C

A +A.C

A +B C

( A +B ).B

4/19/2012 Ms S.Sivananthini 12

6
19/04/2012

Minterms
• Minterms are AND terms with every variable
present in either true or complemented form.
• Given that each binary variable may appear
normal (e.g., x) or complemented (e.g., x ), there
are 2n minterms for n variables.
• Example: Two variables (X and Y)produce
2 x 2 = 4 combinations:
(both normal)
XY (X normal, Y complemented)
X Y (X complemented, Y normal)
X Y (both complemented)
XY
• Thus there are four minterms of two variables.
4/19/2012 Ms S.Sivananthini 13

Maxterms
• Maxterms are OR terms with every variable in true
or complemented form.
• Given that each binary variable may appear normal
(e.g., x) or complemented (e.g., x), there are 2n
maxterms for n variables.
• Example: Two variables (X and Y) produce
2 x 2 = 4 combinations:
X +Y (both normal)
X +Y (x normal, y complemented)
(x complemented, y normal)
X +Y
(both complemented)
X +Y
4/19/2012 Ms S.Sivananthini 14

7
19/04/2012

Minterm and Maxterm Relationship

• Review: DeMorgan's Theorem
and
• Two-variable example:
and x · y =x +y x +y =x 
y
Thus M2 is the complement of m2
and vice-versa.
• Since DeMorgan's Theorem holds M 2 =x +y m 2 =x· y
for n variables, the above holds for
terms of n variables

M i =m i m i =M i
• giving:

and
Thus Mi is the complement of mi.

4/19/2012 Ms S.Sivananthini 15

Standard Forms of Boolean Expressions

–The sum-of-products (SOP) form

–The product-of-sums (POS) form

4/19/2012 Ms S.Sivananthini 16

8
19/04/2012

Sum-of-Products (SOP)

4/19/2012 Ms S.Sivananthini 17

The Sum-of-Products (SOP) Form

• An SOP expression   In an SOP form, a
when two or more single overbar cannot
product terms are extend over more than
summed by Boolean one variable; however,
addition. more than one variable
– Examples: in a term can have an
AB +ABC overbar:
ABC +CDE +B CD  example: A B C is OK!
A B +A BC +AC
– Also:  But not: ABC
A +A B C +BCD
4/19/2012 Ms S.Sivananthini 18

9
19/04/2012

General Expression  SOP

ex:

A( B +CD) =AB +ACD

AB +B(CD +EF ) =AB +BCD +BEF
( A +B)( B +C +D) =AB +AC +AD +BB +BC +BD
( A +B) +C =( A +B)C =( A +B)C =AC +BC

4/19/2012 Ms S.Sivananthini 19

The Standard SOP Form

• A standard SOP expression is one in which all the
variables in the domain appear in each product
term in the expression.
– Example:
AB CD +A B CD +ABC D
• Standard SOP expressions are important in:
– Constructing truth tables
– The Karnaugh map simplification method

4/19/2012 Ms S.Sivananthini 20

10
19/04/2012

Converting Product Terms to Standard SOP

(example)
• Convert the following Boolean expression into
standard SOP form:
AB C +A B +ABC D

AB C =AB C ( D +D ) =AB CD +AB CD

A B =A B (C +C ) =A B C +A B C
A B C ( D +D ) +A B C ( D +D ) =A B CD +A B CD +A B C D +A B C D

AB C +A B +ABC D =AB CD +AB CD +A B CD +A B CD +A B C D +A B C D +ABC D

8
4/19/2012 Ms S.Sivananthini 21

Exercise
Convert the following Boolean expression into
standard SOP form:
F ( A, B, C ) =A +B C

F ( A, B, C, D) =AB C +B CD +AC D

4/19/2012 Ms S.Sivananthini 22

11
19/04/2012

Binary Representation of a Standard

Product Term
• A standard product term is equal to 1 for only one
combination of variable values.
– Example: AB CD is equal to 1 when A=1, B=0, C=1, and
D=0 as shown below
AB CD =10  10 =1 1 11 =1
– And this term is 0 for all other combinations of values
for the variables.

4/19/2012 Ms S.Sivananthini 23

Product-of-Sums (POS)

4/19/2012 Ms S.Sivananthini 24

12
19/04/2012

The Product-of-Sums (POS) Form

• When two or more  In a POS form, a single
sum terms are overbar cannot extend
multiplied, the result over more than one
expression is a product- variable; however, more
of-sums (POS): than one variable in a
– Examples: term can have an
( A +B)( A +B +C ) overbar:
( A +B +C )(C +D +E )( B +C +D)
 example: A +B +C is OK!
( A +B)( A +B +C )( A +C )

– Also:  But not: A +B +C

A ( A +B +C )( B +C +D )
4/19/2012 Ms S.Sivananthini 25

The Standard POS Form

• A standard POS expression is one in which all the
variables in the domain appear in each sum term in
the expression.
– Example: ( A +B +C +D )( A +B +C +D)( A +B +C +D)

• Standard POS expressions are important in:

– Constructing truth tables
– The Karnaugh map simplification method

4/19/2012 Ms S.Sivananthini 26

13
19/04/2012

Converting a Sum Term to Standard POS

(example)
• Convert the following Boolean expression into
standard POS form:
( A +B +C )( B +C +D )( A +B +C +D)

A +B +C =A +B +C +DD =( A +B +C +D)( A +B +C +D )

B +C +D =B +C +D +AA =( A +B +C +D )( A +B +C +D )

( A +B +C )( B +C +D )( A +B +C +D) =
( A +B +C +D)( A +B +C +D )( A +B +C +D )( A +B +C +D )( A +B +C +D)

4/19/2012 Ms S.Sivananthini 27

Exercise
Convert the following Boolean expression into
standard POS form:
F ( X , Y , Z ) =( X +Y ).( X +Z )

4/19/2012 Ms S.Sivananthini 28

14
19/04/2012

Binary Representation of a Standard Sum

Term
• A standard sum term is equal to 0 for only one
combination of variable values.
– Example:A +B +C +D is equal to 0 when A=0, B=1, C=0,
and D=1 as shown below
A +B +C +D =0 +1 +0 +1 =0 +0 +0 +0 =0
– And this term is 1 for all other combinations of values
for the variables.

4/19/2012 Ms S.Sivananthini 29

SOP/POS

4/19/2012 Ms S.Sivananthini 30

15
19/04/2012

Converting Standard SOP to Standard POS

(example)
• Convert the SOP expression to an equivalent POS
expression:
A B C +A BC +A BC +AB C +ABC
– The evaluation is as follows:
000 +010 +011 +101 +111
– There are 8 possible combinations. The SOP expression
contains five of these, so the POS must contain the other
3 which are: 001, 100, and 110.
( A +B +C )( A +B +C )( A +B +C )

4/19/2012 Ms S.Sivananthini 31

Karnaugh Maps (K-map)

• K-map MdJ nka;epiy ml;ltizia xj;jJ. Vnddpy;
,J rfy tpjkhd cs;sPl;Lg; ngWkhdq;fspd;
Nru;f;iffisf; nfhz;bUf;Fk;.
• ,J epuy;> epiu fisf; nfhz;l xU ml;ltizahFk;.
• K-map MdJ xU tupirr; rJuq;fisf; nfhz;bUg;gJld;
xt;nthU rJuKk; xU Jtpj vz; ngWkhdj;ijf;
nfhz;lit MFk;.
• cs;sPl;L khwpfspd; vz;zpf;if n Mf cs;sNghJ K-
map ,y; fhzg;gLk; rJuq;fspd; vz;zpf;ifahdJ; 2n
MFk;.

4/19/2012 Ms S.Sivananthini 32

16
19/04/2012

Two Variable Maps

y=0 y=1

m0 = m1 =
x=0
x y x y

x = 1 m2 = mx3 y=
x y

4/19/2012 Ms S.Sivananthini 33

Three Variable Maps

C C

A B

A B

A B

A B

4/19/2012 Ms S.Sivananthini 34

17
19/04/2012

Four Variable Maps

C D C D C D C D

A B

A B

A B

A B

4/19/2012 Ms S.Sivananthini 35

G+ypad; Nfhitfis k-map ,idg;

gad;gLj;jp RUf;FNthk;
• jug;gl;l Nfhitfis ,aYkhd msT
RUf;fg;gl Ntz;Lk;.
• mjid standard SOP ,w;F khw;wpa gpd;du; k-
map ,y; Fwpf;fg;gl Ntz;Lk;.
• SOP Nfhitfis Mff; Fiwe;j msTfspy;
Ruf;Ftjw;F 3 gbKiwfs; cs;sd.
– Grouping ones
– Determining the product term for each group
– Summing the resulting product term
4/19/2012 Ms S.Sivananthini 36

18
19/04/2012

The mapping a standard SOP

expression on the K-map

F ( A, B, C ) =A B C +A BC +AB C +AB C

C C

A B 1

1
A B

A B

A B 1 1
4/19/2012 Ms S.Sivananthini 37

Three-Variable Map Simplification

F ( A, B, C ) =A B C +A BC +AB C +AB C

C C

A B 1

1
A C +AB
A B

A B

A B 1 1

4/19/2012 Ms S.Sivananthini 38

19
19/04/2012

Exercise
F ( A, B, C ) =AB C +AB C +ABC +A BC +A BC +A B C

F ( X , Y , Z ) =XYZ +XYZ +XYZ +XYZ

4/19/2012 Ms S.Sivananthini 39

Three-Variable Map Simplification

• Use a K-map to find an optimum SOP

equation for
F(X, Y, Z) =m(0,1,2,4,6,7)

4/19/2012 Ms S.Sivananthini 40

20
19/04/2012

Four-Variable Map Simplification

F(W, X, Y, Z) =m(0, 2,4,5,6,7,8,10,13,15)
•

4/19/2012 Ms S.Sivananthini 41

Four-Variable Map Simplification

F(W, X, Y, Z) =m(3,4,5,7,9,13,14,15)
•

4/19/2012 Ms S.Sivananthini 42

21
19/04/2012

2011 August

4/19/2012 Ms S.Sivananthini 43

4/19/2012 Ms S.Sivananthini 44

22
19/04/2012

Model Paper
1. jug;gl;Ls;s nka;epiy ml;ltizapd; tUtpistpw;Fupa jUf;ff;
$w;W A B output
(1) A+B MFk; (2) A . B MFk; 0 0 1
(3) A+B MFk; (4) A+B MFk; 0 1 0
(5) A+B MFk;
1 0 0
1 1 1

2. B.C(A+B.A) vd;Dk; G+ypad; Nfhitiar; RUf;Fk;NghJ fpilf;Fk;

tpil ahJ?
(1); A.B.C (2) A.B.C (3) A.B.C
(4); A.B .C (5); C. A +B.C. A

4/19/2012 Ms S.Sivananthini 45

Model Paper

1. (a) gpd;tUk; G+ypad; Njw;wj;ij nka;epiy ml;ltizfisf; nfhz;L

tha;g;Gg; ghu;f;f.
A.( B +C ) =A.B +A.C
(b) xU jUf;fr; Rw;wpd; tupg;glk; fPNo fhzg;gLfpd;wJ. mjidf; nfhz;L
(i)> (ii)> (iii) vd;Dk; gFjpfSf;F tpil jUf.
B
A
F
C

(i)jug;gl;Ls;s jUf;f Rw;wpy; tUtpisT F ,w;fhd G+ypad; Nfhitia cs;sPL

A,B,C Mfpatw;iwf; nfhz;L vOJf?
(ii) jUf;fr; Rw;wpy; tUtpisT F vdpd;> F ,w;Ff; fpilf;Fk; G+ypad; Nfhitiag;
SOP ,d; epak tbtj;jpw;F khw;Wf.
(iii) NkNy (ii) sop ,Ys;s epak tbtf; Nfhitia POS ,w;F khw;Wf.

4/19/2012 Ms S.Sivananthini 46

23
19/04/2012

Model Paper

(c)gpd;tUk; g+ypad; Nfhitiaf; Karnaugh Map Ig; gad;gLj;jpr;

RUf;Ff.

F ( A, B, C , D) =A BCD +A BCD +AB CD +AB CD +A B CD +AB C D

+AB C D +A B C D +A B C D

4/19/2012 Ms S.Sivananthini 47

khfhzf; fy;tpj; jpizf;fsk;> tlkhfhzk;

4/19/2012 Ms S.Sivananthini 48

24
19/04/2012

khfhzf; fy;tpj; jpizf;fsk;> tlkhfhzk;

4/19/2012 Ms S.Sivananthini 49

25