Presentation is loading. Please wait.

Presentation is loading. Please wait.

ACOE1611 Combinational Logic Circuits Reference: M. Mano, C. Kime, “Logic and Computer Design Fundamentals”, Chapter 2.

Similar presentations


Presentation on theme: "ACOE1611 Combinational Logic Circuits Reference: M. Mano, C. Kime, “Logic and Computer Design Fundamentals”, Chapter 2."— Presentation transcript:

1 ACOE1611 Combinational Logic Circuits Reference: M. Mano, C. Kime, “Logic and Computer Design Fundamentals”, Chapter 2

2 ACOE1612 Basic Logic Gates Truth Table Logic Expression Gate Symbol Logic Function

3 ACOE1613 Basic Logic Gates with Inverted Outputs

4 ACOE1614 Logic Gates with more than two inputs

5 ACOE1615 Circuit Implementation of a Logic Expression with Gates

6 ACOE1616 Circuit Implementation of Logic Expressions:- Examples

7 ACOE1617 Circuit Implementation of Logic Expressions:- Homework

8 ACOE1618 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:

9 ACOE1619 Truth Tables: Examples

10 ACOE16110 Minterms and maxterms

11 ACOE16111 Standard forms: Sum of Products

12 ACOE16112 Logic expression and truth table of a logic circuit

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

14 ACOE16114 Homework: Find the logic expression and fill up the truth table for the circuit below.

15 ACOE16115 Analyzing a logic circuit using timing diagrams Logic 0 Logic 1

16 ACOE16116 Homework: Fill up the truth table and timing diagram for the circuit below.

17 ACOE16117 Boolean Algebra Basic Boolean identities:

18 ACOE16118 Boolean Algebra (Examples) Prove the following identities using Boolean algebra and truth tables:

19 ACOE16119 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.

20 ACOE16120 Boolean Algebra (Examples) Simplify the expressions given below. Use truth tables to verify your results.

21 ACOE16121 Boolean Algebra (Examples - Cont.) Simplify the expressions given below. Use truth tables to verify your results.

22 ACOE16122 Boolean Algebra (Examples - Cont.) Simplify the expression given below. Use truth tables to verify your results.

23 ACOE16123 Boolean Algebra (Examples - Cont.) Simplify the expression given below. Use truth tables to verify your results.

24 ACOE16124 Digital circuit Examples with 1 output


Download ppt "ACOE1611 Combinational Logic Circuits Reference: M. Mano, C. Kime, “Logic and Computer Design Fundamentals”, Chapter 2."

Similar presentations


Ads by Google