Scribd
Upload
79 views

Digital Circuits

1. The document discusses combinational logic circuits and basic logic gates including AND, OR, NOT, NAND, NOR, and XOR gates. It provides truth tables for each gate. 2. It describes how to implement logic expressions using logic gates, showing examples of logic diagrams for expressions like X = A + BC and X = (A + B)C. 3. The document covers topics like logic functions with more than two inputs, truth tables, minterms and maxterms, standard forms using sum of products, analyzing logic circuits using timing diagrams, and Boolean algebra identities.

Uploaded by

srinu247
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
79 views

Digital Circuits

1. The document discusses combinational logic circuits and basic logic gates including AND, OR, NOT, NAND, NOR, and XOR gates. It provides truth tables for each gate. 2. It describes how to implement logic expressions using logic gates, showing examples of logic diagrams for expressions like X = A + BC and X = (A + B)C. 3. The document covers topics like logic functions with more than two inputs, truth tables, minterms and maxterms, standard forms using sum of products, analyzing logic circuits using timing diagrams, and Boolean algebra identities.

Uploaded by

srinu247
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 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 0 1 X 0 1 X A B

AND X X=A B A B

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

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

Logic Function Gate Symbol Logic Expression Truth Table

A B X 0 0 0 0 1 0 1 0 0 1 1 1

ACOE161

ACOE161 - Digital Logic for Computers 2 - Frederick

Basic Logic Gates with Inverted Outputs

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

NAND X X=A B A B

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

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

A B X 0 0 1 0 1 1 1 0 1 1 1 0

ACOE161

ACOE161 - Digital Logic for Computers 3 - Frederick

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 4 - Frederick

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 5 - Frederick

Circuit Implementation of Logic Expressions:- Examples


Example 1
Logic Function Logic Diagram with Gates

X = A(B+C)+BC

Example 2
Logic Function

Logic Diagram with Gates

X = (AB+C)B+C

ACOE161

ACOE161 - Digital Logic for Computers 6 - Frederick

Circuit Implementation of Logic Expressions:- Homework


Homework 1
Logic Function Logic Diagram with Gates

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

Homework 2
Logic Function

Logic Diagram with Gates

X = (ABC+C)B+AC

ACOE161

ACOE161 - Digital Logic for Computers 7 - Frederick

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 0 1 2 3 4 5 6 7 0 0 0 0 1 1 1 1 0 0 1 1 0 0 1 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)

C 0 1 0 1 0 1 0 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

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 8 - Frederick

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 9 - Frederick

Minterms and maxterms


Row X Y Z 0 1 2 3 4 5 6 7 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 1 F F(0,0,0) F(0,0,1) F(0,1,0) F(0,1,1) F(1,0,0) F(1,0,1) F(1,1,0) F(1,1,1) Minterm Maxterm XYZ XYZ XYZ XYZ XYZ XYZ XYZ XYZ ++ ++ ++ ++ ++ ++ ++ ++

ACOE161

ACOE161 - Digital Logic for Computers 10 - Frederick

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 11 - Frederick

Logic expression and truth table of a logic circuit


A B T1 = T3 = C 0 1 X 2 3 4 5 6 Logic Expression: X = 7 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 X

T2 =

T4 =

SoP Form: X =

PoS Form: X =

ACOE161

ACOE161 - Digital Logic for Computers 12 - Frederick

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

A B

T1 = T3 = 0 1 X 2 3 4 5 6 7

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

T2 =

T4 =

X=

ACOE161

ACOE161 - Digital Logic for Computers 13 - Frederick

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 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 T1 T2 T3 T4 T5 X

ACOE161

ACOE161 - Digital Logic for Computers 14 - Frederick

Analyzing a logic circuit using timing diagrams


T1 = A B C T3 = T2 = T4 = 0 1 X
Logic 1 Logic 0

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 3 4 5 6 7

A B C X

ACOE161

ACOE161 - Digital Logic for Computers 15 - Frederick

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 C X 4 5 6 7 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 T5 X

ACOE161

ACOE161 - Digital Logic for Computers 16 - Frederick

Boolean Algebra
Basic Boolean identities:
1. X + 0 = X 3. X + 1 = 1 5. X + X = X
2. X 0 = 0

4. X 1 = X
6. X X = X

7. X + X = 1

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 = X Y + XY

9. X = X

14. X Y = X + Y
16.
18.

X Y = XY + X Y
X + XY = X + Y

17. X + XY = X + Y

ACOE161

ACOE161 - Digital Logic for Computers 17 - Frederick

Boolean Algebra (Examples)


Prove the following identities using Boolean algebra and truth tables:

1. X + XY = X

2. X(X + Y) = X

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

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 18 - Frederick

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

F = Y(Z + X)

ACOE161

ACOE161 - Digital Logic for Computers 19 - Frederick

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 0 0 0 0 1 1 1 1 0 0 1 1 0 0 1 1

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

Z 1 0 1 0 1 0 1 0

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

Z 0 1 0 1 0 1 0 1

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

Z 1 0 1 0 1 0 1 0

ACOE161

ACOE161 - Digital Logic for Computers 20 - Frederick

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 0 0 0 0 1 1 1 1 0 0 1 1 0 0 1 1

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

Z 1 0 1 0 1 0 1 0

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

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

Z 1 0 1 0 1 0 1 0

ACOE161

ACOE161 - Digital Logic for Computers 21 - Frederick

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 0 0 0 0 1 1 1 1 0 0 1 1 0 0 1 1

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

Z 1 0 1 0 1 0 1 0

ACOE161

ACOE161 - Digital Logic for Computers 22 - Frederick

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 0 0 0 0 1 1 1 1 0 0 1 1 0 0 1 1

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

Z 1 0 1 0 1 0 1 0

ACOE161

ACOE161 - Digital Logic for Computers 23 - Frederick

You might also like