Académique Documents
Professionnel Documents
Culture Documents
Combinational
1
Sequential
ENEL 111
Aims
1
Example Summary
A B C P
0 0 0 0
Truth Table 0 0 1 0 Inputs and Outputs are expressed in Binary Form
1 1 0 1
lights A
door B P buzzer
Implementation as a
circuit using logic gates keys C
0 0
Sum of products 1 1
Boolean algebra
A P
Not P=A
0 1 A P
1 0
2
Basic AND / OR Basic NAND / NOR
Circuits with two Inputs Problems with two Inputs
A B P
A B P
0 0 0
A 0 0 1 A
AND P = A.B 0 1 0 P
NAND P = A.B 0 1 1 P
1 0 0 B 1 0 1
B
1 1 1
1 1 0
A B P
A B P 0 0 1
0 0 0 A 0 1 0
A
OR P=A+B P NOR P=A+B P
B
0 1 1 B 1 0 0
1 0 1 1 1 0
1 1 1
Circuits with two Inputs: All circuits can actually be made using AND, OR
and NOT gates if required.
A B P
XOR P=A⊕B 0 0 0
0 1 1
A
1 0 1 P
B
1 1 0
A B P
XNOR P = A ⊕ B
0 0 1 A
0 1 0 P
B
1 0 0 In terms of components used, it is generally easier to build inverting functions.
1 1 1 They typically require less transistors and also work faster than their non-
inverting cousins.
3
Exercise Not Symbol
1 1 1 1 0 0
are different.
4
Very simple! Slightly more complex
A.B.C
1 1 1 0
A.B.C + A.B.C + A.B.C
as the following truth table shows: A.B.C + A.B.C + A.B.C = A.C + B.C = (A + B).C
5
Means fewer logic gates are required Minterms and Maxterms
A+B +C 1 1 1 0
6
Exercise Summary
7
Boolean Algebraic Laws Basic rules of Boolean Algebra
A . A = A
Tautology (Idempotent)
Complementary
A . A = 0 P = A. ( B + C ) + A (C + B )
A + A = 1
= A
Operating with logic 0 A . 0 = 0 A . 1 = A
and logic 1 A + 0 = A A + 1 = 1 A.B + A.C+ A.C + A.B distributive
A . B = B . A
Commutative A.(B + B) + A.(C + C) re-distribute
A + B = B + A
A.1 + A.1 complementary
Associative (A.B).C = A.B.C = A.(B.C)
A+A op with logic 1
A.(B + C) = A.B + A.C
Distributive A idempotent
A + (B.C) = (A + B).(A + C)
Exercises