You are on page 1of 23

Combinational Logic Circuits

Reference: M. Mano, C. Kime, Logic and Computer Design Fundamentals, Chapter 2 Dr. Costas Kyriacou and Dr. Konstantinos Tatas

Basic Logic Gates

Buffer A X=A A X 0 0 1 1 X A B

AND X X=AB A 0 0 1 1 B 0 1 0 1 X 0 0 0 1 A B

OR X X=A+B A 0 0 1 1 B 0 1 0 1 X 0 1 1 1 A B

EX-OR X X=A+B A 0 0 1 1 B 0 1 0 1 X 0 1 1 0

Logic Function Gate Symbol Logic Expression

Truth Table

ACOE161

ACOE161 - Digital Logic for Computers - Frederick University

Basic Logic Gates with Inverted Outputs

NOT A X=A A X 0 1 1 0 X A B

NAND X X=AB A 0 0 1 1 B 0 1 0 1 X 1 1 1 0 A B

NOR X X=A+B A 0 0 1 1 B 0 1 0 1 X 1 0 0 0 A B

EX-NOR X X=A+B A 0 0 1 1 B 0 1 0 1 X 1 0 0 1

ACOE161

ACOE161 - Digital Logic for Computers - Frederick University

Logic Gates with more than two inputs


3-Input AND Gate 4-Input AND Gate 4-Input OR Gate

3-Input OR Gate

ACOE161

ACOE161 - Digital Logic for Computers - Frederick University

Circuit Implementation of a Logic Expression with Gates


Logic Diagram with Gates Logic Function

X = A + BC

A B C

X B BC

Logic Diagram with Gates Logic Function

X = (A + B)C

A B C

A+B B X

ACOE161

ACOE161 - Digital Logic for Computers - Frederick University

Circuit Implementation of Logic Expressions:- Examples


Example 1
Logic Diagram with Gates

Logic Function

X = A(B+C)+BC

Example 2

Logic Diagram with Gates

Logic Function

X = (AB+C)B+C

ACOE161

ACOE161 - Digital Logic for Computers - Frederick University

Circuit Implementation of Logic Expressions:- Homework


Homework 1
Logic Diagram with Gates

Logic Function

X = (AB+C)(B+C)

Homework 2

Logic Diagram with Gates

Logic Function

X = (ABC+C)B+AC

ACOE161

ACOE161 - Digital Logic for Computers - Frederick University

Truth Tables
Truth table of a logic circuit is a table showing all the possible input combinations with the corresponding value of the output. Examples:
(a) Show the truth table of a 3-input circuit that gives at its output a logic 1 if the input forms a number between 3 and 6. Inputs A B C 0 1 2 3 4 5 6 7 0 0 0 0 1 1 1 1 0 0 1 1 0 0 1 1 0 1 0 1 0 1 0 1 Output X 0 0 0 1 1 1 1 0 (b) Show the truth table of the logic expression: X = (AB + C)(A + C)

A 0 0 0 0 1 1 1 1

B 0 0 1 1 0 0 1 1

C 0 1 0 1 0 1 0 1

AB 0 0 0 0 0 0 1 1

C 1 0 1 0 1 0 1 0

AB + C 1 0 1 0 1 0 1 1

A+C 1 0 1 0 1 1 1 1

X = (AB+C)(A+C) 1 0 1 0 1 0 1 1

ACOE161

ACOE161 - Digital Logic for Computers - Frederick University

Truth Tables: Examples


X = (AB + C)(A + C) A 0 0 0 0 1 1 1 1 B 0 0 1 1 0 0 1 1 C 0 1 0 1 0 1 0 1 A 1 1 1 1 0 0 0 0 B 1 1 0 0 1 1 0 0 C 1 0 1 0 1 0 1 0

ACOE161

ACOE161 - Digital Logic for Computers - Frederick University

Minterms and maxterms


Row X Y Z 0 0 0 0 F F(0,0,0) Minterm Maxterm XYZ ++

1
2 3 4

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

F(0,0,1)
F(0,1,0) F(0,1,1) F(1,0,0)

XYZ
XYZ XYZ XYZ

++
++ ++ ++

5
6 7

1 0 1
1 1 0 1 1 1

F(1,0,1)
F(1,1,0) F(1,1,1)

XYZ
XYZ XYZ

++
++ ++

ACOE161

ACOE161 - Digital Logic for Computers - Frederick University

10

Standard forms: Sum of Products


X = ABC + ABC + ABC + ABC A 0 0 0 0 1 1 1 1 B 0 0 1 1 0 0 1 1 C 0 1 0 1 0 1 0 1 A 1 1 1 1 0 0 0 0 B 1 1 0 0 1 1 0 0 C 1 0 1 0 1 0 1 0

ACOE161

ACOE161 - Digital Logic for Computers - Frederick University

11

Logic expression and truth table of a logic circuit


A B T1 = 0 T3 = 1 C 2 T2 = X 3 4 T4 = 5 6 Logic Expression: X = 7 1 1 1 0 1 1 1 0 1 0 1 1 0 1 0 0 0 0 1 1 0 A 0 B 0 C T1 T2 T3 T4 0 X

SoP Form: X =

PoS Form: X =

ACOE161

ACOE161 - Digital Logic for Computers - Frederick University

12

Example: Find the logic expression and fill up the truth table for the circuit below.

A B

T1 = 0 T3 = 1

A 0 0 0 0 1 1 1 1

B 0 0 1 1 0 0 1 1

C 0 1 0 1 0 1 0 1

T1 T2 T3 T4

2 T2 = X 3 4 T4 = 5 6

X= 7

ACOE161

ACOE161 - Digital Logic for Computers - Frederick University

13

Homework: Find the logic expression and fill up the truth table for the circuit below.
A B T1= T3 = C T2 = T4 = X 0 1 2 3 4 5 6 7 D T5 = 8 9 Logic Expression: X = SoP Form: X = 10 11 12 13 PoS Form: X = 14 15 A 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 B 0 0 0 0 1 1 1 1 0 0 0 0 1 1 1 1 C 0 0 1 1 0 0 1 1 0 0 1 1 0 0 1 1 D T1 T2 T3 T4 T5 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 X

ACOE161

ACOE161 - Digital Logic for Computers - Frederick University

14

Analyzing a logic circuit using timing diagrams


T1 = A B C T3 = X 3
Logic 1

T2 = T4 = 0 1 2

A 0 0 0 0 1 1 1 1

B 0 0 1 1 0 0 1 1

C T1 T2 T3 T4 0 1 0 1 0 1 0 1

4 5 6

Logic 0

A B

7 C X

ACOE161

ACOE161 - Digital Logic for Computers - Frederick University

15

Homework: Fill up the truth table and timing diagram for the circuit below.
T1 = A B C T3 = T2 = T4 = X 0 1 T5 = 2 3 A B 6 C X 7 1 1 1 1 0 1 4 5 A 0 0 0 0 1 1 B 0 0 1 1 0 0 C 0 1 0 1 0 1 T1 T2 T3 T4 T5 X

ACOE161

ACOE161 - Digital Logic for Computers - Frederick University

16

Boolean Algebra
Basic Boolean identities:
1. X 0 X 3. X 1 1 5. X X X
7. X X 1
9. X X
2. X 0 0

4. X1 X
6. X X X

8. X X 0
10. X X 12. X+ YZ ( X Y )( X Z)

11. X(Y Z ) XY XZ
13. X+Y X Y
15. X Y XY + XY

14. X Y X Y
16. X Y XY + X Y
18. X+ XY X +Y

17. X+ XY X +Y

ACOE161

ACOE161 - Digital Logic for Computers - Frederick University

17

Boolean Algebra (Examples)


Prove the following identities using Boolean algebra and truth tables:

1. X XY X
3. XY XY X
5. XY XZ + YZ = XY+ XZ

2. X(X+Y) X

4. (X + Y)(X + Y) X
6. (X + Y)(X Z )(Y Z ) ( X + Y)(X Z )

7. AB+AB+AB 1
9. AB AB AB A B

8. XYZ X+Y+ Z
10. AB A B AB AB

ACOE161

ACOE161 - Digital Logic for Computers - Frederick University

18

Digital circuit simplification using Boolean algebra


Logic functions are simplified in order to reduce the number of gates required to implement them. Thus the circuit will cost less, need less space and power, be build faster with less effort. For example the expression F needs six gates to be build. If the expression is simplified then the function can be implemented with only two gates.

F = XYZ + XYZ XYZ YZ(X X) XYZ YZ XYZ Y(Z XZ) F Y(Z X)


X Y Z F X Z Y

F = XYZ + XYZ XYZ


ACOE161

F Y(Z X)
19

ACOE161 - Digital Logic for Computers - Frederick University

Boolean Algebra (Examples)


Simplify the expressions given below. Use truth tables to verify your results.

1. F = XY Z XYZ XZ

2. F = X YZ + XYZ + Y

X Y Z X Y Z 0 0 0 1 1 1 0 0 1 1 1 0 0 1 0 1 0 1 0 1 1 1 0 0 1 0 0 0 1 1 1 0 1 0 1 0 1 1 0 0 0 1 1 1 1 0 0 0

X Y Z X Y Z 0 0 0 1 1 1 0 0 1 1 1 0 0 1 0 1 0 1 0 1 1 1 0 0 1 0 0 0 1 1 1 0 1 0 1 0 1 1 0 0 0 1 1 1 1 0 0 0

ACOE161

ACOE161 - Digital Logic for Computers - Frederick University

20

Boolean Algebra (Examples - Cont.)


Simplify the expressions given below. Use truth tables to verify your results.

3. F = (X + Y + Z)( X Y Z)

4. F = (X + Y + Z)(X + Z)

X Y Z X Y Z 0 0 0 1 1 1 0 0 1 1 1 0 0 1 0 1 0 1 0 1 1 1 0 0 1 0 0 0 1 1 1 0 1 0 1 0 1 1 0 0 0 1 1 1 1 0 0 0

X Y Z X Y Z 0 0 0 1 1 1 0 0 1 1 1 0 0 1 0 1 0 1 0 1 1 1 0 0 1 0 0 0 1 1 1 0 1 0 1 0 1 1 0 0 0 1 1 1 1 0 0 0

ACOE161

ACOE161 - Digital Logic for Computers - Frederick University

21

Boolean Algebra (Examples - Cont.)


Simplify the expression given below. Use truth tables to verify your results.

5. F = XY X YZ + (Y + Z)

X Y Z X Y Z 0 0 0 1 1 1 0 0 1 1 1 0 0 1 0 1 0 1 0 1 1 1 0 0 1 0 0 0 1 1 1 0 1 0 1 0 1 1 0 0 0 1 1 1 1 0 0 0

ACOE161

ACOE161 - Digital Logic for Computers - Frederick University

22

Boolean Algebra (Examples - Cont.)


Simplify the expression given below. Use truth tables to verify your results.

6. F = (X + Y)( X Z )(Y Z )

X Y Z X Y Z 0 0 0 1 1 1 0 0 1 1 1 0 0 1 0 1 0 1 0 1 1 1 0 0 1 0 0 0 1 1 1 0 1 0 1 0 1 1 0 0 0 1 1 1 1 0 0 0

ACOE161

ACOE161 - Digital Logic for Computers - Frederick University

23

You might also like