Presentation is loading. Please wait.

Presentation is loading. Please wait.

Lecture 20: Combinatorial Circuits I

Published byRudolf Griffin Modified over 5 years ago

Similar presentations

Presentation on theme: "Lecture 20: Combinatorial Circuits I"— Presentation transcript:

1 Lecture 20: Combinatorial Circuits I
Discrete Mathematical Structures: Theory and Applications

2 Learning Objectives Learn about Boolean expressions
Become aware of the basic properties of Boolean algebra Explore the application of Boolean algebra in the design of electronic circuits Learn the application of Boolean algebra in switching circuits Discrete Mathematical Structures: Theory and Applications

3 Logical Gates and Combinatorial Circuits
Discrete Mathematical Structures: Theory and Applications

4 Logical Gates and Combinatorial Circuits
Discrete Mathematical Structures: Theory and Applications

5 Logical Gates and Combinatorial Circuits
Discrete Mathematical Structures: Theory and Applications

6 Logical Gates and Combinatorial Circuits
In circuitry theory, NOT, AND, and OR gates are the basic gates. Any circuit can be designed using these gates. The circuits designed depend only on the inputs, not on the output. In other words, these circuits have no memory. Also these circuits are called combinatorial circuits. The symbols NOT gate, AND gate, and OR gate are also considered as basic circuit symbols, which are used to build general circuits. The word circuit instead of symbol is also used. Discrete Mathematical Structures: Theory and Applications

7 Logical Gates and Combinatorial Circuits
Discrete Mathematical Structures: Theory and Applications

8 Discrete Mathematical Structures: Theory and Applications

9 Discrete Mathematical Structures: Theory and Applications

10 Discrete Mathematical Structures: Theory and Applications

11 Discrete Mathematical Structures: Theory and Applications

12 Discrete Mathematical Structures: Theory and Applications

13 Discrete Mathematical Structures: Theory and Applications

14 Discrete Mathematical Structures: Theory and Applications

15 Discrete Mathematical Structures: Theory and Applications

16 Discrete Mathematical Structures: Theory and Applications

17 Discrete Mathematical Structures: Theory and Applications

18 Discrete Mathematical Structures: Theory and Applications

19 Discrete Mathematical Structures: Theory and Applications

20 Discrete Mathematical Structures: Theory and Applications

21 Discrete Mathematical Structures: Theory and Applications

22 Discrete Mathematical Structures: Theory and Applications

Download ppt "Lecture 20: Combinatorial Circuits I"

Similar presentations

Discrete Mathematical Structures: Theory and Applications

Discrete Mathematical Structures: Theory and Applications
Logic Gates.

Logic Gates.
Logic Gates.

Logic Gates.
Computer Science 210 Computer Organization Introduction to Logic Circuits.

Computer Science 210 Computer Organization Introduction to Logic Circuits.
Digital Electronics Lecture 2 Logic Gates. Lecture 2 outline Announcement:

Digital Electronics Lecture 2 Logic Gates. Lecture 2 outline Announcement:
UNIT 8 DIGITAL LOGIC. (1) To study and understand Boolean algebra and Boolean properties. (2) To design and analyze Logic gates. (3) To design and analyze.

UNIT 8 DIGITAL LOGIC. (1) To study and understand Boolean algebra and Boolean properties. (2) To design and analyze Logic gates. (3) To design and analyze.
INTRODUCTION LOGICAL OPERATIONS TRUTH TABLE AND RULES.

INTRODUCTION LOGICAL OPERATIONS TRUTH TABLE AND RULES.
Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.

Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.
In this module you will learn: What the various logic gates do. How to represent logic gates on a circuit diagram. The truth tables for the logic gates.

In this module you will learn: What the various logic gates do. How to represent logic gates on a circuit diagram. The truth tables for the logic gates.
Chapter 10.1 and 10.2: Boolean Algebra Based on Slides from Discrete Mathematical Structures: Theory and Applications.

Chapter 10.1 and 10.2: Boolean Algebra Based on Slides from Discrete Mathematical Structures: Theory and Applications.
OCR GCSE Computing © Hodder Education 2013 Slide 1 OCR GCSE Computing Chapter 2: Binary Logic.

OCR GCSE Computing © Hodder Education 2013 Slide 1 OCR GCSE Computing Chapter 2: Binary Logic.
XOR and XNOR Logic Gates. XOR Function Output Y is TRUE if input A OR input B are TRUE Exclusively, else it is FALSE. Logic Symbol  Description  Truth.

XOR and XNOR Logic Gates. XOR Function Output Y is TRUE if input A OR input B are TRUE Exclusively, else it is FALSE. Logic Symbol  Description  Truth.
DISCRETE COMPUTATIONAL STRUCTURES CSE 2353 Summer 2005.

DISCRETE COMPUTATIONAL STRUCTURES CSE 2353 Summer 2005.
Digital Electronics Lecture 4 Simplification using Boolean Algebra, Combinational Logic Circuit Design.

Digital Electronics Lecture 4 Simplification using Boolean Algebra, Combinational Logic Circuit Design.
What is an And Gate? It is a digital circuit that produce logical operations The logical operations are call Boolean logical Boolean operation consist.

What is an And Gate? It is a digital circuit that produce logical operations The logical operations are call Boolean logical Boolean operation consist.
 In studying digital integrated circuits, one must start with the simplest group of circuit, the SSIs or Small Scale Integrated Circuits. Since these.

 In studying digital integrated circuits, one must start with the simplest group of circuit, the SSIs or Small Scale Integrated Circuits. Since these.
DISCRETE COMPUTATIONAL STRUCTURES CS 23022 Fall 2005.

DISCRETE COMPUTATIONAL STRUCTURES CS Fall 2005.
ACOE1611 Combinational Logic Circuits Reference: M. Mano, C. Kime, “Logic and Computer Design Fundamentals”, Chapter 2.

ACOE1611 Combinational Logic Circuits Reference: M. Mano, C. Kime, “Logic and Computer Design Fundamentals”, Chapter 2.
CE1110 :Digital Logic Design lecture 02 Digital Logic Gates Dr. Atef Ali Ibrahim 1.

CE1110 :Digital Logic Design lecture 02 Digital Logic Gates Dr. Atef Ali Ibrahim 1.
Linear Algebra. Circuits The circuits in computers and other input devices have inputs, each of which is either a 0 or 1, the output is also 0s and 1s.

Linear Algebra. Circuits The circuits in computers and other input devices have inputs, each of which is either a 0 or 1, the output is also 0s and 1s.

Similar presentations

Ads by Google