Faculty of Computer Science © 2006 CMPUT 229 Digital Logic From Switches to Memories.

Slides:



Advertisements
Similar presentations
Introduction to Computer Engineering ECE/CS 252, Fall 2010 Prof. Mikko Lipasti Department of Electrical and Computer Engineering University of Wisconsin.
Advertisements

CT455: Computer Organization Logic gate
CS105 Introduction to Computer Concepts GATES and CIRCUITS
Documentation Standards
ECE 3110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR, Parity Circuits, Comparators.
Chapter 2 Logic Circuits.
IEEE’s Hands on Practical Electronics (HOPE) Lesson 9: CMOS, Digital Logic.
Introduction to Digital Systems By Dr. John Abraham UT-Panam.
ASCII Code Table (7 bit) UNICODE (16 bit) - UTF-8 provides a 16 bit superset of ASCII.
Chapter 4 Gates and Circuits.
Chapter 3 Continued Logic Gates Logic Chips Combinational Logic Timing Sequential Logic Flip Flops Registers Memory State Machines.
Major Numeric Data Types Unsigned Integers Signed Integers Alphanumeric Data – ASCII & UNICODE Floating Point Numbers.
CS 140L Lecture 1 Professor CK Cheng 3/31/02. CMOS Logic (3.2 – 3.6) Complementary Metal-Oxide Semiconductor.
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Lecture 5 Dr. Shi Dept. of Electrical and Computer Engineering.
10-7 Metal-Oxide Semiconductor ( MOS )  Field-Effect Transistor ( FET ) Unipolar transistor Depend on the flow of only one type of carrier JFET, MOS 
Lecture 3. Boolean Algebra, Logic Gates
Digital Design Copyright © 2006 Frank Vahid 1 Digital Design Slides to accompany the textbook Digital Design, First Edition, by Frank Vahid, John Wiley.
Prof. Kavita Bala and Prof. Hakim Weatherspoon CS 3410, Spring 2014 Computer Science Cornell University See: P&H Appendix B.2 and B.3 (Also, see B.0 and.
Chapter 4 Gates and Circuits. 4–2 Chapter Goals Identify the basic gates and describe the behavior of each Describe how gates are implemented using transistors.
Chapter 4 Gates and Circuits.
MOS Transistors The gate material of Metal Oxide Semiconductor Field Effect Transistors was original made of metal hence the name. Present day devices’
Chapter 3 Digital Logic Structures. 3-2 Transistor: Building Block of Computers Microprocessors contain millions of transistors Intel Pentium 4 (2000):
Chapter 4 Gates and Circuits.
Transistors and Logic Circuits. Transistor control voltage in voltage out control high allows current to flow -- switch is closed (on) control low stops.
Introduction to Computing Systems from bits & gates to C & beyond Chapter 3 Digital Logic Structures Transistors Logic gates & Boolean logic Combinational.
Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Roadmap Problems Algorithms.
Apr. 3, 2000Systems Architecture I1 Systems Architecture I (CS ) Lecture 3: Review of Digital Circuits and Logic Design Jeremy R. Johnson Mon. Apr.
Quiz What are the results of the following 4-bit bitwise logical operations? NOT OR NOR AND
Digital Logic Structures MOS transistors logic gates functional units of a computer.
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.
Instructor:Po-Yu Kuo 教師:郭柏佑
Digital Logic Structures: Chapter 3 COMP 2610 Dr. James Money COMP
CBP 2006Comp 4070 Concepts and Philosophy of Computing 1 Wrestling with Complex Stuff. With the Correct Approach, even the smallest guy will succeed!
Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Transistor: Building.
Boolean Algebra and Logic Gates
Instructor : Po-Yu Kuo 教師:郭柏佑 Ch. 3 Digital Logic Structures EL 1009 計算機概論 ( 電子一 B) Introduction to Computer Science.
Introduction to Computing Systems and Programming Digital Logic Structures.
CMOS Logic Gates. NMOS transistor acts as a switch 2 When gate voltage is 0 V No channel is formed current does not flow easily “open switch” When gate.
Chapter 3 Digital Logic Structures
CMPUT Computer Organization and Architecture I1 CMPUT229 - Fall 2002 Topic 2: Digital Logic Structure José Nelson Amaral.
Basic Electricity and Electronics Module Three Microprocessor Basics Copyright © Texas Education Agency, All rights reserved.
Digital electronics 4–1 Gates and Circuits SANJAYBHAI RAJGURU COLLEGE OF ENGG.
LOGIC CIRCUITLOGIC CIRCUIT. Goal To understand how digital a computer can work, at the lowest level. To understand what is possible and the limitations.
Computer Organization and Design Transistors & Logic - II Montek Singh Wed, Oct 17, 2012 Lecture 11.
L OGIC G ATES Computer Organization – week 3. W HAT ’ S ALU? 1. ALU stands for: Arithmetic Logic Unit 2. ALU is a digital circuit that performs Arithmetic.
Instructor:Po-Yu Kuo 教師:郭柏佑
Speaker: Fuw-Yi Yang 楊伏夷 伏夷非征番, 道德經 察政章(Chapter 58) 伏者潛藏也
Transistors and Logic Circuits
Lecture 6: Universal Gates
Transistors and Logic Circuits
Instructor:Po-Yu Kuo 教師:郭柏佑
Logic Gates.
KS4 Electricity – Electronic systems
KS4 Electricity – Electronic systems
Basic Digital Logic Basic Gates
Jeremy R. Johnson Wed. Sept. 29, 1999
ECE 434 Advanced Digital System L03
Chapter 4 Gates and Circuits.
CS105 Introduction to Computer Concepts GATES and CIRCUITS
Week 7: Gates and Circuits: PART II
Discrete Mathematics CS 2610
Instructor:Po-Yu Kuo 教師:郭柏佑
Logic Gates.
Lecture 6: Universal Gates
KS4 Electricity – Electronic systems
DIGITAL ELECTRONICS B.SC FY
Digital Logic Experiment
Department of Electronics
Presentation transcript:

Faculty of Computer Science © 2006 CMPUT 229 Digital Logic From Switches to Memories

© 2006 Department of Computing Science CMPUT 229 Reading Material  These slides are based on the Text by Patt and Patel: Introduction to Computing Systems: From Bits & Gates to C & Beyond.  The concepts covered here are presented in Chapter 2 of Alan Clements’ textbook.

© 2006 Department of Computing Science CMPUT 229 The Light Switch

© 2006 Department of Computing Science CMPUT 229 A N-MOS transistor A Metal-Oxide Semiconductor (MOS) transistor has three terminals. The Gate controls the flow of electrons between the two other terminals. In a N-type MOS transistor, electrons will flow when a voltage of 2.9 V is applied to the Gate (closed circuit). If 0.0 V is applied to the Gate no electrons will flow (open circuit). 2.9 Volt battery (power supply) Gate

© 2006 Department of Computing Science CMPUT 229 P-MOS Transistor The operation of a P-type MOS transistor, is the opposite of an N-MOS: - electrons will flow when a voltage of 0.0 V is applied to the Gate (closed circuit). - If 2.9 V is applied to the Gate no electrons will flow (open circuit). Gate #1 #2

© 2006 Department of Computing Science CMPUT 229 The NOT Gate Problem: Use two MOS transistors to implement the following logic circuit: NOT 2.9 Volts 0 Volts In Out Your NOT circuit should implement the following logic function:

© 2006 Department of Computing Science CMPUT V 0V 0 Volts 2.9 Volts 0V 2.9 Volts 0 Volts 2.9V The NOT Gate In 2.9 Volts 0 Volts Out XX’

© 2006 Department of Computing Science CMPUT 229 The NOR Gate A C B A= 0V C= 0V B=0V

© 2006 Department of Computing Science CMPUT 229 The NOR Gate A C B A= 0V C= 0V B=2.9V

© 2006 Department of Computing Science CMPUT 229 The NOR Gate A C B A= 2.9V C= 0V B= 0V

© 2006 Department of Computing Science CMPUT 229 The NOR Gate A C B A= 2.9V C= 0V B= 2.9V XYXY Z

© 2006 Department of Computing Science CMPUT 229 What Logic Function this Circuit Implements? A B C D This is an OR gate. ABAB C=A+B

© 2006 Department of Computing Science CMPUT 229 The AND Gate A B C D ABAB C=A·B

© 2006 Department of Computing Science CMPUT 229 Logic Functions ABAB C=A+B ABAB C=A·B

© 2006 Department of Computing Science CMPUT 229 Logic Functions INVERTER XX’ If X=0 then X’=1 If X=1 then X’=0 OR ABAB C=A+B If A=1 OR B=1 then C=1 otherwise C=0 ABAB C=A·B If A=1 AND B=1 then C=1 otherwise C=0 AND

© 2006 Department of Computing Science CMPUT 229 NOR and NAND Because these combination of gates are used often, there are special symbols to represent them: XYXY Z XYXY Z Z XYXY XYXY Z  

© 2006 Department of Computing Science CMPUT 229 First DeMorgan’s Law The complement of the OR is equal the AND of the complements. (X+Y)’ = X’Y’ XYXY Z Z Y X 

© 2006 Department of Computing Science CMPUT 229 Decoders –General decoder structure –Typically n inputs, 2 n outputs –2-to-4, 3-to-8, 4-to-16, etc.

© 2006 Department of Computing Science CMPUT 229 Decoders 3-to-8 Line Decoder y 0 = a’b’c’ y 1 = a’b’c y 2 = a’bc’ y 3 = a’bc y 4 = ab’c’ y 5 = ab’c y 6 = abc’ y 7 = abc a b c

© 2006 Department of Computing Science CMPUT 229 Binary 2-to-4 decoder Note “x” (don’t care) notation.

© 2006 Department of Computing Science CMPUT to-4-decoder logic diagram

© 2006 Department of Computing Science CMPUT 229 Instruction Decoder Clements, pp. 86 COPYRIGHT 2006 OXFORD UNIVERSITY PRESS ALL RIGHTS RESERVED

© 2006 Department of Computing Science CMPUT 229 The to-8 Decoder Clements, pp. 86 COPYRIGHT 2006 OXFORD UNIVERSITY PRESS ALL RIGHTS RESERVED

© 2006 Department of Computing Science CMPUT 229 Multiplexer Clements, pp. 84 COPYRIGHT 2006 OXFORD UNIVERSITY PRESS ALL RIGHTS RESERVED

© 2006 Department of Computing Science CMPUT 229 Multiplexer Clements, pp. 85 COPYRIGHT 2006 OXFORD UNIVERSITY PRESS ALL RIGHTS RESERVED

© 2006 Department of Computing Science CMPUT 229 Multiplexers 4-to-1 MUX I0I0 I1I1 I2I2 I3I3 AB Z ABI3ABI3 A B’ I 2 A’ B I 1 A’ B’ I 0 Z

© 2006 Department of Computing Science CMPUT 229 Multiple 2-to-1 Multiplexers Clements, pp. 84 COPYRIGHT 2006 OXFORD UNIVERSITY PRESS ALL RIGHTS RESERVED