Digital Electronics Lecture 2 Logic Gates. Lecture 2 outline Announcement:

Slides:



Advertisements
Similar presentations
Chapter 4 Gates and Circuits.
Advertisements

Switching circuits Composed of switching elements called “gates” that implement logical blocks or switching expressions Positive logic convention (active.
ENGIN112 L7: More Logic Functions September 17, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 7 More Logic Functions: NAND, NOR,
Logic Gates.
Chapter 3 Logic Gates and Boolean Algebra – Part 1
Logic Gates.
CT455: Computer Organization Logic gate
Computer Science 210 Computer Organization Introduction to Logic Circuits.
Programmable Logic Controllers.
L14: Boolean Logic and Basic Gates
Chapter 3 (part 1) Basic Logic Gates 1.
Lecture 6 More Logic Functions: NAND, NOR, XOR and XNOR
Exclusive-OR and Exclusive-NOR Gates
(CSC 102) Discrete Structures Lecture 5.
CS105 Introduction to Computer Concepts GATES and CIRCUITS
Chapter3: Gate-Level Minimization Part 2
Chapter 4 Gates and Circuits.
CSIS 3510 Computer Organization and Architecture Topics covered in this lecture: –Review of De’Morgan’s Theorem –Using De’Morgan’s Theorem –Building a.
Boolean Algebra and Logic Gate
Digital Electronics Dan Simon Cleveland State University ESC 120 Revised December 30, 2010.
1 Boolean Algebra & Logic Design. 2 Developed by George Boole in the 1850s Mathematical theory of logic. Shannon was the first to use Boolean Algebra.
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.
Logic gates & Boolean Algebra. Introduction Certain components (called logic elements) of the computer combine electric pulses using a set of rules. Electric.
DeMorgan Theorem, Computer Simulation Exercises
Digital Electronics Lecture 4 Simplification using Boolean Algebra, Combinational Logic Circuit Design.
 In studying digital integrated circuits, one must start with the simplest group of circuit, the SSIs or Small Scale Integrated Circuits. Since these.
Logic Gates Shashidhara H S Dept. of ISE MSRIT. Basic Logic Design and Boolean Algebra GATES = basic digital building blocks which correspond to and perform.
Lecture 22: 11/19/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.
Week 6: Gates and Circuits: PART I READING: Chapter 4.
Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.
1 EG 32 Digital Electronics Thought for the day You learn from your mistakes..... So make as many as you can and you will eventually know everything.
Lecture 4 Introduction to Boolean Algebra. Binary Operators In the following descriptions, we will let A and B be Boolean variables and define a set of.
5 - Digital Logic with Boolean Algebra
Chapter-3: BOOLEAN ALGEBRA & LOGIC GATES Analysis and logical design.
DIGITAL ELECTRONICS. Everything in digital world is based on binary system. Numerically it involves only two symbols 0 or 1. –0 = False = No –1 = True.
Logic Gates and Boolean Algebra Introduction to Logic II.
Circuit Synthesis A logic function can be represented in several different forms:  Truth table representation  Boolean equation  Circuit schematic 
Hoda Roodaki Boolean Algebra Hoda Roodaki
Logic gates.
Dr.Ahmed Bayoumi Dr.Shady Elmashad
Logic Gates and Boolean Algebra
Digital Technology.
Logic Gates and Boolean Algebra
Digital Systems, Principles and Applications, 10th Edition
CHAPTER 2 Boolean Algebra
ECE 331 – Digital System Design
Logic Gates.
Logic Gates Benchmark Companies Inc PO Box Aurora CO
KS4 Electricity – Electronic systems
KS4 Electricity – Electronic systems
Digital Signals Digital Signals have two basic states:
Computer Science 210 Computer Organization
Jeremy R. Johnson Anatole D. Ruslanov William M. Mongan
Boolean Algebra & Logic Circuits
Logic Gates.
Boolean Algebra.
Logic Gates.
Logic Gates.
KS4 Electricity – Electronic systems
GCSE Computer Science – Logic Gates & Boolean Expressions
Logic Gates.
Chapter 2 Gates.
Truth tables Mrs. Palmer.
Department of Electronics
Digital Logic Design Basics Combinational Circuits Sequential Circuits.
Boolean Algebra and Gate Networks
What are Logic Gates?.
DIGITAL ELECTRONICS AND LOGIC GATES. ANALOG SIGNAL:- Analog signal is continuous time varying current or voltage signal.
Agenda Lecture Content: Combinatorial Circuits Boolean Algebras
Presentation transcript:

Digital Electronics Lecture 2 Logic Gates

Lecture 2 outline Announcement: Review of last Lecture Logic Gates AND, OR, NOT, EX-OR, NAND, NOR Truth Tables Boolean equations

Introduction to electronics Digital Electronics use many exciting applications Introduction to digital electronics Number systems: Decimal, binary and hex Converting from one number system into another Review of Last Lecture

The AND gate The logical function of this gate may be expressed in words as follows: Y = A.B The Output, Y, of this gate is True only if all inputs to the gate are TRUE

IC, AND gate

The OR gate The logical function of this gate may be expressed in words as follows: Y = A+B+C The Output, Y, of this gate is True if any of the inputs to the gate are TRUE

Overview of Electronics The logical function of this gate may be expressed in words as follows: B=A _ The Output, A, of this gate is True the input signal B is False

NAND, NOR

EX-OR gate The logical function of this gate may be expressed in words as follows: Y = A. B _ + A _.B

INTEGRATED CIRCUIT (IC) LOGIC GATES 7408 AND gate 7432 OR gate 7404 NOT gate or Inverter 7400 NAND gate 7402 NOR gate 7486 XOR gate

Turning equations into circuits It is always possible to produce a logic circuit which corresponds to a particular boolean expression, although it may contain many gates if the expression is a large, complicated one

Circuit diagram

BOOLEAN ALGEBRA The mathematical system of binary logic is called Boolean algebra or switching algebra. Boolean Theorems A- Single variable Theorems 1- A. 0 = 0 2- A. 1 = A 3- A. A = A 4- A. A _ = 0 5- A + 0 = A 6- A + 1 = 1 7- A + A = A 8- A + A _ =1

BOOLEAN ALGEBRA (cont.) B- Multi Variable Theorems 9- A + B = B + A Commutative Laws 10- A. B = B. A 11- A + (B + C) = (A + B) +C Associative Laws 12- A. (B. C) = (A. B).C 13- A. (B + C) = A. B + A. C Theorems 9 to 13 are similar to ordinary algebra. 14- A + AB = A A.(1 + B) = A.1 = A 15- A + A _ B = A + B Equations 14 and 15 can be proved by truth table

Main Points Logic gates AND, OR, NOT, Ex-OR, NAND, NOR Truth Tables Boolean Algebra

The End Thank you for your attention.