Discussion D5.1 Section Sections 13-3, 13-4

Slides:



Advertisements
Similar presentations
9/15/09 - L6 Other Gate typesCopyright Joanne DeGroat, ECE, OSU1 Other gate types.
Advertisements

Basic Logic Gates Discussion D5.1 Section Sections 13-3, 13-4.
Logic Gates.
Morgan Kaufmann Publishers
ECE 3110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR, Parity Circuits, Comparators.
Mengenal Gerbang Logika (Logic Gate)
Universal Gates Sum of Products Products of Sum
A Programmable Logic Device Lecture 4.3. A Programmable Logic Device Multiple-input Gates A 2-Input, 1-Output PLD.
Digital Electronics Dan Simon Cleveland State University ESC 120 Revised December 30, 2010.
Basic Logic Gates and De Morgan's Theorem Discussion D5.1 Appendix D.
Basic Gates Discussion D2.1. Basic Gates NOT Gate AND Gate OR Gate XOR Gate NAND Gate NOR Gate XNOR Gate.
Logic Design Review – 1 Basic Gates Lecture L14.1 Verilog.
Introduction to Computer Engineering by Richard E. Haskell Basic Logic Gates Module M1.1 Section 3.1.
Basic Gates Verilog Discussion D5.2. Basic Gates NOT Gate AND Gate OR Gate XOR Gate NAND Gate NOR Gate XNOR Gate.

GK-12 Student designed project (AP physics) Digital logic and Boolean algebra exercise. IC logic gates brought from Stevens were used in making simple.
Logical Circuit Design Week 5: Combinational Logic Circuits Mentor Hamiti, MSc Office ,
LOGIC GATES Logic generally has only 2 states, ON or OFF, represented by 1 or 0. Logic gates react to inputs in certain ways. Symbol for AND gate INPUT.
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.
NOCTI Review Lesson 4 Objectives:
TODAY YOU ARE LEARNING to explain why data is represented in computer systems in binary form 2. to understand and produce simple logic diagrams.
Company LOGO DKT 122/3 DIGITAL SYSTEM 1 WEEK #7 COMBINATIONAL LOGIC ANALYSIS.
COMPSCI 210 Semester Tutorial 2: Logic Gates.
Logic Gates. Outline  Logic Gates  The Inverter  The AND Gate  The OR Gate  The NAND Gate  The NOR Gate  The XOR Gate  The XNOR Gate  Drawing.
Chapter 33 Basic Logic Gates. 2 Objectives –After completing this chapter, the student should be able to: Identify and explain the function of the basic.
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
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.
5 - Digital Logic with Boolean Algebra
Logic Gates. AND gate Produces an output only if both inputs are on Input AInput BOutput (Q) Q=
Basic Logic Gates By : Ashima Wadhwa Assistant Professor (giBS)
ECE 2110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR and parity check Circuits.
Logic Gates Chapter 5 Subject: Digital System Year: 2009.
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.
4–1 Gates Let’s examine the processing of the following six types of gates NOT AND OR XOR NAND NOR Typically, logic diagrams are black and white, and the.
Basic Gates and ICs 74LS00 Quad 2-Input NAND gate 74LS02 Quad 2-Input NOR gate 74LS04 Quad 2-Input NOT gate 74LS08 Quad 2-Input AND gate 74LS32 Quad 2-Input.
Dr. Ameria Eldosoky Discrete mathematics
Eng. Mai Z. Alyazji October, 2016
Digital Technology.
Logic Gates and Boolean Algebra
Discussion D5.1 Section Sections 13-3, 13-4
Princess Sumaya University
Basic Logical Operations (Fascinating)
KS4 Electricity – Electronic systems
KS4 Electricity – Electronic systems
Digital Signals Digital Signals have two basic states:
Basic Digital Logic Basic Gates
Principles & Applications
CS203 Discrete Mathematical Structures
Boolean Algebra & Logic Circuits
King Fahd University of Petroleum and Minerals
Waveforms & Timing Diagrams
Logic Gates.
Boolean Algebra.
KS4 Electricity – Electronic systems
Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y
Discussion D5.1 Section Sections 13-3, 13-4
DIGITAL ELECTRONICS B.SC FY
Today You are Learning simple logic diagrams using the operations AND, OR and NOT truth tables combining Boolean operators using AND, OR and NOT.
Logic Gates.
Implementing a generic logic function in CMOS
Basic Logic Gates.
Chapter 2 Gates.
Basic Logic Gates.
Department of Electronics
Basic Logic Operations
Eng. Ahmed M Bader El-Din October, 2018
Introduction to Logic diagrams and truth tables
Introduction to Logic diagrams and truth tables
Agenda Lecture Content: Combinatorial Circuits Boolean Algebras
Presentation transcript:

Discussion D5.1 Section 8.6.2 Sections 13-3, 13-4 Basic Logic Gates Discussion D5.1 Section 8.6.2 Sections 13-3, 13-4

Basic Logic Gates and Basic Digital Design NOT, AND, and OR Gates NAND and NOR Gates DeMorgan’s Theorem Exclusive-OR (XOR) Gate Multiple-input Gates

NOT Gate -- Inverter X Y 1 1

NOT X ~X ~~X = X X ~X ~~X 0 1 0 1 0 1

AND Gate AND X Y Z 0 0 0 0 1 0 1 0 0 1 1 1 X Z Y Z = X & Y

AND X && Y (C-programming) X and Y (VHDL) XY (textbook)

OR Gate OR X Y Z 0 0 0 0 1 1 1 0 1 1 1 1 X Z Y Z = X | Y

OR X || Y (C-programming) X or Y (VHDL) X + Y (textbook)

Basic Logic Gates and Basic Digital Design NOT, AND, and OR Gates NAND and NOR Gates Exclusive-OR (XOR) Gate Multiple-input Gates

NAND Gate NAND X Y Z 0 0 1 0 1 1 X 1 0 1 1 1 0 Z Y Z = ~(X & Y) 0 0 1 0 1 1 1 0 1 1 1 0 X Z Y Z = ~(X & Y) nand(Z,X,Y)

NAND Gate NOT-AND X Y W Z 0 0 0 1 0 1 0 1 X 1 0 0 1 1 1 1 0 W Z Y 0 0 0 1 0 1 0 1 1 0 0 1 1 1 1 0 X W Z Y W = X & Y Z = ~W = ~(X & Y)

NOR Gate NOR X Y Z 0 0 1 0 1 0 X 1 0 0 Z 1 1 0 Y Z = ~(X | Y) 0 0 1 0 1 0 1 0 0 1 1 0 X Z Y Z = ~(X | Y) nor(Z,X,Y)

NOR Gate NOT-OR X Y W Z 0 0 0 1 0 1 1 0 1 0 1 0 1 1 1 0 X W Z Y 0 0 0 1 0 1 1 0 1 0 1 0 1 1 1 0 X W Z Y W = X | Y Z = ~W = ~(X | Y)

Basic Logic Gates and Basic Digital Design NOT, AND, and OR Gates NAND and NOR Gates Exclusive-OR (XOR) Gate Multiple-input Gates

Exclusive-OR Gate XOR X Y Z X Z 0 0 0 Y 0 1 1 1 0 1 1 1 0 Z = X ^ Y 0 0 0 Y 0 1 1 Z = X ^ Y xor(Z,X,Y) 1 0 1 1 1 0

XOR X ^ Y (Verilog) X $ Y (ABEL) X @ Y xor(Z,X,Y) (Verilog)

Exclusive-NOR Gate XNOR X Y Z X Z 0 0 1 Y 0 1 0 1 0 0 1 1 1 Z = X ~^ Y 0 0 1 Y 0 1 0 Z = ~(X ^ Y) Z = X ~^ Y xnor(Z,X,Y) 1 0 0 1 1 1

Basic Logic Gates and Basic Digital Design NOT, AND, and OR Gates NAND and NOR Gates DeMorgan’s Theorem Exclusive-OR (XOR) Gate Multiple-input Gates

Multiple-input Gates Z Z 1 2 Z Z 3 4

Multiple-input AND Gate Z 1 Output is HIGH only if all inputs are HIGH Z 1 An open input will float HIGH

Multiple-input OR Gate Z 2 Output is LOW only if all inputs are LOW Z 2

Multiple-input NAND Gate Z 3 Output is LOW only if all inputs are HIGH Z 3

Multiple-input NOR Gate Z 4 Output is HIGH only if all inputs are LOW Z 4