Introduction to Computer Engineering by Richard E. Haskell Basic Logic Gates Module M1.1 Section 3.1.

Slides:

Advertisements

Similar presentations

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

Advertisements

Combinational Logic Circuits Chapter 2 Mano and Kime.

ECE 238L Computer Logic Design Spring 2010

Morgan Kaufmann Publishers

Introduction to Computer Engineering by Richard E. Haskell Basic Digital Design Module M1.2 Section 3.2.

Multiplexer as a Universal Function Generator Lecture L6.7 Section 6.2.

Logic Design Fundamentals - 1 Lecture L1.1. Logic Design Fundamentals - 1 Basic Gates Basic Combinational Circuits Basic Sequential Circuits.

A Programmable Logic Device Lecture 4.3. A Programmable Logic Device Multiple-input Gates A 2-Input, 1-Output PLD.

Basic Digital Design Discussion D5.4 Section 13.6.

Lab 6 – Part C2 Circuit for Problem 3.6 p 20. a b s y z = ~s & a w = s & b = ~s & a  s & b b s a ~s w = (b & s ) z = (a & ~s ) y = ~ (z & w) De Morgan’s.

Basic Digital Design Discussion D2.3. Basic Digital Design Sum of Products Design –Minterms Product of Sums Design –Maxterms.

Basic Logic Gates and De Morgan's Theorem Discussion D5.1 Appendix D.

Introduction to Computer Engineering by Richard E. Haskell Number Systems Module M3.1 Sections

Introduction to Computer Engineering by Richard E. Haskell 8086 Tutor Monitor Module M14.3 Section 9.3 Appendix B.

Boolean Algebra Module M4.1 Section 5.1. Boolean Algebra and Logic Equations Switching Algebra Theorems Venn Diagrams.

Basic Digital Design Discussion D2.3. Basic Digital Design Sum of Products Design –Minterms Product of Sums Design –Maxterms.

Basic Gates Discussion D2.1. Basic Gates NOT Gate AND Gate OR Gate XOR Gate NAND Gate NOR Gate XNOR Gate.

Multiplexer as a Universal Function Generator

Introduction to Computer Engineering by Richard E. Haskell Logical Instructions Module M16.6 Section 10.5.

Logic Design Review – 1 Basic Gates Lecture L14.1 Verilog.

Introduction to Computer Engineering by Richard E. Haskell 8086 Memory Module M14.1 Sections 9.3.

Basic Gates Verilog Discussion D5.2. Basic Gates NOT Gate AND Gate OR Gate XOR Gate NAND Gate NOR Gate XNOR Gate.

Generalized De Morgan’s Theorem Lecture L5.4 Section 5.1.

Combinational Logic Circuits Chapter 2 Mano and Kime.

Logic gates & Boolean Algebra. Introduction Certain components (called logic elements) of the computer combine electric pulses using a set of rules. Electric.

NOCTI Review Lesson 4 Objectives:

LOGIC GATES & TRUTH TABLE – Digital Circuit 1 Choopan Rattanapoka.

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.

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.

LOGIC GATES AND CIRCUITS Digital systems are said to be constructed by using logic gates. These gates are the AND, OR, NOT, NAND, NOR, EXOR and EXNOR gates.

Chapter 3 Gate-Level Minimization

Boolean Logic and Circuits ELEC 311 Digital Logic and Circuits Dr. Ron Hayne Images Courtesy of Cengage Learning.

COE 202: Digital Logic Design Combinational Logic Part 4

Logic Gates. The Inverter The inverter (NOT circuit) performs the operation called inversion or complementation. Standard logic symbols: 1 1 input output.

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.

Brief Introduction to Boolean Algebra We can use transistors to build AND, OR, NAND, NOR, and Invertors Manufacturing is simplified with NAND/NOR NAND/NOR.

Ahmad Almulhem, KFUPM 2010 COE 202: Digital Logic Design Combinational Logic Part 4 Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office:

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.

COMPUTER ARCHITECTURE TRUTH TABLES AND LOGIC GATES.

Chapter-3: BOOLEAN ALGEBRA & LOGIC GATES Analysis and logical design.

Boolean Algebra and Logic Gates

Logic Gates. AND gate Produces an output only if both inputs are on Input AInput BOutput (Q) Q=

Solid-State Devices & Circuits

School of Computer and Communication Engineering, UniMAP Mohd ridzuan mohd nor DKT 122/3 - DIGITAL SYSTEM I Chapter.

CHAPTER 5 Combinational Logic Analysis

Basic Logic Gates By : Ashima Wadhwa Assistant Professor (giBS)

Chapter 5 Boolean Algebra and Reduction Techniques 1.

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.

CSE 461. Binary Logic Binary logic consists of binary variables and logical operations. Variables are designated by letters such as A, B, C, x, y, z etc.

CHAPTER 13 Digital Logic Circuits. Figure Voltage analog of internal combustion engine in-cylinder pressure Figure 13.1.

Digital Logic Circuits, Digital Component and Data Representation Course: BCA-2 nd Sem Subject: Computer Organization And Architecture Unit-1 1.

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

Speaker: Fuw-Yi Yang 楊伏夷伏夷非征番, 道德經察政章(Chapter 58) 伏者潛藏也

Table 2.1 Postulates and Theorems of Boolean Algebra

Eng. Mai Z. Alyazji October, 2016

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

Basic Logical Operations (Fascinating)

Boolean logic in CMOS.

13 Digital Logic Circuits.

Table 2.1 Postulates and Theorems of Boolean Algebra

University of Maryland Baltimore County Department of Computer Science and Electrical Engineering CMPE 212 Laboratory (Discussion 4) Hasib Hasan

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

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

Basic Logic Gates.

Chapter 2 Gates.

Basic Logic Gates.

Boolean Algebra.

Presentation transcript:

Introduction to Computer Engineering by Richard E. Haskell Basic Logic Gates Module M1.1 Section 3.1

Introduction to Computer Engineering by Richard E. Haskell Basic Logic Gates NOT, AND, and OR Gates NAND and NOR Gates DeMorgan’s Theorem Exclusive-OR (XOR) Gate

Introduction to Computer Engineering by Richard E. Haskell XY Y= !X NOT NOT Gate -- Inverter X Y

Introduction to Computer Engineering by Richard E. Haskell NOT Y = !X Y = X’ Y = X Y =  X

Introduction to Computer Engineering by Richard E. Haskell NOT X!X!!X = X X !X !!X

Introduction to Computer Engineering by Richard E. Haskell AND Gate AND X Y Z Z = X & Y X Y Z

Introduction to Computer Engineering by Richard E. Haskell AND X & Y X Y X * Y XY U V

Introduction to Computer Engineering by Richard E. Haskell OR Gate OR X Y Z Z = X # Y X Y Z

Introduction to Computer Engineering by Richard E. Haskell OR X # Y X + Y X V Y X U Y

Introduction to Computer Engineering by Richard E. Haskell NAND Gate NAND X Y Z Z = !(X & Y) X Y Z

Introduction to Computer Engineering by Richard E. Haskell NAND Gate NOT-AND X Y Z W = X & Y Z = !W = !(X & Y) X Y W Z W

Introduction to Computer Engineering by Richard E. Haskell NOR Gate NOR X Y Z Z = !(X # Y) X Y Z

Introduction to Computer Engineering by Richard E. Haskell NOR Gate NOT-OR X Y W = X # Y Z = !W = !(X # Y) X Y W Z Z W

Introduction to Computer Engineering by Richard E. Haskell NAND Gate X Y X Y Z Z Z = !(X & Y)Z = !X # !Y = X Y W Z X Y !X !Y Z

Introduction to Computer Engineering by Richard E. Haskell De Morgan’s Theorem-1 !(X & Y) = !X # !Y NOT all variables Change & to # and # to & NOT the result

Introduction to Computer Engineering by Richard E. Haskell NOR Gate X Y Z Z = !(X # Y) X Y Z X Y Z Z = !X & !Y X Y !X !Y Z

Introduction to Computer Engineering by Richard E. Haskell De Morgan’s Theorem-2 !(X # Y) = !X & !Y NOT all variables Change & to # and # to & NOT the result

Introduction to Computer Engineering by Richard E. Haskell De Morgan’s Theorem NOT all variables Change & to # and # to & NOT the result !X # !Y = !(!!X & !!Y) = !(X & Y) !(X & Y) = !!(!X # !Y) = !X # !Y !X & !Y = !(!!X # !!Y) = !(X # Y) !(X # Y) = !!(!X & !Y) = !X & !Y

Introduction to Computer Engineering by Richard E. Haskell Exclusive-OR Gate X Y Z XOR X Y Z Z = X $ Y

Introduction to Computer Engineering by Richard E. Haskell Exclusive-OR Gate X Y !X !Y !X&Y X&!Y Z

Introduction to Computer Engineering by Richard E. Haskell Problem Z Write the logic equation for Z in terms of X and Y