Slide Set 6. for ENEL 353 Fall Steve Norman, PhD, PEng. Electrical & Computer Engineering Schulich School of Engineering University of Calgary
|
|
- Giles Kelly
- 5 years ago
- Views:
Transcription
1 Slide Set 6 for ENEL 353 Fall 2017 Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary Fall Term, 2017
2 SN s ENEL 353 Fall 2017 Slide Set 6 slide 2/44 Contents Multiplexers Decoders Introduction to timing of combinational logic Propagation and contamination delays Overall t pd and t cd calculations Glitches
3 SN s ENEL 353 Fall 2017 Slide Set 6 slide 3/44 Outline of Slide Set 6 Multiplexers Decoders Introduction to timing of combinational logic Propagation and contamination delays Overall t pd and t cd calculations Glitches
4 SN s ENEL 353 Fall 2017 Slide Set 6 slide 4/44 Multiplexers Multiplexer is rather a long word, so mux is often used as an abbreviation. Another quite descriptive name for multiplexer is selector. A multiplexer circuit has two or more data inputs; one or more bits of select input; an output. The job of a multiplexer is to copy one of the data inputs to the output. The data input selected for copying is chosen by the select input.
5 SN s ENEL 353 Fall 2017 Slide Set 6 slide 5/44 The 2:1 multiplexer ( two-to-one mux ) A circuit symbol and truth table: D 0 0 D 1 1 S Y D 1 D 0 S Y Let s write out a few sentences to describe exactly what this circuit does.
6 SN s ENEL 353 Fall 2017 Slide Set 6 slide 6/44 2:1 mux built from NOT, AND and OR gates The truth table from the previous slide results in this K-map and minimal SOP expression... D 1 D 0 S Y = D 0 S + D1 S S A circuit for this made from NOT, AND, and OR gates... D 0 Y D 1
7 SN s ENEL 353 Fall 2017 Slide Set 6 slide 7/44 Variations on the tristate buffer (a) A Y non-inverting, active high enable (c) E E A Y inverting, active high enable (b) A (d) E Y non-inverting, active low enable E A Y inverting, active low enable Version (a) is the one we have already looked at. But each of (b), (c), and (d) is sometimes useful as well. Let s make tables to describe all four circuits.
8 SN s ENEL 353 Fall 2017 Slide Set 6 slide 8/44 2:1 mux implemented with tristate buffers The two schematics describe exactly the same design. The one on the right is from the textbook, and uses a compact notation for showing a common control input wire for the tristate buffers. S S D 0 D 1 T0 T1 Y D 0 D 1 T0 T1 Y Two gate outputs are wired together! Y Is= that D 0 S + adproblem 1 S in this design? Image on right is from Figure 2.56 from Harris D. M. and Harris S. L., Digital Design and Computer Architecture, 2nd ed., c 2013, Elsevier, Inc.
9 SN s ENEL 353 Fall 2017 Slide Set 6 slide 9/44 The 4:1 multiplexer ( four-to-one mux ) S 1 S 0 D 0 00 How many rows would a truth table for this circuit have? D 1 01 D 2 10 D 3 11 Y Let s describe the circuit in a table that is more compact than a truth table.
10 Let s make some notes on these three designs for 4:1 mux circuits. S 1 S 0 S 1 S 0 D 0 D 0 D 1 S 1 S 0 S 0 S 1 D 2 D 3 D 1 D 2 S 1 S 0 S 1 S 0 Y D 0 D 1 D Y (a) Y D 3 (b) D 3 (c) 1 Image is Figure 2.58 from Harris D. M. and Harris S. L., Digital Design and Computer Architecture, 2nd ed., c 2013, Elsevier, Inc.
11 SN s ENEL 353 Fall 2017 Slide Set 6 slide 11/44 Base two logarithms: What does log 2 N mean? Base two logarithms are often useful in discussion of digital systems (and also in discussion of computing algorithms and data structures). You should already be familiar with natural (base e) and common logarithms, defined as follows: If y = e x, then ln y = x. If y = 10 x, then log 10 y = x. The definition for the base two logarithm works the same way: If y = 2 x, then log 2 y = x.
12 SN s ENEL 353 Fall 2017 Slide Set 6 slide 12/44 Wider multiplexers If you understand 2:1 and 4:1 muxes, it s very easier to generalize to N:1, if N is a power of two. The table to the right describes an 8:1 mux. How many select bits would be needed for a 16:1 mux? For a 32:1 mux? What would be a general formula for the number of select bits needed for an N:1 mux? S 2 S 1 S o Y D D D D D D D D 7
13 SN s ENEL 353 Fall 2017 Slide Set 6 slide 13/44 Using muxes to implement logic functions Multiplexers have a lot of practical applications. We ll see some of them later in this course and others in ENCM 369 in Winter. For now, we ll just look at one such application: Given a truth table with N rows for a function F, it s very straightforward to make a circuit for F with an N:1 multiplexer as the key component.
14 SN s ENEL 353 Fall 2017 Slide Set 6 slide 14/44 Textbook graphical notation for HIGH and LOW voltage connections This schematic is an example of the symbols Harris & Harris use... connection to V DD (power supply) connection to ground What is the output of the AND gate? (This is supposed to be an easy question.)
15 SN s ENEL 353 Fall 2017 Slide Set 6 slide 15/44 Example of using muxes to implement logic functions How can we implement the given function with an 8:1 mux? How can we implement the given function with a 4:1 mux and an inverter? A B C Y
16 SN s ENEL 353 Fall 2017 Slide Set 6 slide 16/44 N:1 multiplexers with N not a power of two Sometimes a circuit requires selection of one of N signals, where N is not a power of two. This is easy to accommodate. For example, let s describe a 3:1 mux. Let s build a 3:1 mux from two 2:1 muxes. Let s build a 3:1 mux using a 4:1 mux.
17 SN s ENEL 353 Fall 2017 Slide Set 6 slide 17/44 Outline of Slide Set 6 Multiplexers Decoders Introduction to timing of combinational logic Propagation and contamination delays Overall t pd and t cd calculations Glitches
18 SN s ENEL 353 Fall 2017 Slide Set 6 slide 18/44 Decoders A decoder has N inputs and 2 N outputs. Here are examples of 2:4 and 3:8 decoders... Y 7 Y 6 A 1 Y 3 2:4 Y 2 A 3:8 1 A 0 decoder decoder Y 1 Y 0 A 2 A 0 Y 5 Y 4 Y 3 Y 2 Y 1 Y 0 Let s write a description of the 2:4 decoder, then show how to make one using inverters and AND gates.
19 SN s ENEL 353 Fall 2017 Slide Set 6 slide 19/44 Building logic functions with decoders Because decoders are minterm generators, decoders can be used to go from truth tables to circuits in a very straightforward way. Let s illustrate this by making a 1-bit full adder out of a 3:8 decoder and some OR gates.
20 SN s ENEL 353 Fall 2017 Slide Set 6 slide 20/44 Decoders with enable inputs (This topic is not covered in Section 2.8 in the textbook.) A common variation of the decoder is a decoder with an enable input: A 1 A 0 2:4 decoder EN Y 3 Y 2 Y 1 Y 0 This is just like the 2:4 decoder we looked at earlier, except that when EN = 0, all outputs are 0. Let s write a truth table for this.
21 SN s ENEL 353 Fall 2017 Slide Set 6 slide 21/44 Using small decoders with enable inputs to make bigger decoders Let s build a 3:8 decoder using an inverter and two 2:4 decoder-with-enable circuits. Let s build a 4:16 decoder-with-enable using some 2:4 decoder-with-enable circuits.
22 SN s ENEL 353 Fall 2017 Slide Set 6 slide 22/44 Outline of Slide Set 6 Multiplexers Decoders Introduction to timing of combinational logic Propagation and contamination delays Overall t pd and t cd calculations Glitches
23 SN s ENEL 353 Fall 2017 Slide Set 6 slide 23/44 Introduction to timing of combinational logic The definition of combinational logic is that the outputs of a combinational element depend only on the current values of its inputs. In reality, combinational elements have very, very short reaction times. Changes in inputs trigger changes to outputs that are almost but not quite instant. Delays in combinational logic can set important limits on how fast digital systems can operate. We re about to study some simple methods for estimating overall delays when complex combinational elements are built from simpler combinational elements.
24 SN s ENEL 353 Fall 2017 Slide Set 6 slide 24/44 How short is a picosecond? 1 ps = s. Every second contains = 1 trillion picoseconds. For simple logic gates in today s integrated circuits, propagation delays reaction times to changes in input values are typically tens of picoseconds. An Olympic sprinter is considered to have false-started if she or he has reacted to the starting gun in less than seconds. Let s compare logic gates and humans using the same units for time... Typical AND gate reaction time: 60 ps. Very fast human reaction time: 100,000,000,000 ps.
25 SN s ENEL 353 Fall 2017 Slide Set 6 slide 25/44 Sketching logic levels as functions of time When a logic signal changes value, voltage as a function of time will follow a curve dictated by some complex physics: V DD voltage 0 time In making sketches to illustrate digital circuit timing, the exact shapes of voltage/time curves are not important, and this style of drawing is often used: logic 1 level 0 time
26 SN s ENEL 353 Fall 2017 Slide Set 6 slide 26/44 Delay in a simple gate A A Y Time delay Y By convention, delay is measured from the time that the input is halfway between LOW and HIGH; to the time that the output is halfway between LOW and HIGH. Image is Figure 2.66 from Harris D. M. and Harris S. L., Digital Design and Computer Architecture, 2nd ed., c 2013, Elsevier, Inc.
27 SN s ENEL 353 Fall 2017 Slide Set 6 slide 27/44 A combinational element will exhibit a range of delays There is no single reaction time for a given combinational element. Here are some of the many reasons for this: HIGH-to-LOW output transitions may be faster or slower than LOW-to-HIGH transitions, depending on the design of the element. Circuits tend to get slower as they get warmer. Supposedly identical gates may perform differently due to due to variations in manufacturing. In elements with multiple output bits, some output bits may switch faster than others.
28 SN s ENEL 353 Fall 2017 Slide Set 6 slide 28/44 Outline of Slide Set 6 Multiplexers Decoders Introduction to timing of combinational logic Propagation and contamination delays Overall t pd and t cd calculations Glitches
29 SN s ENEL 353 Fall 2017 Slide Set 6 slide 29/44 Propagation and contamination delays Because any combinational element exhibits a range of delays, delay characteristics of an element are often described by two numbers: t pd, the propagation delay. This is the maximum possible delay under the expected operating conditions for the element. t cd, the contamination delay. This is the minimum possible delay under the expected operating conditions for the element.
30 SN s ENEL 353 Fall 2017 Slide Set 6 slide 30/44 t pd and t cd illustrated in a timing diagram A Y A Y t cd t pd This is a relatively simple timing diagram, but there is still a lot going on here! Let s make some notes about how to read this diagram. Time Image is Figure 2.67 from Harris D. M. and Harris S. L., Digital Design and Computer Architecture, 2nd ed., c 2013, Elsevier, Inc.
31 SN s ENEL 353 Fall 2017 Slide Set 6 slide 31/44 Example propagation and contamination delays A detailed simulation of a 2-input NAND gate design produces the data shown in the sketch below... 1 A 0 1 B 0 Y 1 0 A B Y 100ps 130ps 220ps 280ps 150ps 200ps 350ps 380ps What does the data tell us about t pd and t cd for this NAND gate design?
32 SN s ENEL 353 Fall 2017 Slide Set 6 slide 32/44 What are the causes of delays? One major cause is the fact that a node in a logic circuit acts as a capacitor. That puts a limit on the rate of change of voltage at a node. I + V C I = C dv dv, so dt dt = I C. Another important cause is wire delay it takes a small amount of time for a voltage change to get from one end of a wire to the other, even for the tiny wires within integrated circuits. We won t study the physical causes of delay in ENEL 353. It s an important topic in ENCM 467 (Digital Electronics).
33 SN s ENEL 353 Fall 2017 Slide Set 6 slide 33/44 Outline of Slide Set 6 Multiplexers Decoders Introduction to timing of combinational logic Propagation and contamination delays Overall t pd and t cd calculations Glitches
34 SN s ENEL 353 Fall 2017 Slide Set 6 slide 34/44 Overall t pd and t cd calculations Suppose a combinational system is built by wiring together some combinational elements. C L C L C L C L If we have t pd and t cd data for each of the elements, how can we find overall values of t pd and t cd for the system as a whole? We ll see that solving this problem involves concepts called the critical path and the short path.
35 SN s ENEL 353 Fall 2017 Slide Set 6 slide 35/44 A simple example of t pd and t cd calculations A B C D Y gate t pd t cd AND OR (Times given in ps.) What is the critical path for this circuit? What is the short path? What is the overall t pd? What is the overall t cd?
36 SN s ENEL 353 Fall 2017 Slide Set 6 slide 36/44 Another simple example of t pd and t cd calculations A B C D E Y Timing data in ps... gate t pd t cd NOT input AND input OR What is the critical path for this circuit? What is the short path? What are the overall t pd and t cd? What important point is being made in this example?
37 SN s ENEL 353 Fall 2017 Slide Set 6 slide 37/44 A third simple example of t pd and t cd calculations A B C D E n1 n2 Y Timing data in ps... gate t pd t cd NOT input AND input AND input OR What are the overall t pd and t cd?
38 SN s ENEL 353 Fall 2017 Slide Set 6 slide 38/44 Timing data for textbook 4:1 mux examples Gate t pd (ps) NOT 30 2-input AND 60 3-input AND 80 4-input OR 90 tristate (A to Y ) 50 tristate (EN to Y ) 35 Sometimes a gate can respond faster to one of its inputs than to another. The tristate buffer is an example of that. All of the data is made up for the purpose of setting up the mux design examples. (That s also true about other examples in the textbook and in lecture slides.) Real timing depends on dimensions and chemical composition of transistors, layout of gates, and other factors. A EN Y
39 For these 4:1 mux designs, find t pd from the S inputs to the output, and also from the D inputs to the output. S 1 S 0 S 1 S 0 D 0 D 0 D 1 D 2 D 3 D 1 D 2 Out Out D 3 t pd_sy = t pd_inv + t pd_and3 + t pd_or4 t pd_sy = t pd_inv + t pd_and2 + t pd_tri_sy Image is taken= from 30 ps Figure + 80 ps ps from Harris D. = 30 M. ps and + 60 ps Harris + 35 ps S. L., Digital Design (a) = and 200 Computer ps Architecture, (b) 2nd = 125 ed., psc 2013, Elsevier, Inc. tpd_dy = t pd_and3 + t pd_or4 tpd_dy = t pd_tri_ay = 170 ps = 50 ps
40 SN s ENEL 353 Fall 2017 Slide Set 6 slide 40/44 One more 4:1 mux example D 0 S 0 S 1 For these 4:1 mux designs, find t pd from the S inputs to Y, and also from the D inputs to Y. D 1 D 2 D 3 2:1 mux 2:1 mux 2:1 mux t pd_s0y = t pd_trlsy + t pd_tri_ay = 85 ns Y Image is taken from Figure 2.74 from Harris D. M. and Harris S. L., Digital Design and Computer Architecture, 2nd ed., c 2013, Elsevier, Inc. Note: The textbook gives answers in nanoseconds, but clearly they should be in picoseconds.
41 SN s ENEL 353 Fall 2017 Slide Set 6 slide 41/44 Outline of Slide Set 6 Multiplexers Decoders Introduction to timing of combinational logic Propagation and contamination delays Overall t pd and t cd calculations Glitches
42 SN s ENEL 353 Fall 2017 Slide Set 6 slide 42/44 Glitches A C n1 n2 Y B n3 What is Y when (A,B,C) = (1,1,1)? What about (A,B,C) = (1,1,0)? Suppose the delays are 30 ps for NOT, 50 ps for AND, and 60 ps for OR. Let s make a timing diagram to show what happens to Y when (A,B,C) goes from (1,1,1) to (1,1,0).
43 SN s ENEL 353 Fall 2017 Slide Set 6 slide 43/44 Timing diagram for glitch example 1 A 0 1 B 0 1 C 0 1 n1 0 1 n2 0 1 n3 0 1 Y 0 t = 0ps 30ps 50ps 80ps 110ps 140ps Let s write down a few remarks about this diagram.
44 SN s ENEL 353 Fall 2017 Slide Set 6 slide 44/44 Are glitches bad? In certain specialized digital design problems, avoidance of glitches in combinational outputs is very important. Usually, though, glitches are not a concern, and what really matters in timing of combinational logic is making sure that overall propagation delay is not long. (Sometimes low power consumption is even more important than small propagation delay.) In Section 2.9.2, Harris & Harris present a method based on K-maps that can sometimes be used to make circuits glitch-free. We re not going to study that in ENEL 353.
Slides for Lecture 19
Slides for Lecture 19 ENEL 353: Digital Circuits Fall 2013 Term Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary 23 October, 2013 ENEL 353
More informationT02 Tutorial Slides for Week 6
T02 Tutorial Slides for Week 6 ENEL 353: Digital Circuits Fall 2017 Term Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary 17 October, 2017
More informationDigital Logic & Computer Design CS Professor Dan Moldovan Spring Copyright 2007 Elsevier 2-<101>
Digital Logic & Computer Design CS 434 Professor Dan Moldovan Spring 2 Copyright 27 Elsevier 2- Chapter 2 :: Combinational Logic Design Digital Design and Computer Architecture David Money Harris and
More informationSlides for Lecture 16
Slides for Lecture 6 ENEL 353: Digital Circuits Fall 203 Term Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary 6 October, 203 ENEL 353 F3 Section
More informationDigital Logic & Computer Design CS Professor Dan Moldovan Spring 2010
Digital Logic & Computer Design CS 434 Professor Dan Moldovan Spring 2 Copyright 27 Elsevier 2- Chapter 2 :: Combinational Logic Design Digital Design and Computer rchitecture David Money Harris and
More informationKarnaugh Maps (K-Maps)
Karnaugh Maps (K-Maps) Boolean expressions can be minimized by combining terms P + P = P K-maps minimize equations graphically Put terms to combine close to one another B C C B B C BC BC BC BC BC BC BC
More informationSlides for Lecture 10
Slides for Lecture 10 ENEL 353: Digital Circuits Fall 2013 Term Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary 30 September, 2013 ENEL 353
More informationSlide Set 3. for ENEL 353 Fall Steve Norman, PhD, PEng. Electrical & Computer Engineering Schulich School of Engineering University of Calgary
Slide Set 3 for ENEL 353 Fall 2016 Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary Fall Term, 2016 SN s ENEL 353 Fall 2016 Slide Set 3 slide
More informationCOSC3330 Computer Architecture Lecture 2. Combinational Logic
COSC333 Computer rchitecture Lecture 2. Combinational Logic Instructor: Weidong Shi (Larry), PhD Computer Science Department University of Houston Today Combinational Logic oolean lgebra Mux, DeMux, Decoder
More informationComputer Science 324 Computer Architecture Mount Holyoke College Fall Topic Notes: Digital Logic
Computer Science 324 Computer Architecture Mount Holyoke College Fall 2007 Topic Notes: Digital Logic Our goal for the next few weeks is to paint a a reasonably complete picture of how we can go from transistor
More information211: Computer Architecture Summer 2016
211: Computer Architecture Summer 2016 Liu Liu Topic: Storage Project3 Digital Logic - Storage: Recap - Review: cache hit rate - Project3 - Digital Logic: - truth table => SOP - simplification: Boolean
More informationDigital Logic. CS211 Computer Architecture. l Topics. l Transistors (Design & Types) l Logic Gates. l Combinational Circuits.
CS211 Computer Architecture Digital Logic l Topics l Transistors (Design & Types) l Logic Gates l Combinational Circuits l K-Maps Figures & Tables borrowed from:! http://www.allaboutcircuits.com/vol_4/index.html!
More informationChapter 2. Introduction. Chapter 2 :: Topics. Circuits. Nodes. Circuit elements. Introduction
hapter 2 Introduction igital esign and omputer rchitecture, 2 nd Edition avid Money Harris and Sarah L. Harris logic circuit is composed of: Inputs Outputs Functional specification Timing specification
More informationFloating Point Representation and Digital Logic. Lecture 11 CS301
Floating Point Representation and Digital Logic Lecture 11 CS301 Administrative Daily Review of today s lecture w Due tomorrow (10/4) at 8am Lab #3 due Friday (9/7) 1:29pm HW #5 assigned w Due Monday 10/8
More informationLogic Design Combinational Circuits. Digital Computer Design
Logic Design Combinational Circuits Digital Computer Design Topics Combinational Logic Karnaugh Maps Combinational uilding locks Timing 2 Logic Circuit logic circuit is composed of: Inputs Outputs Functional
More informationBoolean Logic Continued Prof. James L. Frankel Harvard University
Boolean Logic Continued Prof. James L. Frankel Harvard University Version of 10:18 PM 5-Sep-2017 Copyright 2017, 2016 James L. Frankel. All rights reserved. D Latch D R S Clk D Clk R S X 0 ~S 0 = R 0 ~R
More informationLecture 22 Chapters 3 Logic Circuits Part 1
Lecture 22 Chapters 3 Logic Circuits Part 1 LC-3 Data Path Revisited How are the components Seen here implemented? 5-2 Computing Layers Problems Algorithms Language Instruction Set Architecture Microarchitecture
More informationELCT201: DIGITAL LOGIC DESIGN
ELCT201: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 5 Following the slides of Dr. Ahmed H. Madian ذو الحجة 1438 ه Winter
More informationLecture 4: DC & Transient Response
Introduction to CMOS VLSI Design Lecture 4: DC & Transient Response David Harris Harvey Mudd College Spring 004 Outline DC Response Logic Levels and Noise Margins Transient Response Delay Estimation Slide
More informationCPE100: Digital Logic Design I
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu CPE100: Digital Logic Design I Midterm02 Review http://www.ee.unlv.edu/~b1morris/cpe100/ 2 Logistics Thursday Nov. 16 th In normal lecture (13:00-14:15)
More informationCSC9R6 Computer Design. Practical Digital Logic
CSC9R6 Computer Design Practical Digital Logic 1 References (for this part of CSC9R6) Hamacher et al: Computer Organization App A. In library Floyd: Digital Fundamentals Ch 1, 3-6, 8-10 web page: www.prenhall.com/floyd/
More informationCSE370 HW3 Solutions (Winter 2010)
CSE370 HW3 Solutions (Winter 2010) 1. CL2e, 4.9 We are asked to implement the function f(a,,c,,e) = A + C + + + CE using the smallest possible multiplexer. We can t use any extra gates or the complement
More informationCprE 281: Digital Logic
CprE 28: Digital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ Decoders and Encoders CprE 28: Digital Logic Iowa State University, Ames, IA Copyright Alexander Stoytchev
More informationCSE140: Components and Design Techniques for Digital Systems. Logic minimization algorithm summary. Instructor: Mohsen Imani UC San Diego
CSE4: Components and Design Techniques for Digital Systems Logic minimization algorithm summary Instructor: Mohsen Imani UC San Diego Slides from: Prof.Tajana Simunic Rosing & Dr.Pietro Mercati Definition
More informationChapter 9. Estimating circuit speed. 9.1 Counting gate delays
Chapter 9 Estimating circuit speed 9.1 Counting gate delays The simplest method for estimating the speed of a VLSI circuit is to count the number of VLSI logic gates that the input signals must propagate
More informationContents. Chapter 3 Combinational Circuits Page 1 of 36
Chapter 3 Combinational Circuits Page of 36 Contents Combinational Circuits...2 3. Analysis of Combinational Circuits...3 3.. Using a Truth Table...3 3..2 Using a Boolean Function...6 3.2 Synthesis of
More informationUnit 8A Computer Organization. Boolean Logic and Gates
Unit 8A Computer Organization Boolean Logic and Gates Announcements Bring ear buds or headphones to lab! 15110 Principles of Computing, Carnegie Mellon University - CORTINA 2 Representing and Manipulating
More informationLecture 7: Logic design. Combinational logic circuits
/24/28 Lecture 7: Logic design Binary digital circuits: Two voltage levels: and (ground and supply voltage) Built from transistors used as on/off switches Analog circuits not very suitable for generic
More informationProve that if not fat and not triangle necessarily means not green then green must be fat or triangle (or both).
hapter : oolean lgebra.) Definition of oolean lgebra The oolean algebra is named after George ool who developed this algebra (854) in order to analyze logical problems. n example to such problem is: Prove
More informationMODULAR CIRCUITS CHAPTER 7
CHAPTER 7 MODULAR CIRCUITS A modular circuit is a digital circuit that performs a specific function or has certain usage. The modular circuits to be introduced in this chapter are decoders, encoders, multiplexers,
More informationLecture 6: DC & Transient Response
Lecture 6: DC & Transient Response Slides courtesy of Deming Chen Slides based on the initial set from David Harris CMOS VLSI Design Outline Pass Transistors DC Response Logic Levels and Noise Margins
More informationLecture 5: DC & Transient Response
Lecture 5: DC & Transient Response Outline q Pass Transistors q DC Response q Logic Levels and Noise Margins q Transient Response q RC Delay Models q Delay Estimation 2 Activity 1) If the width of a transistor
More informationUnit 3 Session - 9 Data-Processing Circuits
Objectives Unit 3 Session - 9 Data-Processing Design of multiplexer circuits Discuss multiplexer applications Realization of higher order multiplexers using lower orders (multiplexer trees) Introduction
More informationFor smaller NRE cost For faster time to market For smaller high-volume manufacturing cost For higher performance
University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences EECS5 J. Wawrzynek Spring 22 2/22/2. [2 pts] Short Answers. Midterm Exam I a) [2 pts]
More informationCS470: Computer Architecture. AMD Quad Core
CS470: Computer Architecture Yashwant K. Malaiya, Professor malaiya@cs.colostate.edu AMD Quad Core 1 Architecture Layers Building blocks Gates, flip-flops Functional bocks: Combinational, Sequential Instruction
More informationCombinational Logic. By : Ali Mustafa
Combinational Logic By : Ali Mustafa Contents Adder Subtractor Multiplier Comparator Decoder Encoder Multiplexer How to Analyze any combinational circuit like this? Analysis Procedure To obtain the output
More informationChapter 3 Combinational Logic Design
Logic and Computer Design Fundamentals Chapter 3 Combinational Logic Design Part 2 Combinational Logic Charles Kime & Thomas Kaminski 28 Pearson Education, Inc. (Hyperlinks are active in View Show mode)
More informationCPE100: Digital Logic Design I
Chapter 2 Professor Brendan Morris, SEB 326, brendan.morris@unlv.edu http://www.ee.unlv.edu/~bmorris/cpe/ CPE: Digital Logic Design I Section 4: Dr. Morris Combinational Logic Design Chapter 2 Chapter
More informationDigital Logic: Boolean Algebra and Gates. Textbook Chapter 3
Digital Logic: Boolean Algebra and Gates Textbook Chapter 3 Basic Logic Gates XOR CMPE12 Summer 2009 02-2 Truth Table The most basic representation of a logic function Lists the output for all possible
More informationCOSC 243. Introduction to Logic And Combinatorial Logic. Lecture 4 - Introduction to Logic and Combinatorial Logic. COSC 243 (Computer Architecture)
COSC 243 Introduction to Logic And Combinatorial Logic 1 Overview This Lecture Introduction to Digital Logic Gates Boolean algebra Combinatorial Logic Source: Chapter 11 (10 th edition) Source: J.R. Gregg,
More informationEE40 Lec 15. Logic Synthesis and Sequential Logic Circuits
EE40 Lec 15 Logic Synthesis and Sequential Logic Circuits Prof. Nathan Cheung 10/20/2009 Reading: Hambley Chapters 7.4-7.6 Karnaugh Maps: Read following before reading textbook http://www.facstaff.bucknell.edu/mastascu/elessonshtml/logic/logic3.html
More informationChapter 4. Combinational: Circuits with logic gates whose outputs depend on the present combination of the inputs. elements. Dr.
Chapter 4 Dr. Panos Nasiopoulos Combinational: Circuits with logic gates whose outputs depend on the present combination of the inputs. Sequential: In addition, they include storage elements Combinational
More informationCSE 140 Lecture 11 Standard Combinational Modules. CK Cheng and Diba Mirza CSE Dept. UC San Diego
CSE 4 Lecture Standard Combinational Modules CK Cheng and Diba Mirza CSE Dept. UC San Diego Part III - Standard Combinational Modules (Harris: 2.8, 5) Signal Transport Decoder: Decode address Encoder:
More information2009 Spring CS211 Digital Systems & Lab CHAPTER 2: INTRODUCTION TO LOGIC CIRCUITS
CHAPTER 2: INTRODUCTION TO LOGIC CIRCUITS What will we learn? 2 Logic functions and circuits Boolean Algebra Logic gates and Synthesis CAD tools and VHDL Read Section 2.9 and 2.0 Terminology 3 Digital
More informationLECTURE 28. Analyzing digital computation at a very low level! The Latch Pipelined Datapath Control Signals Concept of State
Today LECTURE 28 Analyzing digital computation at a very low level! The Latch Pipelined Datapath Control Signals Concept of State Time permitting, RC circuits (where we intentionally put in resistance
More informationNumbers & Arithmetic. Hakim Weatherspoon CS 3410, Spring 2012 Computer Science Cornell University. See: P&H Chapter , 3.2, C.5 C.
Numbers & Arithmetic Hakim Weatherspoon CS 3410, Spring 2012 Computer Science Cornell University See: P&H Chapter 2.4-2.6, 3.2, C.5 C.6 Example: Big Picture Computer System Organization and Programming
More informationIntro To Digital Logic
Intro To Digital Logic 1 Announcements... Project 2.2 out But delayed till after the midterm Midterm in a week Covers up to last lecture + next week's homework & lab Nick goes "H-Bomb of Justice" About
More informationCMPEN 411 VLSI Digital Circuits Spring Lecture 19: Adder Design
CMPEN 411 VLSI Digital Circuits Spring 2011 Lecture 19: Adder Design [Adapted from Rabaey s Digital Integrated Circuits, Second Edition, 2003 J. Rabaey, A. Chandrakasan, B. Nikolic] Sp11 CMPEN 411 L19
More informationCSE 140 Spring 2017: Final Solutions (Total 50 Points)
CSE 140 Spring 2017: Final Solutions (Total 50 Points) 1. (Boolean Algebra) Prove the following Boolean theorem using Boolean laws only, i.e. no theorem is allowed for the proof. State the name of the
More informationCSE140: Components and Design Techniques for Digital Systems. Decoders, adders, comparators, multipliers and other ALU elements. Tajana Simunic Rosing
CSE4: Components and Design Techniques for Digital Systems Decoders, adders, comparators, multipliers and other ALU elements Tajana Simunic Rosing Mux, Demux Encoder, Decoder 2 Transmission Gate: Mux/Tristate
More informationDesigning Information Devices and Systems II Fall 2017 Miki Lustig and Michel Maharbiz Homework 1. This homework is due September 5, 2017, at 11:59AM.
EECS 16 Designing Information Devices and Systems II Fall 017 Miki Lustig and Michel Maharbiz Homework 1 This homework is due September 5, 017, at 11:59M. 1. Fundamental Theorem of Solutions to Differential
More informationChapter 3 Ctd: Combinational Functions and Circuits
Chapter 3 Ctd: Combinational Functions and Circuits 1 Value Fixing, Transferring, and Inverting Four different functions are possible as a function of single Boolean variable Transferring Inverting Value
More informationChapter 3 Combinational Logic Design
Logic and Computer Design Fundamentals Chapter 3 Combinational Logic Design Part 1- Implementation Technology and Logic Design Overview Part 1-Implementation Technology and Logic Design Design Concepts
More informationS C F F F T T F T T S C B F F F F F T F T F F T T T F F T F T T T F T T T
EECS 270, Winter 2017, Lecture 1 Page 1 of 6 Use pencil! Say we live in the rather black and white world where things (variables) are either true (T) or false (F). So if S is Mark is going to the Store
More informationNumber System. Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary
Number System Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary BOOLEAN ALGEBRA BOOLEAN LOGIC OPERATIONS Logical AND Logical OR Logical COMPLEMENTATION
More informationBoolean Algebra, Gates and Circuits
Boolean Algebra, Gates and Circuits Kasper Brink November 21, 2017 (Images taken from Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc.) Outline Last week: Von
More informationComputer Organization: Boolean Logic
Computer Organization: Boolean Logic Representing and Manipulating Data Last Unit How to represent data as a sequence of bits How to interpret bit representations Use of levels of abstraction in representing
More informationMemory, Latches, & Registers
Memory, Latches, & Registers 1) Structured Logic Arrays 2) Memory Arrays 3) Transparent Latches 4) How to save a few bucks at toll booths 5) Edge-triggered Registers L13 Memory 1 General Table Lookup Synthesis
More informationLecture 12 CMOS Delay & Transient Response
EE 471: Transport Phenomena in Solid State Devices Spring 2018 Lecture 12 CMOS Delay & Transient Response Bryan Ackland Department of Electrical and Computer Engineering Stevens Institute of Technology
More informationTopics. Dynamic CMOS Sequential Design Memory and Control. John A. Chandy Dept. of Electrical and Computer Engineering University of Connecticut
Topics Dynamic CMOS Sequential Design Memory and Control Dynamic CMOS In static circuits at every point in time (except when switching) the output is connected to either GND or V DD via a low resistance
More informationVidyalankar S.E. Sem. III [CMPN] Digital Logic Design and Analysis Prelim Question Paper Solution
. (a) (i) ( B C 5) H (A 2 B D) H S.E. Sem. III [CMPN] Digital Logic Design and Analysis Prelim Question Paper Solution ( B C 5) H (A 2 B D) H = (FFFF 698) H (ii) (2.3) 4 + (22.3) 4 2 2. 3 2. 3 2 3. 2 (2.3)
More informationCHAPTER1: Digital Logic Circuits Combination Circuits
CS224: Computer Organization S.KHABET CHAPTER1: Digital Logic Circuits Combination Circuits 1 PRIMITIVE LOGIC GATES Each of our basic operations can be implemented in hardware using a primitive logic gate.
More information5. Sequential Logic x Computation Structures Part 1 Digital Circuits. Copyright 2015 MIT EECS
5. Sequential Logic 6.004x Computation Structures Part 1 igital Circuits Copyright 2015 MIT EECS 6.004 Computation Structures L5: Sequential Logic, Slide #1 Something We Can t Build (Yet) What if you were
More informationChapter 5. Digital Design and Computer Architecture, 2 nd Edition. David Money Harris and Sarah L. Harris. Chapter 5 <1>
Chapter 5 Digital Design and Computer Architecture, 2 nd Edition David Money Harris and Sarah L. Harris Chapter 5 Chapter 5 :: Topics Introduction Arithmetic Circuits umber Systems Sequential Building
More informationEEC 116 Lecture #5: CMOS Logic. Rajeevan Amirtharajah Bevan Baas University of California, Davis Jeff Parkhurst Intel Corporation
EEC 116 Lecture #5: CMOS Logic Rajeevan mirtharajah Bevan Baas University of California, Davis Jeff Parkhurst Intel Corporation nnouncements Quiz 1 today! Lab 2 reports due this week Lab 3 this week HW
More informationReview: Additional Boolean operations
Review: Additional Boolean operations Operation: NAND (NOT-AND) NOR (NOT-OR) XOR (exclusive OR) Expressions: (xy) = x + y (x + y) = x y x y = x y + xy Truth table: x y (xy) x y (x+y) x y x y 0 0 1 0 1
More informationECE 545 Digital System Design with VHDL Lecture 1. Digital Logic Refresher Part A Combinational Logic Building Blocks
ECE 545 Digital System Design with VHDL Lecture Digital Logic Refresher Part A Combinational Logic Building Blocks Lecture Roadmap Combinational Logic Basic Logic Review Basic Gates De Morgan s Law Combinational
More informationLogic. Combinational. inputs. outputs. the result. system can
Digital Electronics Combinational Logic Functions Digital logic circuits can be classified as either combinational or sequential circuits. A combinational circuit is one where the output at any time depends
More informationEE141-Fall 2011 Digital Integrated Circuits
EE4-Fall 20 Digital Integrated Circuits Lecture 5 Memory decoders Administrative Stuff Homework #6 due today Project posted Phase due next Friday Project done in pairs 2 Last Lecture Last lecture Logical
More informationALU A functional unit
ALU A functional unit that performs arithmetic operations such as ADD, SUB, MPY logical operations such as AND, OR, XOR, NOT on given data types: 8-,16-,32-, or 64-bit values A n-1 A n-2... A 1 A 0 B n-1
More informationECE 2300 Digital Logic & Computer Organization
ECE 23 Digital Logic & Computer Organization Spring 28 Combinational Building Blocks Lecture 5: Announcements Lab 2 prelab due tomorrow HW due Friday HW 2 to be posted on Thursday Lecture 4 to be replayed
More informationSystems I: Computer Organization and Architecture
Systems I: Computer Organization and Architecture Lecture 6 - Combinational Logic Introduction A combinational circuit consists of input variables, logic gates, and output variables. The logic gates accept
More informationC.K. Ken Yang UCLA Courtesy of MAH EE 215B
Decoders: Logical Effort Applied C.K. Ken Yang UCLA yang@ee.ucla.edu Courtesy of MAH 1 Overview Reading Rabaey 6.2.2 (Ratio-ed logic) W&H 6.2.2 Overview We have now gone through the basics of decoders,
More informationCS 226: Digital Logic Design
CS 226: Digital Logic Design 0 1 1 I S 0 1 0 S Department of Computer Science and Engineering, Indian Institute of Technology Bombay. 1 of 29 Objectives In this lecture we will introduce: 1. Logic functions
More informationELCT201: DIGITAL LOGIC DESIGN
ELCT2: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 2 Following the slides of Dr. Ahmed H. Madian ذو الحجة 438 ه Winter
More informationVery Large Scale Integration (VLSI)
Very Large Scale Integration (VLSI) Lecture 4 Dr. Ahmed H. Madian Ah_madian@hotmail.com Dr. Ahmed H. Madian-VLSI Contents Delay estimation Simple RC model Penfield-Rubenstein Model Logical effort Delay
More informationECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 9 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Week 9 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering TIMING ANALYSIS Overview Circuits do not respond instantaneously to input changes
More informationOverview. Multiplexor. cs281: Introduction to Computer Systems Lab02 Basic Combinational Circuits: The Mux and the Adder
cs281: Introduction to Computer Systems Lab02 Basic Combinational Circuits: The Mux and the Adder Overview The objective of this lab is to understand two basic combinational circuits the multiplexor and
More informationENEL Digital Circuits Final Examination
Name: I#: Lecture Section: ENEL 353 - igital Circuits Final Examination Lecture sections : N. R. Bartley, MWF : :5, ENC 24 2: S. A. Norman, MWF : :5, ST 45 Wednesday, ecember 7, 24 Time: 7: PM : PM Locations:
More informationCPE100: Digital Logic Design I
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu CPE100: Digital Logic Design I Final Review http://www.ee.unlv.edu/~b1morris/cpe100/ 2 Logistics Tuesday Dec 12 th 13:00-15:00 (1-3pm) 2 hour
More informationEE5780 Advanced VLSI CAD
EE5780 Advanced VLSI CAD Lecture 4 DC and Transient Responses, Circuit Delays Zhuo Feng 4.1 Outline Pass Transistors DC Response Logic Levels and Noise Margins Transient Response RC Delay Models Delay
More informationCombina-onal Logic Chapter 4. Topics. Combina-on Circuit 10/13/10. EECE 256 Dr. Sidney Fels Steven Oldridge
Combina-onal Logic Chapter 4 EECE 256 Dr. Sidney Fels Steven Oldridge Topics Combina-onal circuits Combina-onal analysis Design procedure simple combined to make complex adders, subtractors, converters
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 3 Additional Gates and Circuits Charles Kime & Thomas Kaminski 2008 Pearson Education, Inc. (Hyperlinks are active in
More informationCprE 281: Digital Logic
CprE 28: Digital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ Code Converters CprE 28: Digital Logic Iowa State University, Ames, IA Copyright Alexander Stoytchev HW
More informationCombinational Logic. Fan-in/ Fan-out Timing. Copyright (c) 2012 Sean Key
Combinational Logic Fan-in/ Fan-out Timing Copyright (c) 2012 Sean Key Fan-in & Fan-out Fan-in The number of inputs to a logic gate Higher fan-in can lead to longer gate delays because of the higher input
More informationMODULE 5 Chapter 7. Clocked Storage Elements
MODULE 5 Chapter 7 Clocked Storage Elements 3/9/2015 1 Outline Background Clocked Storage Elements Timing, terminology, classification Static CSEs Latches Registers Dynamic CSEs Latches Registers 3/9/2015
More informationCMOS Technology Worksheet
CMOS Technology Worksheet Concept Inventory: Notes: PFET, NFET: voltage controlled switches CMOS composition rules: complementary pullup and pulldown CMOS gates are naturally inverting t PD and t CD timing
More informationCMPEN 411 VLSI Digital Circuits Spring Lecture 21: Shifters, Decoders, Muxes
CMPEN 411 VLSI Digital Circuits Spring 2011 Lecture 21: Shifters, Decoders, Muxes [Adapted from Rabaey s Digital Integrated Circuits, Second Edition, 2003 J. Rabaey, A. Chandrakasan, B. Nikolic] Sp11 CMPEN
More informationCPE/EE 427, CPE 527 VLSI Design I Delay Estimation. Department of Electrical and Computer Engineering University of Alabama in Huntsville
CPE/EE 47, CPE 57 VLSI Design I Delay Estimation Department of Electrical and Computer Engineering University of labama in Huntsville leksandar Milenkovic ( www.ece.uah.edu/~milenka ) Review: CMOS Circuit
More informationUniversity of Florida EEL 3701 Fall 2014 Dr. Eric. M. Schwartz Department of Electrical & Computer Engineering Wednesday, 15 October 2014
Page 1/12 Exam 1 May the Schwartz Instructions: be with you! Turn off all cell phones and other noise making devices and put away all electronics Show all work on the front of the test papers Box each
More informationComputer Science. 19. Combinational Circuits. Computer Science COMPUTER SCIENCE. Section 6.1.
COMPUTER SCIENCE S E D G E W I C K / W A Y N E PA R T I I : A L G O R I T H M S, M A C H I N E S, a n d T H E O R Y Computer Science Computer Science An Interdisciplinary Approach Section 6.1 ROBERT SEDGEWICK
More informationEECS Variable Logic Functions
EECS150 Section 1 Introduction to Combinational Logic Fall 2001 2-Variable Logic Functions There are 16 possible functions of 2 input variables: in general, there are 2**(2**n) functions of n inputs X
More informationEE115C Digital Electronic Circuits Homework #4
EE115 Digital Electronic ircuits Homework #4 Problem 1 Power Dissipation Solution Vdd =1.0V onsider the source follower circuit used to drive a load L =20fF shown above. M1 and M2 are both NMOS transistors
More informationXI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL.
2017-18 XI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL HALF ADDER 1. The circuit that performs addition within the Arithmetic and Logic Unit of the CPU are called adders. 2. A unit that adds two
More informationDigital Electronics H H
Electronics In digital circuits only two values of Vin or Vout are considered, Low (L) or High (H). The two values correspond to the logical states True (T) or False (F). CMOS AND circuit (L)ow voltage
More informationLatches. October 13, 2003 Latches 1
Latches The second part of CS231 focuses on sequential circuits, where we add memory to the hardware that we ve already seen. Our schedule will be very similar to before: We first show how primitive memory
More informationBinary addition (1-bit) P Q Y = P + Q Comments Carry = Carry = Carry = Carry = 1 P Q
Digital Arithmetic In Chapter 2, we have discussed number systems such as binary, hexadecimal, decimal, and octal. We have also discussed sign representation techniques, for example, sign-bit representation
More informationCombinational Logic Design Combinational Functions and Circuits
Combinational Logic Design Combinational Functions and Circuits Overview Combinational Circuits Design Procedure Generic Example Example with don t cares: BCD-to-SevenSegment converter Binary Decoders
More informationHomework Assignment #1 Solutions EE 477 Spring 2017 Professor Parker
Homework Assignment #1 Solutions EE 477 Spring 2017 Professor Parker Note: + implies OR,. implies AND, ~ implies NOT Question 1: a) (4%) Use transmission gates to design a 3-input OR gate Note: There are
More informationBinary addition example worked out
Binary addition example worked out Some terms are given here Exercise: what are these numbers equivalent to in decimal? The initial carry in is implicitly 0 1 1 1 0 (Carries) 1 0 1 1 (Augend) + 1 1 1 0
More information