Scribd
Upload
22 views19 pages

Boolean Algebra STRM Chapter 2

Uploaded by

krkrwassim7
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
22 views19 pages

Boolean Algebra STRM Chapter 2

Uploaded by

krkrwassim7
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 19

Dr I.

BENATIA MEDJDOUB
1. INTRODUCTION
 George Boole is an English mathematician(1815-1864)

 He has done work whose functions are made up of variables


which can take the values 'YES' or 'NO‘

 This work has been used to study systems that have two
mutually exclusive states:
– The system can only be in two states E1 and E2 such that E1
is the opposite of E2.
– The system cannot be in state E1 and E2 at the same time.

 These works are well suited to the Binary System (0 and 1).
2. TERMINOLOGY
 Sum
s=a+b s = a or b s = a ou b

 Product
s=a*b s = a .b S= ab s = a and b s = a et b

 Complementation
s= a s = not(a) s= non(a)
3. OPERATORS
 Y=a.b
And Gate

Or Gate
 Y= a + b
 Y= a

Not gate
4. COMPOSITE OPERATORS
 NAND

Y= a.b

Nand gate
 NOR

Y= a +b
Nor gate
 XOR (or exclusive)

Y= ab a  b = a .b + a . b

Y=1 if a ≠ b ab = a b + a . b
Y=0 if a = b

Xor gate NXOR gate


5.LOCGIC CIRCUIT

 Definition

It is a set of logic gates linked together corresponding to


an algebraic expression.
 Example: give the logic circuit of the function:
6. Theorems and postulates of
Boolean algebra
 Properties of BA
1. Commutativity
a+b=b+a 4. Neutral elements
a . b= b . A
a+0=a
2. Associativity
a.1=a
a +(b + c) = (a + b) + c
a . (b . c) = (a . b) . C 5. Symmetrical elements

3. Distributivity a + a= 1
a . (b + c) = a. b + a .c
a + (b . c) = (a + b).( a + c)
a. a =0
 Inferred properties (deduced properties)

1. Idempotence
a+a=a
a.a=a

2. Absorbent element
a+1=1
a.0=0

3. Simplified usual expressions


a+a.b=a
Demonstration : a + a . b = a
a . (a + b) = a
a+a.b
a +ab = a + b
a (1+b) [absorbent element a + 1 = 1]
a . 1 [neutral elements a. 1= a ]
a
7. BOOLEAN EXPRESSIONS
 Min term et Max term

✓ We call min term of n variables, one of the products


of these n variables or their complements.
Exemple: a b c , a b c et a b c ,…

✓ We call max term of n variables, one of the sums of


these n variables or their complements.
Exemple: a+ b + c , a+ b + c et a+ b+ c ,…
 First normal form or disjunctive form
it is the sum of min terms (sum of products)

Exemple :

 Second normal form or conjunctive form


it is the product of max terms (product of sums)

Exemple:
 De Morgan's laws

 Complement of a function ( F) : Morgan's law


8. Truth table of function
 For n variables we have 2n combinaisons
 Establish the TT of the function

A B C F
0 0 0 0 0 0 0
0 0 1 0 0 0 0
0 1 0 0 0 0 0
0 1 1 1 0 0 1
1 0 0 0 1 0 1
1 0 1 0 0 0 0
1 1 0 0 0 1 1
1 1 1 0 0 1 1
Disjunctive form Disjunctive form

A B C F
0 0 0 0 0 0 0
0 0 1 0 0 0 0
0 1 0 0 0 0 0
0 1 1 1 0 0 1
1 0 0 0 1 0 1
1 0 1 0 0 0 0
1 1 0 0 0 1 1
1 1 1 0 0 1 1
Conjunctive form
Conjunctive form

A B C F
0 0 0 0 0 0 0
0 0 1 0 0 0 0
0 1 0 0 0 0 0
0 1 1 1 0 0 1
1 0 0 0 1 0 1
1 0 1 0 0 0 0
1 1 0 0 0 1 1
1 1 1 0 0 1 1
 Disjunctive from from the TT( F=1)
A=0 A
A=1 A

 Conjunctive form from the TT(F=0)


A=0 A
A=1 A

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

You might also like