Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y

Slides:



Advertisements
Similar presentations
Logic Gates.
Advertisements

Logic Gates.
Digital Electronics Dan Simon Cleveland State University ESC 120 Revised December 30, 2010.
SYEN 3330 Digital SystemsJung H. Kim Chapter SYEN 3330 Digital Systems Chapter 2 – Part 1.
1 EECC341 - Shaaban #1 Lec # 6 Winter Combinational Circuit Analysis Example Given this logic circuit we can : Find corresponding logic.
Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F F = x + y’z x y z F Truth Table Boolean Function.
Floyd Digital Fundamentals, 9/e Copyright ©2006 by Pearson Education, Inc. Upper Saddle River, New Jersey All rights reserved. Slide 1 Digital Fundamentals.
MR. KERINS Logic Gates- Electrical Engineering. LOGIC GATES Logic gates are primarily implemented using diodes or transistors acting as electronic switches,
Circuit, State Diagram, State Table
NOCTI Review Lesson 4 Objectives:
LOGIC GATES & TRUTH TABLE – Digital Circuit 1 Choopan Rattanapoka.
Digital Systems I EEC 180A Lecture 4 Bevan M. Baas.
Lecture 22: 11/19/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.
Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.
Basic logic gates  AND gate:The truth table is given by A.BBA
Gates and Logic Dr John Cowell phones off (please)
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.
Logic Gates. The Inverter The inverter (NOT circuit) performs the operation called inversion or complementation. Standard logic symbols: 1 1 input output.
1 Understand the examples again Overflow –When two positive numbers added together or a negative number subtracted from a positive number yields negative.
Combinational Logic Digital Design Department of Software Development Faculty of Information Technology Islamic University of Gaza Dr. Rebhi Baraka
CHAPTER 1 SETS, FUNCTIONs, ELEMENTARY LOGIC & BOOLEAN ALGEBRAs
Karnaugh Maps (K-Maps)
CHAPTER 5 Combinational Logic Analysis
CO5023 Building Circuits from Truth Tables. Build the following… Let’s say we want a circuit which acts as described by the following truth table: We.
The inverter performs the Boolean NOT operation. When the input is LOW, the output is HIGH; when the input is HIGH, the output is LOW. The Inverter AX.
Chapter 5 Boolean Algebra and Reduction Techniques 1.
Combinational Logic Analysis. Basic Combinational Logic Circuits AND-OR logic AND-OR logic AND-OR logic produces an SOP expression. AND-OR logic produces.
Digital logic representation In digital logic system,events are described as either 0 or 1 Two logic states 1= logic High 0 = logic Low.
Chapter 33 Basic Logic Gates. Objectives After completing this chapter, you will be able to: –Identify and explain the function of the basic logic gates.
Dr. Nermin Hamza. x · y = y · x x + y = y + x x · (y · z) = (x · y) · z x + (y + z) = (x + y) + z x · (y + z) = (x · y) + (x · z) x + (y · z) = (x + y)
Logic Gates and Boolean Algebra Introduction to Logic II.
ACOE161Digital Circuit Design1 Design Of Combinational Logic Circuits.
Logic Gates Digital Logic Design. What is a logic gate? A switch with an output that will only turn on when inputs are in particular positions.
Chapter 3 Digital circuits. 3.1 Logic signals - Gates Binary system : (binary bits or digits) - 0 & 1 - LOW & HIGH - Negated and Asserted.
Eng. Mai Z. Alyazji October, 2016
De Morgan’s Theorem,.
Logic Gates.
Logic Gates Benchmark Companies Inc PO Box Aurora CO
EI205 Lecture 5 Dianguang Ma Fall 2008.
Exclusive OR Gate.
Boolean Algebra.
Boolean Expressions Lecture No. 10.
KS4 Electricity – Electronic systems
KS4 Electricity – Electronic systems
Digital Signals Digital Signals have two basic states:
Basic Digital Logic Basic Gates
ECE 331 – Digital System Design
Karnaugh Maps (K-Maps)
Computer Science 210 Computer Organization
Jeremy R. Johnson Anatole D. Ruslanov William M. Mongan
Schematics 201 Lecture Topic: Electrical Symbols
Waveforms & Timing Diagrams
Logic Gates.
JC Technology Logic Gates.
Logic Gates.
Boolean Algebra.
KS4 Electricity – Electronic systems
13 Digital Logic Circuits.
ECB2212-Digital Electronics K-Map
GCSE Computer Science – Logic Gates & Boolean Expressions
DIGITAL ELECTRONICS B.SC FY
Logic Gates.
Truth tables Mrs. Palmer.
Analysis of Logic Circuits Example 1
Analysis of Logic Circuits Example 1
Department of Electronics
Digital Logic Design Basics Combinational Circuits Sequential Circuits.
Basic Logic Operations
Eng. Ahmed M Bader El-Din October, 2018
SYEN 3330 Digital Systems Chapter 2 – Part 1 SYEN 3330 Digital Systems.
Presentation transcript:

Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y NAND denoted by X.Y NOT denoted by X’ or X Y X Y X Y X Y

Truth Tables for Gates

Example logic circuits A function of four variables F = (A+B).(C+D) A B C D

Deriving Truth Table Derive a truth table with two input X and Y Output is F F = 1 if and only if X = Y

Another Truth Table Derive a truth table with three input X, Y, and Z Output is F F = 1 if and only if there is 0 to the left of a 1 in the input

A Function with four variables (Truth Table) Four input X, Y, Z, and W Output is F F = 1 if and only if number of variables with value 1 is more than the number of variables with value 0

Product terms or Min terms Each row in a truth table represents a unique combination of variables Each row can be expressed as a logic combination specifying when that row combination is equal to a 1 The term is called a PRODUCT TERM or a MIN TERM Example

Product terms for more variables

Deriving function from truth table Derive a truth table with two input X and Y Output is F F = 1 if and only if X = Y F= X’Y’ + XY

Another Truth Table Derive a truth table with three input X, Y, and Z Output is F F = 1 if and only if there is 0 to the left of a 1 in the input F= X’ Y’ Z + X’ Y Z’ + X’ Y Z + X Y’ Z

And how about this? Four input X, Y, Z, and W Output is F F = 1 if and only if number of variables with value 1 is more than the number of variables with value 0 F = …….