Memory, Latches, & Registers
|
|
- Malcolm Moody
- 5 years ago
- Views:
Transcription
1 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
2 General Table Lookup Synthesis A B AB Fn(A,B) MUX Logic Fn(A,B) Generalizing: Remember from a few lectures ago that, in theory, we can build any 1-output combinational logic block with multiplexers. For an N-input function we need a input multiplexer. BIG Multiplexers? How about 10-input function? 20-input? L13 Memory 2
3 General Table Lookup Synthesis A B AB Fn(A,B) MUX Logic Fn(A,B) Generalizing: Remember from a few lectures ago that, in theory, we can build any 1-output combinational logic block with multiplexers. 2 N For an N-input function we need a input multiplexer. BIG Multiplexers? How about 10-input function? 20-input? L13 Memory 3
4 A Mux s Guts A decoder generates all possible product terms for a set of inputs ecoder Selector Multiplexers A B A B A B A B I 00 I 01 I 10 I 11 Y can be partitioned into two sections. A ECOER that identifies the desired input,and a SELECTOR that enables that input onto the output. Hmmm, by sharing the decoder part of the logic MUXs could be adapted to make lookup tables with any number of outputs L13 Memory 4
5 A New Combinational evice k 1 2 N ECOER: k SELECT inputs, N = 2 k ATA OUTPUTs. Selected j HIGH; all others LOW. Have I mentioned that HIGH is a synonym for 1 and LOW means the same as 0 NOW, we are well on our way to building a general purpose table-lookup device. We can build a 2-dimensional ARRAY of decoders and selectors as follows... L13 Memory 5
6 Shared ecoding Logic A B C in ecoder S C out Configurable Selector We can build a general purpose table-lookup device called a Read-Only Memory (ROM), from which we can implement any truth table and, thus, any combinational device Made from PREWIRE connections, and CONFIGURABLE connections that can be either connected or not connected L13 Memory 6
7 Shared ecoding Logic A B C in ecoder These are just emorgan ized NOR gates S C out Configurable Selector We can build a general purpose table-lookup device called a Read-Only Memory (ROM), from which we can implement any truth table and, thus, any combinational device Made from PREWIRE connections, and CONFIGURABLE connections that can be either connected or not connected L13 Memory 7
8 Shared ecoding Logic There s an extra level of inversion that isn t necessary in the logic. However, it reduces the capacitive load on the module driving this one. A B C in ecoder These are just emorgan ized NOR gates S C out Configurable Selector We can build a general purpose table-lookup device called a Read-Only Memory (ROM), from which we can implement any truth table and, thus, any combinational device Made from PREWIRE connections, and CONFIGURABLE connections that can be either connected or not connected L13 Memory 8
9 Shared ecoding Logic There s an extra level of inversion that isn t necessary in the logic. However, it reduces the capacitive load on the module driving this one. A B C in ecoder These are just emorgan ized NOR gates S This ROM stores 16 bits in 8 words of 2 bits. C out Configurable Selector We can build a general purpose table-lookup device called a Read-Only Memory (ROM), from which we can implement any truth table and, thus, any combinational device Made from PREWIRE connections, and CONFIGURABLE connections that can be either connected or not connected L13 Memory 9
10 Logic According to ROMs ROMs ignore the structure of combinational functions... Size, layout, and design are independent of function Any Truth table can be programmed by minor reconfiguration: - Metal layer (masked ROMs) - Fuses (Field-programmable PROMs) - Charge on floating gates (EPROMs)... etc. Model: LOOK UP value of function in truth table... Inputs: ARESS of a T.T. entry ROM SIZE = # TT entries for an N-input boolean function, size = L13 Memory 10
11 Logic According to ROMs ROMs ignore the structure of combinational functions... Size, layout, and design are independent of function Any Truth table can be programmed by minor reconfiguration: - Metal layer (masked ROMs) - Fuses (Field-programmable PROMs) - Charge on floating gates (EPROMs)... etc. Model: LOOK UP value of function in truth table... Inputs: ARESS of a T.T. entry ROM SIZE = # TT entries for an N-input boolean function, size = 2 N x #outputs L13 Memory 11
12 Analog Storage: Using Capacitors We ve chosen to encode information using voltages and we know from physics that we can store a voltage as charge on a capacitor: bit line word line V REF N-channel FET serves as an access switch To write: rive bit line, turn on access fet, force storage cap to new voltage To read: precharge bit line, turn on access fet, detect (small) change in bit line voltage Pros: compact! Cons: it leaks! refresh complex interface reading a bit, destroys it (you have to rewrite the value after each read) it s NOT a digital circuit This storage circuit is the basis for commodity RAMs L13 Memory 12
13 RAM Organization L13 Memory 13
14 RAM Errors Typical RAM cell stores about 75 fc (femtocoulombs) of charge. That s about ½ million electrons Or at 3 Volts about 1.5 MeV (megaelectron volts) Sounds like a lot! Until you consider other sources. Google reports that error rates are 100 s to 1000 s of times higher than thought. Over 3700 errors per IMM per year. Cosmic Ray Flux vs Particle Energy (link) L13 Memory 14
15 A igital Storage Element It s also easy to build a settable IGITAL storage element (called a latch) using a MUX and FEEBACK: A B 0 1 Y S L13 Memory 15
16 A igital Storage Element It s also easy to build a settable IGITAL storage element (called a latch) using a MUX and FEEBACK: A B 0 1 Y S L13 Memory 16
17 A igital Storage Element It s also easy to build a settable IGITAL storage element (called a latch) using a MUX and FEEBACK: Here s a feedback path, so it s no longer a combinational circuit. A B 0 1 Y S L13 Memory 17
18 A igital Storage Element It s also easy to build a settable IGITAL storage element (called a latch) using a MUX and FEEBACK: Here s a feedback path, so it s no longer a combinational circuit. A 0 G IN OUT B SG 1 Y L13 Memory 18
19 A igital Storage Element It s also easy to build a settable IGITAL storage element (called a latch) using a MUX and FEEBACK: Here s a feedback path, so it s no longer a combinational circuit. state signal appears as both input and output A 0 G IN OUT B SG 1 Y L13 Memory 19
20 A igital Storage Element It s also easy to build a settable IGITAL storage element (called a latch) using a MUX and FEEBACK: Here s a feedback path, so it s no longer a combinational circuit. state signal appears as both input and output A 0 G IN OUT B SG 1 Y stable follows L13 Memory 20
21 Looking Under the Covers Let s take a quick look at the equivalent circuit for our MUX when the gate is LOW (the feedback path is active) G=0 0 1 G=0 1 1 This storage circuit is the basis for commodity SRAMs Advantages: 1) Maintains remembered state for as long as power is applied. 2) State is IGITAL isadvantage: 1) Requires more transistors L13 Memory 21
22 Why oes Feedback = Storage? BIG IEA: use positive feedback to maintain storage indefinitely. Our logic gates are built to restore marginal signal levels, so noise shouldn t be a problem! V IN V OUT Result: a bistable storage element L13 Memory 22
23 Why oes Feedback = Storage? BIG IEA: use positive feedback to maintain storage indefinitely. Our logic gates are built to restore marginal signal levels, so noise shouldn t be a problem! V IN V OUT Result: a bistable storage element V OUT Waveform for inverter pair V IN L13 Memory 23
24 Why oes Feedback = Storage? BIG IEA: use positive feedback to maintain storage indefinitely. Our logic gates are built to restore marginal signal levels, so noise shouldn t be a problem! V IN V OUT Result: a bistable storage element V OUT Waveform for inverter pair Feedback constraint: V IN = V OUT V IN L13 Memory 24
25 Why oes Feedback = Storage? BIG IEA: use positive feedback to maintain storage indefinitely. Our logic gates are built to restore marginal signal levels, so noise shouldn t be a problem! V IN V OUT Result: a bistable storage element V OUT Waveform for inverter pair Feedback constraint: V IN = V OUT Not affected by noise Three solutions: two end-points are stable middle point is unstable V IN We ll get back to this! L13 Memory 25
26 Static Latch G G Positive latch follows Negative latch What is the difference? 1 G G 0 stable static means latch will hold data (i.e., value of ) while G is inactive, however long that may be. L13 Memory 26
27 A YNAMIC iscipline esign of sequential circuits MUST guarantee that inputs to sequential devices are valid and stable during periods when they may influence state changes. This is assured with additional timing specifications. G L13 Memory 27
28 A YNAMIC iscipline esign of sequential circuits MUST guarantee that inputs to sequential devices are valid and stable during periods when they may influence state changes. This is assured with additional timing specifications. G >t PULSE t PULSE : minimum pulse width guarantee G is active for long enough for latch to capture data L13 Memory 28
29 A YNAMIC iscipline esign of sequential circuits MUST guarantee that inputs to sequential devices are valid and stable during periods when they may influence state changes. This is assured with additional timing specifications. G >t PULSE >t SETUP t PULSE : minimum pulse width guarantee G is active for long enough for latch to capture data t SETUP : setup time guarantee that value has propagated through feedback path before latch closes L13 Memory 29
30 A YNAMIC iscipline esign of sequential circuits MUST guarantee that inputs to sequential devices are valid and stable during periods when they may influence state changes. This is assured with additional timing specifications. G >t PULSE >t SETUP >t HOL t PULSE : minimum pulse width guarantee G is active for long enough for latch to capture data t SETUP : setup time guarantee that value has propagated through feedback path before latch closes t HOL : hold time guarantee latch is closed and is stable before allowing to change L13 Memory 30
31 Flakey Control Systems Here s a strategy for saving 2 bucks the next time you find yourself at a toll booth! L13 Memory 31
32 Flakey Control Systems Here s a strategy for saving 2 bucks the next time you find yourself at a toll booth! L13 Memory 32
33 Flakey Control Systems Here s a strategy for saving 2 bucks the next time you find yourself at a toll booth! L13 Memory 33
34 Flakey Control Systems Here s a strategy for saving 2 bucks the next time you find yourself at a toll booth! WARNING: Professional rivers Used! ON T try this At home! L13 Memory 34
35 Escapement Strategy The Solution: Add two gates and only open one at a time. L13 Memory 35
36 Escapement Strategy The Solution: Add two gates and only open one at a time. L13 Memory 36
37 Escapement Strategy The Solution: Add two gates and only open one at a time. L13 Memory 37
38 Escapement Strategy The Solution: Add two gates and only open one at a time. L13 Memory 38
39 Escapement Strategy The Solution: Add two gates and only open one at a time. L13 Memory 39
40 Escapement Strategy The Solution: Add two gates and only open one at a time. L13 Memory 40
41 Escapement Strategy The Solution: Add two gates and only open one at a time. L13 Memory 41
42 Escapement Strategy The Solution: Add two gates and only open one at a time. L13 Memory 42
43 Escapement Strategy The Solution: Add two gates and only open one at a time. L13 Memory 43
44 Escapement Strategy The Solution: Add two gates and only open one at a time. L13 Memory 44
45 Escapement Strategy The Solution: Add two gates and only open one at a time. L13 Memory 45
46 Escapement Strategy The Solution: Add two gates and only open one at a time. L13 Memory 46
47 Escapement Strategy The Solution: Add two gates and only open one at a time. L13 Memory 47
48 Escapement Strategy The Solution: Add two gates and only open one at a time. L13 Memory 48
49 Escapement Strategy The Solution: Add two gates and only open one at a time. L13 Memory 49
50 Escapement Strategy The Solution: Add two gates and only open one at a time. KEY: At no time is there an open path through both gates L13 Memory 50
51 Edge-triggered Flip Flop logical escapement G master G slave CLK CLK Transitions mark instants, not intervals Observations: only one latch transparent at any time: master closed when slave is open (CLK is high) slave closed when master is open (CLK is low) no combinational path through flip flop only changes shortly after 0 1 transition of CLK, so flip flop appears to be triggered by rising edge of CLK L13 Memory 51
52 Flip Flop Waveforms CLK master slave G G CLK CLK master closed slave open slave closed master open L13 Memory 52
53 Two Issues G master slave G CLK Must allow time for the input s value to propagate to the Master s output while CLK is LOW. This is called SET-UP time Must keep the input stable, just after CLK transitions to HIGH. This is insurance in case the SLAVE s gate opens just before the MASTER s gate closes. This is called HOL-TIME Can be zero (or even negative!) Assuring set-up and hold times is what limits a computer s performance L13 Memory 53
54 Flip-Flop Timing Specs CLK CLK L13 Memory 54
55 Flip-Flop Timing Specs CLK CLK t P : maximum propagation delay, CLK L13 Memory 55
56 Flip-Flop Timing Specs CLK CLK <t P t P : maximum propagation delay, CLK L13 Memory 56
57 Flip-Flop Timing Specs CLK CLK <t P >t SETUP t P : maximum propagation delay, CLK t SETUP : setup time guarantee that has propagated through feedback path before master closes L13 Memory 57
58 Flip-Flop Timing Specs CLK CLK <t P t P : maximum propagation delay, CLK >t SETUP >t HOL t SETUP : setup time guarantee that has propagated through feedback path before master closes t HOL : hold time guarantee master is closed and data is stable before allowing to change L13 Memory 58
59 Summary Regular Arrays can be used to implement arbitrary logic functions ROMs decode every input combination (fixed-an array) and compute the output for it (customized-or array) PLAs decode an minimal set of input combinations (both AN and OR arrays customized) Memories ROMs are HARWIRE memories RAMs include storage elements at each WOR-line and BIT-line intersection dynamic memory: compact, only reliable short-term static memory: controlled use of positive feedback Level-sensitive -latches for static storage ynamic discipline (setup and hold times) L13 Memory 59
Combinational vs Sequential
Combinational vs Sequential inputs X Combinational Circuits outputs Z A combinational circuit: At any time, outputs depends only on inputs Changing inputs changes outputs No regard for previous inputs
More informationSequencing. Lan-Da Van ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C. Fall,
Sequencing ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C. Fall, 2013 ldvan@cs.nctu.edu.tw http://www.cs.nctu.edu.tw/~ldvan/ Outlines Introduction Sequencing
More informationECE321 Electronics I
ECE321 Electronics I Lecture 25: Sequential Logic: Flip-flop Payman Zarkesh-Ha Office: ECE Bldg. 230B Office hours: Tuesday 2:00-3:00PM or by appointment E-mail: pzarkesh.unm.edu Slide: 1 Review of Last
More informationSequential Circuit Design: Part 1
Sequential Circuit esign: Part 1 esign of memory elements Static latches Pseudo-static latches ynamic latches Timing parameters Two-phase clocking Clocked inverters James Morizio 1 Sequential Logic FFs
More informationECEN454 Digital Integrated Circuit Design. Sequential Circuits. Sequencing. Output depends on current inputs
ECEN454 igital Integrated Circuit esign Sequential Circuits ECEN 454 Combinational logic Sequencing Output depends on current inputs Sequential logic Output depends on current and previous inputs Requires
More informationSequential Circuit Design: Part 1
Sequential ircuit esign: Part 1 esign of memory elements Static latches Pseudo-static latches ynamic latches Timing parameters Two-phase clocking locked inverters Krish hakrabarty 1 Sequential Logic FFs
More informationSequential Logic. E&CE 223 Digital Circuits and Systems (A. Kennings) Page 1
Sequential Logic E&CE 223 igital Circuits and Systems (A. Kennings) Page 1 Sequential Circuits Have considered only combinational circuits in which circuit outputs are determined entirely by current circuit
More informationLogic Design ( Part 3) Sequential Logic (Chapter 3)
o Far: Combinational Logic Logic esign ( Part ) equential Logic (Chapter ) Based on slides McGraw-Hill Additional material 24/25/26 Lewis/Martin Additional material 28 oth Additional material 2 Taylor
More informationMemory elements. Topics. Memory element terminology. Variations in memory elements. Clock terminology. Memory element parameters. clock.
Topics! Memory elements.! Basics of sequential machines. Memory elements! Stores a value as controlled by clock.! May have load signal, etc.! In CMOS, memory is created by:! capacitance (dynamic);! feedback
More informationChapter 7 Memory and Programmable Logic
EEA091 - Digital Logic 數位邏輯 Chapter 7 Memory and Programmable Logic 吳俊興國立高雄大學資訊工程學系 2006 Chapter 7 Memory and Programmable Logic 7-1 Introduction 7-2 Random-Access Memory 7-3 Memory Decoding 7-4 Error
More informationChapter 11 Latches and Flip-Flops
Chapter 11 Latches and Flip-Flops SKEE1223 igital Electronics Mun im/arif/izam FKE, Universiti Teknologi Malaysia ecember 8, 2015 Types of Logic Circuits Combinational logic: Output depends solely on the
More informationLecture 21: Sequential Circuits. Review: Timing Definitions
Lecture 21: Sequential Circuits Setup and Hold time MS FF Power PC Pulsed FF HLFF, SFF, SAFF Source: Ch 7 J. Rabaey notes, Weste and Harris Notes Review: Timing efinitions T C : Propagation elay from Ck
More informationDigital Integrated Circuits EECS 312
14 12 10 8 6 Fujitsu VP2000 IBM 3090S Pulsar 4 IBM 3090 IBM RY6 CDC Cyber 205 IBM 4381 IBM RY4 2 IBM 3081 Apache Fujitsu M380 IBM 370 Merced IBM 360 IBM 3033 Vacuum Pentium II(DSIP) 0 1950 1960 1970 1980
More informationEngr354: Digital Logic Circuits
Engr354: igital Circuits Chapter 7 Sequential Elements r. Curtis Nelson Sequential Elements In this chapter you will learn about: circuits that can store information; Basic cells, latches, and flip-flops;
More informationLecture 11: Sequential Circuit Design
Lecture 11: Sequential Circuit esign Outline q Sequencing q Sequencing Element esign q Max and Min-elay q Clock Skew q Time Borrowing q Two-Phase Clocking 2 Sequencing q Combinational logic output depends
More informationObjectives. Combinational logics Sequential logics Finite state machine Arithmetic circuits Datapath
Objectives Combinational logics Sequential logics Finite state machine Arithmetic circuits Datapath In the previous chapters we have studied how to develop a specification from a given application, and
More informationCSE115: Digital Design Lecture 23: Latches & Flip-Flops
Faculty of Engineering CSE115: Digital Design Lecture 23: Latches & Flip-Flops Sections 7.1-7.2 Suggested Reading A Generic Digital Processor Building Blocks for Digital Architectures INPUT - OUTPUT Interconnect:
More information11. Sequential Elements
11. Sequential Elements Jacob Abraham Department of Electrical and Computer Engineering The University of Texas at Austin VLSI Design Fall 2017 October 11, 2017 ECE Department, University of Texas at Austin
More informationChapter 6. Flip-Flops and Simple Flip-Flop Applications
Chapter 6 Flip-Flops and Simple Flip-Flop Applications Basic bistable element It is a circuit having two stable conditions (states). It can be used to store binary symbols. J. C. Huang, 2004 Digital Logic
More informationHardware Design I Chap. 5 Memory elements
Hardware Design I Chap. 5 Memory elements E-mail: shimada@is.naist.jp Why memory is required? To hold data which will be processed with designed hardware (for storage) Main memory, cache, register, and
More informationEE 447/547 VLSI Design. Lecture 9: Sequential Circuits. VLSI Design EE 447/547 Sequential circuits 1
EE 447/547 VLSI esign Lecture 9: Sequential Circuits Sequential circuits 1 Outline Floorplanning Sequencing Sequencing Element esign Max and Min-elay Clock Skew Time Borrowing Two-Phase Clocking Sequential
More informationCPE/EE 427, CPE 527 VLSI Design I Sequential Circuits. Sequencing
CPE/EE 427, CPE 527 VLSI esign I Sequential Circuits epartment of Electrical and Computer Engineering University of Alabama in Huntsville Aleksandar Milenkovic ( www.ece.uah.edu/~milenka ) Combinational
More informationIT T35 Digital system desigm y - ii /s - iii
UNIT - III Sequential Logic I Sequential circuits: latches flip flops analysis of clocked sequential circuits state reduction and assignments Registers and Counters: Registers shift registers ripple counters
More informationDigital Integrated Circuits EECS 312. Review. Combinational vs. sequential logic. Sequential logic. Introduction to sequential elements
14 12 8 6 IBM ES9000 Bipolar Fujitsu VP2000 IBM 3090S Pulsar 4 IBM 3090 IBM RY6 CC Cyber 20 IBM 4381 IBM RY4 2 IBM 3081 Apache Fujitsu M380 IBM 370 Merced IBM 360 IBM 3033 Vacuum Pentium II(SIP) 0 190
More informationLecture 10: Sequential Circuits
Introduction to CMOS VLSI esign Lecture 10: Sequential Circuits avid Harris Harvey Mudd College Spring 2004 1 Outline Floorplanning Sequencing Sequencing Element esign Max and Min-elay Clock Skew Time
More informationLec 24 Sequential Logic Revisited Sequential Circuit Design and Timing
Traversing igital esign EECS - Components and esign Techniques for igital Systems EECS wks 6 - Lec 24 Sequential Logic Revisited Sequential Circuit esign and Timing avid Culler Electrical Engineering and
More informationcascading flip-flops for proper operation clock skew Hardware description languages and sequential logic
equential logic equential circuits simple circuits with feedback latches edge-triggered flip-flops Timing methodologies cascading flip-flops for proper operation clock skew Basic registers shift registers
More informationEEC 118 Lecture #9: Sequential Logic. Rajeevan Amirtharajah University of California, Davis Jeff Parkhurst Intel Corporation
EEC 118 Lecture #9: Sequential Logic Rajeevan Amirtharajah University of California, Davis Jeff Parkhurst Intel Corporation Outline Review: Static CMOS Logic Finish Static CMOS transient analysis Sequential
More informationCOMP2611: Computer Organization. Introduction to Digital Logic
1 COMP2611: Computer Organization Sequential Logic Time 2 Till now, we have essentially ignored the issue of time. We assume digital circuits: Perform their computations instantaneously Stateless: once
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science
MASSACHUSETTS INSTITUTE OF TECHNOLOGY epartment of Electrical Engineering and Computer Science 6.374: Analysis and esign of igital Integrated Circuits Problem Set # 5 Fall 2003 Issued: 10/28/03 ue: 11/12/03
More informationSaturated Non Saturated PMOS NMOS CMOS RTL Schottky TTL ECL DTL I I L TTL
EC6302-DIGITAL ELECTRONICS UNIT I MINIMIZATION TECHNIQUES AND LOGIC GATES 1. Define binary logic? Binary logic consists of binary variables and logical operations. The variables are designated by the alphabets
More informationDigital Fundamentals
igital Fundamentals Tenth Edition Floyd Chapter 7 Modified by Yuttapong Jiraraksopakun Floyd, igital Fundamentals, 10 th 2008 Pearson Education ENE, KMUTT ed 2009 Summary Latches A latch is a temporary
More informationIntroduction. NAND Gate Latch. Digital Logic Design 1 FLIP-FLOP. Digital Logic Design 1
2007 Introduction BK TP.HCM FLIP-FLOP So far we have seen Combinational Logic The output(s) depends only on the current values of the input variables Here we will look at Sequential Logic circuits The
More informationDigital Design, Kyung Hee Univ. Chapter 5. Synchronous Sequential Logic
Chapter 5. Synchronous Sequential Logic 1 5.1 Introduction Electronic products: ability to send, receive, store, retrieve, and process information in binary format Dependence on past values of inputs Sequential
More informationTopic 8. Sequential Circuits 1
Topic 8 Sequential Circuits 1 Peter Cheung Department of Electrical & Electronic Engineering Imperial College London Rabaey Chapter 7 URL: www.ee.ic.ac.uk/pcheung/ E-mail: p.cheung@ic.ac.uk 1 Based on
More informationNH 67, Karur Trichy Highways, Puliyur C.F, Karur District UNIT-III SEQUENTIAL CIRCUITS
NH 67, Karur Trichy Highways, Puliyur C.F, 639 114 Karur District DEPARTMENT OF ELETRONICS AND COMMUNICATION ENGINEERING COURSE NOTES SUBJECT: DIGITAL ELECTRONICS CLASS: II YEAR ECE SUBJECT CODE: EC2203
More information(CSC-3501) Lecture 7 (07 Feb 2008) Seung-Jong Park (Jay) CSC S.J. Park. Announcement
Seung-Jong Park (Jay) http://www.csc.lsu.edu/~sjpark Computer Architecture (CSC-3501) Lecture 7 (07 Feb 2008) 1 Announcement 2 1 Combinational vs. Sequential Logic Combinational Logic Memoryless Outputs
More informationSolution to Digital Logic )What is the magnitude comparator? Design a logic circuit for 4 bit magnitude comparator and explain it,
Solution to Digital Logic -2067 Solution to digital logic 2067 1.)What is the magnitude comparator? Design a logic circuit for 4 bit magnitude comparator and explain it, A Magnitude comparator is a combinational
More informationUNIT III COMBINATIONAL AND SEQUENTIAL CIRCUIT DESIGN
UNIT III COMBINATIONAL AND SEQUENTIAL CIRCUIT DESIGN Part A (2 Marks) 1. What is a BiCMOS? BiCMOS is a type of integrated circuit that uses both bipolar and CMOS technologies. 2. What are the problems
More informationDIGITAL CIRCUIT COMBINATORIAL LOGIC
DIGITAL CIRCUIT COMBINATORIAL LOGIC Logic levels: one zero true false high low CMOS logic levels: 1 => 0.7 V DD 0.4 V DD = noise margin 0 =< 0.3 V DD Positive logic: high = 1 = true low = 0 = false Negative
More informationChapter. Sequential Circuits
Chapter Sequential Circuits Circuits Combinational circuit The output depends only on the input Sequential circuit Has a state The output depends not only on the input but also on the state the circuit
More informationChapter 5 Flip-Flops and Related Devices
Chapter 5 Flip-Flops and Related Devices Chapter 5 Objectives Selected areas covered in this chapter: Constructing/analyzing operation of latch flip-flops made from NAND or NOR gates. Differences of synchronous/asynchronous
More informationDIGITAL SYSTEM FUNDAMENTALS (ECE421) DIGITAL ELECTRONICS FUNDAMENTAL (ECE422) LATCHES and FLIP-FLOPS
COURSE / CODE DIGITAL SYSTEM FUNDAMENTALS (ECE421) DIGITAL ELECTRONICS FUNDAMENTAL (ECE422) LATCHES and FLIP-FLOPS In the same way that logic gates are the building blocks of combinatorial circuits, latches
More informationLogic Design ( Part 3) Sequential Logic- Finite State Machines (Chapter 3)
Logic esign ( Part ) Sequential Logic- Finite State Machines (Chapter ) Based on slides McGraw-Hill Additional material 00/00/006 Lewis/Martin Additional material 008 Roth Additional material 00 Taylor
More informationLab 3 : CMOS Sequential Logic Gates
CARLETON UNIERSITY epartment of Electronics ELEC-3500 igital Electronics September 30, 2005 Lab 3 : CMOS Seuential Logic Gates esign an Specification of Seuential Logic Gates an Librar Cell igital esigns
More informationCSE140L: Components and Design Techniques for Digital Systems Lab. FSMs. Tajana Simunic Rosing. Source: Vahid, Katz
CSE140L: Components and Design Techniques for Digital Systems Lab FSMs Tajana Simunic Rosing Source: Vahid, Katz 1 Flip-flops Hardware Description Languages and Sequential Logic representation of clocks
More informationChapter 7 Sequential Circuits
Chapter 7 Sequential Circuits Jin-Fu Li Advanced Reliable Systems (ARES) Lab. epartment of Electrical Engineering National Central University Jungli, Taiwan Outline Latches & Registers Sequencing Timing
More informationL4: Sequential Building Blocks (Flip-flops, Latches and Registers)
L4: Sequential Building Blocks (Flip-flops, Latches and Registers) Acknowledgements: Lecture material adapted from R. Katz, G. Borriello, Contemporary Logic esign (second edition), Prentice-Hall/Pearson
More informationUNIT 1 NUMBER SYSTEMS AND DIGITAL LOGIC FAMILIES 1. Briefly explain the stream lined method of converting binary to decimal number with example. 2. Give the Gray code for the binary number (111) 2. 3.
More informationClock - key to synchronous systems. Lecture 7. Clocking Strategies in VLSI Systems. Latch vs Flip-Flop. Clock for timing synchronization
Clock - key to synchronous systems Lecture 7 Clocking Strategies in VLSI Systems Peter Cheung Department of Electrical & Electronic Engineering Imperial College London Clocks help the design of FSM where
More informationThe outputs are formed by a combinational logic function of the inputs to the circuit or the values stored in the flip-flops (or both).
1 The outputs are formed by a combinational logic function of the inputs to the circuit or the values stored in the flip-flops (or both). The value that is stored in a flip-flop when the clock pulse occurs
More informationClock - key to synchronous systems. Topic 7. Clocking Strategies in VLSI Systems. Latch vs Flip-Flop. Clock for timing synchronization
Clock - key to synchronous systems Topic 7 Clocking Strategies in VLSI Systems Peter Cheung Department of Electrical & Electronic Engineering Imperial College London Clocks help the design of FSM where
More informationCMOS Latches and Flip-Flops
CMOS Latches and Flip-Flops João Canas Ferreira University of Porto Faculty of Engineering 2016-05-04 Topics 1 General Aspects 2 Circuits based on positive feedback 3 Circuits based on charge storage João
More informationUnit 11. Latches and Flip-Flops
Unit 11 Latches and Flip-Flops 1 Combinational Circuits A combinational circuit consists of logic gates whose outputs, at any time, are determined by combining the values of the inputs. For n input variables,
More informationDIGITAL CIRCUIT LOGIC UNIT 11: SEQUENTIAL CIRCUITS (LATCHES AND FLIP-FLOPS)
DIGITAL CIRCUIT LOGIC UNIT 11: SEQUENTIAL CIRCUITS (LATCHES AND FLIP-FLOPS) 1 iclicker Question 16 What should be the MUX inputs to implement the following function? (4 minutes) f A, B, C = m(0,2,5,6,7)
More informationSequential logic. Circuits with feedback. How to control feedback? Sequential circuits. Timing methodologies. Basic registers
equential logic equential circuits simple circuits with feedback latches edge-triggered flip-flops Timing methodologies cascading flip-flops for proper operation clock skew Basic registers shift registers
More informationCprE 281: Digital Logic
CprE 281: igital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ Registers CprE 281: igital Logic Iowa State University, Ames, IA Copyright Alexander Stoytchev Administrative
More informationSEQUENTIAL LOGIC. Sequential Logic
EUENTIAL LOGIC equential Logic FF s LOGIC t p,comb 2 storage mechanisms positive feedback charge-based Flip-Flop: Timing efinitions t t setup thold ATA TABLE t t pff ATA TABLE t Maximum Clock Frequency
More informationClocking Spring /18/05
ing L06 s 1 Why s and Storage Elements? Inputs Combinational Logic Outputs Want to reuse combinational logic from cycle to cycle L06 s 2 igital Systems Timing Conventions All digital systems need a convention
More informationPGT104 Digital Electronics. PGT104 Digital Electronics
1 Part 5 Latches, Flip-flop and Timers isclaimer: Most of the contents (if not all) are extracted from resources available for igital Fundamentals 10 th Edition 2 Latches A latch is a temporary storage
More informationCHAPTER 4: Logic Circuits
CHAPTER 4: Logic Circuits II. Sequential Circuits Combinational circuits o The outputs depend only on the current input values o It uses only logic gates, decoders, multiplexers, ALUs Sequential circuits
More informationChapter 5: Synchronous Sequential Logic
Chapter 5: Synchronous Sequential Logic NCNU_2016_DD_5_1 Digital systems may contain memory for storing information. Combinational circuits contains no memory elements the outputs depends only on the inputs
More informationD Latch (Transparent Latch)
D Latch (Transparent Latch) -One way to eliminate the undesirable condition of the indeterminate state in the SR latch is to ensure that inputs S and R are never equal to 1 at the same time. This is done
More information55:131 Introduction to VLSI Design Project #1 -- Fall 2009 Counter built from NAND gates, timing Due Date: Friday October 9, 2009.
55:131 Introduction to VLSI Design Project #1 -- Fall 2009 Counter built from NAND gates, timing Due Date: Friday October 9, 2009 Introduction In this project we will create a transistor-level model of
More informationSequential Circuits. Output depends only and immediately on the inputs Have no memory (dependence on past values of the inputs)
Sequential Circuits Combinational circuits Output depends only and immediately on the inputs Have no memory (dependence on past values of the inputs) Sequential circuits Combination circuits with memory
More informationCS8803: Advanced Digital Design for Embedded Hardware
Copyright 2, 23 M Ciletti 75 STORAGE ELEMENTS: R-S LATCH CS883: Advanced igital esign for Embedded Hardware Storage elements are used to store information in a binary format (e.g. state, data, address,
More informationINTRODUCTION TO SEQUENTIAL CIRCUITS
NOTE: Explanation Refer Class Notes Digital Circuits(15EECC203) INTRODUCTION TO SEQUENTIAL CIRCUITS by Nagaraj Vannal, Asst.Professor, School of Electronics Engineering, K.L.E. Technological University,
More informationEMT 125 Digital Electronic Principles I CHAPTER 6 : FLIP-FLOP
EMT 125 Digital Electronic Principles I CHAPTER 6 : FLIP-FLOP 1 Chapter Overview Latches Gated Latches Edge-triggered flip-flops Master-slave flip-flops Flip-flop operating characteristics Flip-flop applications
More informationFundamentals of Computer Systems
Fundamentals of Computer Systems Sequential Logic Stephen A. Edwards Columbia University Summer 2016 State-Holding Elements Bistable Elements S Latch Latch Positive-Edge-Triggered Flip-Flop Flip-Flop with
More informationEEE2135 Digital Logic Design Chapter 6. Latches/Flip-Flops and Registers/Counters 서강대학교 전자공학과
EEE235 Digital Logic Design Chapter 6. Latches/Flip-Flops and Registers/Counters 서강대학교 전자공학과 . Delay and Latches ) Signal Storage a. as voltage level static memory b. as charges dynamic memory 2) Delays
More informationRangkaian Sekuensial. Flip-flop
Rangkaian Sekuensial Rangkaian Sekuensial Flip-flop Combinational versus Sequential Functions Logic functions are categorized as being either combinational (sometimes referred to as combinatorial) or sequential.
More informationMUHAMMAD NAEEM LATIF MCS 3 RD SEMESTER KHANEWAL
1. A stage in a shift register consists of (a) a latch (b) a flip-flop (c) a byte of storage (d) from bits of storage 2. To serially shift a byte of data into a shift register, there must be (a) one click
More informationCprE 281: Digital Logic
CprE 281: igital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ Registers CprE 281: igital Logic Iowa State University, Ames, IA Copyright Alexander Stoytchev Administrative
More informationProject 6: Latches and flip-flops
Project 6: Latches and flip-flops Yuan Ze University epartment of Computer Engineering and Science Copyright by Rung-Bin Lin, 1999 All rights reserved ate out: 06/5/2003 ate due: 06/25/2003 Purpose: This
More informationChapter 6. sequential logic design. This is the beginning of the second part of this course, sequential logic.
Chapter 6. sequential logic design This is the beginning of the second part of this course, sequential logic. equential logic equential circuits simple circuits with feedback latches edge-triggered flip-flops
More informationLearning Outcomes. Unit 13. Sequential Logic BISTABLES, LATCHES, AND FLIP- FLOPS. I understand the difference between levelsensitive
1.1 1. Learning Outcomes Unit 1 I understand the difference between levelsensitive and edge-sensitive I understand how to create an edge-triggered FF from latches Sequential Logic onstructs 1. 1.4 Sequential
More informationMore on Flip-Flops Digital Design and Computer Architecture: ARM Edition 2015 Chapter 3 <98> 98
More on Flip-Flops Digital Design and Computer Architecture: ARM Edition 2015 Chapter 3 98 Review: Bit Storage SR latch S (set) Q R (reset) Level-sensitive SR latch S S1 C R R1 Q D C S R D latch Q
More informationSwitching Circuits & Logic Design
Switching Circuits & Logic Design Jie-Hong oland Jiang 江介宏 Department of Electrical Engineering National Taiwan University Fall 22 Latches and Flip-Flops http://www3.niaid.nih.gov/topics/malaria/lifecycle.htm
More informationEE141-Fall 2010 Digital Integrated Circuits. Announcements. Homework #8 due next Tuesday. Project Phase 3 plan due this Sat.
EE141-Fall 2010 Digital Integrated Circuits Lecture 24 Timing 1 1 Announcements Homework #8 due next Tuesday Project Phase 3 plan due this Sat. Hanh-Phuc s extra office hours shifted next week Tues. 3-4pm
More informationRead-only memory (ROM) Digital logic: ALUs Sequential logic circuits. Don't cares. Bus
Digital logic: ALUs Sequential logic circuits CS207, Fall 2004 October 11, 13, and 15, 2004 1 Read-only memory (ROM) A form of memory Contents fixed when circuit is created n input lines for 2 n addressable
More informationLogic Design. Flip Flops, Registers and Counters
Logic Design Flip Flops, Registers and Counters Introduction Combinational circuits: value of each output depends only on the values of inputs Sequential Circuits: values of outputs depend on inputs and
More informationReview of digital electronics. Storage units Sequential circuits Counters Shifters
Review of digital electronics Storage units Sequential circuits ounters Shifters ounting in Binary A counter can form the same pattern of 0 s and 1 s with logic levels. The first stage in the counter represents
More informationCprE 281: Digital Logic
CprE 281: igital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ Registers CprE 281: igital Logic Iowa State University, Ames, IA Copyright Alexander Stoytchev Administrative
More informationVU Mobile Powered by S NO Group
Question No: 1 ( Marks: 1 ) - Please choose one A 8-bit serial in / parallel out shift register contains the value 8, clock signal(s) will be required to shift the value completely out of the register.
More informationWINTER 14 EXAMINATION
Subject Code: 17320 WINTER 14 EXAMINATION Model Answer Important Instructions to examiners: 1) The answers should be examined by key words and not as word-to-word as given in the model answer scheme. 2)
More informationMUX AND FLIPFLOPS/LATCHES
MUX AN FLIPFLOPS/LATCHES BY: SURESH BALPANE Multiplexers 2:1 multiplexer chooses between two inputs S 1 0 Y 0 X 0 0 0 0 0 X 1 1 1 0 X 0 1 1 X 1 1 1 S Y @BALPANECircuits and Slide 2 Gate-Level Mux esign
More informationECE 250 / CPS 250 Computer Architecture. Basics of Logic Design ALU and Storage Elements
ECE 25 / CPS 25 Computer Architecture Basics of Logic esign ALU and Storage Elements Benjamin Lee Slides based on those from Andrew Hilton (uke), Alvy Lebeck (uke) Benjamin Lee (uke), and Amir Roth (Penn)
More informationCOE 202: Digital Logic Design Sequential Circuits Part 1. Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office:
COE 202: Digital Logic Design Sequential Circuits Part 1 Dr. Ahmad Almulhem Email: ahmadsm AT kfupm Phone: 860-7554 Office: 22-324 Objectives Sequential Circuits Memory Elements Latches Flip-Flops Combinational
More informationCHAPTER 4: Logic Circuits
CHAPTER 4: Logic Circuits II. Sequential Circuits Combinational circuits o The outputs depend only on the current input values o It uses only logic gates, decoders, multiplexers, ALUs Sequential circuits
More informationAnalogue Versus Digital [5 M]
Q.1 a. Analogue Versus Digital [5 M] There are two basic ways of representing the numerical values of the various physical quantities with which we constantly deal in our day-to-day lives. One of the ways,
More information`COEN 312 DIGITAL SYSTEMS DESIGN - LECTURE NOTES Concordia University
`OEN 32 IGITL SYSTEMS ESIGN - LETURE NOTES oncordia University hapter 5: Synchronous Sequential Logic NOTE: For more eamples and detailed description of the material in the lecture notes, please refer
More informationSynchronous Digital Logic Systems. Review of Digital Logic. Philosophy. Combinational Logic. A Full Adder. Combinational Logic
Synchronous igital Logic Systems Review of igital Logic Prof. Stephen. Edwards Raw materials: MOS transistors and wires on Is Wires are excellent conveyors of voltage Little leakage Fast, but not instantaneous
More informationAIM: To study and verify the truth table of logic gates
EXPERIMENT: 1- LOGIC GATES AIM: To study and verify the truth table of logic gates LEARNING OBJECTIVE: Identify various Logic gates and their output. COMPONENTS REQUIRED: KL-31001 Digital Logic Lab( Main
More informationSEQUENTIAL LOGIC. Satish Chandra Assistant Professor Department of Physics P P N College, Kanpur
SEQUENTIAL LOGIC Satish Chandra Assistant Professor Department of Physics P P N College, Kanpur www.satish0402.weebly.com OSCILLATORS Oscillators is an amplifier which derives its input from output. Oscillators
More informationCS8803: Advanced Digital Design for Embedded Hardware
CS883: Advanced Digital Design for Embedded Hardware Lecture 4: Latches, Flip-Flops, and Sequential Circuits Instructor: Sung Kyu Lim (limsk@ece.gatech.edu) Website: http://users.ece.gatech.edu/limsk/course/cs883
More informationDigital Fundamentals 11/2/2017. Summary. Summary. Floyd. Chapter 7. Latches
igital Fundamentals Tenth Edition Floyd hapter 7 2009 Pearson Education, Upper 2008 Pearson Saddle iver, Education N 07458. All ights eserved A latch is a temporary storage device that has two stable states
More informationComputer Architecture and Organization
A-1 Appendix A - Digital Logic Computer Architecture and Organization Miles Murdocca and Vincent Heuring Appendix A Digital Logic A-2 Appendix A - Digital Logic Chapter Contents A.1 Introduction A.2 Combinational
More information12/31/2010. Overview. 12-Latches and Flip Flops Text: Unit 11. Sequential Circuits. Sequential Circuits. Feedback. Feedback
2/3/2 Overview 2-atches and Flip Flops Text: Unit equential Circuits et/eset atch Flip-Flops ECEG/IC 2 igital Operations and Computations Winter 2 r. ouie 2 equential Circuits equential circuits: Output
More informationCHAPTER 1 LATCHES & FLIP-FLOPS
CHAPTER 1 LATCHES & FLIP-FLOPS 1 Outcome After learning this chapter, student should be able to; Recognize the difference between latches and flipflops Analyze the operation of the flip flop Draw the output
More information2.6 Reset Design Strategy
2.6 Reset esign Strategy Many design issues must be considered before choosing a reset strategy for an ASIC design, such as whether to use synchronous or asynchronous resets, will every flipflop receive
More information