1 Sequential Digital Circuits Alexander Titov 11 October 2014.

Slides:



Advertisements
Similar presentations
Prith Banerjee ECE C03 Advanced Digital Design Spring 1998
Advertisements

Introduction to Sequential Logic Design Latches. 2 Terminology A bistable memory device is the generic term for the elements we are studying. Latches.
1 Lecture 14 Memory storage elements  Latches  Flip-flops State Diagrams.
Give qualifications of instructors: DAP
Computer Science 210 Computer Organization Clocks and Memory Elements.
Latches CS370 –Spring 2003 Section 4-2 Mano & Kime.
CENG 241 Digital Design 1 Lecture 8 Amirali Baniasadi
CS 151 Digital Systems Design Lecture 19 Sequential Circuits: Latches.
CPS3340 COMPUTER ARCHITECTURE Fall Semester, /23/2013 Lecture 7: Computer Clock & Memory Elements Instructor: Ashraf Yaseen DEPARTMENT OF MATH &
Sequential Circuits1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
Digital Logic Circuits (Part 2) Computer Architecture Computer Architecture.
Digital Logic Design Brief introduction to Sequential Circuits and Latches.
+ CS 325: CS Hardware and Software Organization and Architecture Sequential Circuits 1.
CS 300 – Lecture 3 Intro to Computer Architecture / Assembly Language Sequential Circuits.
Overview Finite State Machines - Sequential circuits with inputs and outputs State Diagrams - An abstraction tool to visualize and analyze sequential circuits.
Overview Memory definitions Random Access Memory (RAM)
Chapter 3 Continued Logic Gates Logic Chips Combinational Logic Sequential Logic Flip Flops Registers Memory Timing State Machines.
Overview Logic Combinational Logic Sequential Logic Storage Devices SR Flip-Flops D Flip Flops JK Flip Flops Registers Addressing Computer Memory.
Overview Recall Combinational Logic Sequential Logic Storage Devices
Lecture 4: Computer Memory
CS 151 Digital Systems Design Lecture 20 Sequential Circuits: Flip flops.
Chapter Five The Processor: Datapath and Control.
COMPUTER ARCHITECTURE & OPERATIONS I Instructor: Hao Ji.
Fall 2007 L16: Memory Elements LECTURE 16: Clocks Sequential circuit design The basic memory element: a latch Flip Flops.
1 CSE370, Lecture 14 Lecture 14 u Logistics n Midterm 1: Average 90/100. Well done! n Midterm solutions online n HW5 due date delayed until this Friday.
1 Layers of Computer Science, ISA and uArch Alexander Titov 20 September 2014.
Some Useful Circuits Lecture for CPSC 5155 Edward Bosworth, Ph.D. Computer Science Department Columbus State University.
Sequential Logic. Logic Styles Combinational circuits – Output determined solely by inputs – Can draw solely with left-to-right signal paths.
1 Integrated Circuits Basics Titov Alexander 25 October 2014.
Introduction to Computer Engineering ECE/CS 252, Fall 2010 Prof. Mikko Lipasti Department of Electrical and Computer Engineering University of Wisconsin.
Lec 3bSystems Architecture1 Systems Architecture Lecture 3b: Review of Sequential Logic Circuits Jeremy R. Johnson Anatole D. Ruslanov William M. Mongan.
Computer Architecture Lecture 4 Sequential Circuits Ralph Grishman September 2015 NYU.
1 Instruction Set Architecture (ISA) Alexander Titov 10/20/2012.
Chapter 3 Digital Logic Structures. 3-2 Combinational vs. Sequential Combinational Circuit always gives the same output for a given set of inputs  ex:
Registers Page 1. Page 2 What is a Register?  A Register is a collection of flip-flops with some common function or characteristic  Control signals.
SEQUENTIAL LOGIC By Tom Fitch. Types of Circuits Combinational: Gates Combinational: Gates Sequential: Flip-Flops Sequential: Flip-Flops.
CPS3340 COMPUTER ARCHITECTURE Fall Semester, /3/2013 Lecture 9: Memory Unit Instructor: Ashraf Yaseen DEPARTMENT OF MATH & COMPUTER SCIENCE CENTRAL.
Logic Design CS221 1 st Term Storage (memory) Cairo University Faculty of Computers and Information.
Feb. 26, 2001Systems Architecture I1 Systems Architecture I (CS ) Lecture 12: State Elements, Registers, and Memory * Jeremy R. Johnson Mon. Feb.
1 Combinational Circuits Alexander Titov 10/27/2012.
Logic Design / Processor and Control Units Tony Diep.
CEC 220 Digital Circuit Design Latches and Flip-Flops Monday, March 03 CEC 220 Digital Circuit Design Slide 1 of 19.
Synchronous Sequential Logic A digital system has combinational logic as well as sequential logic. The latter includes storage elements. feedback path.
Chapter 6 – Digital Electronics – Part 1 1.D (Data) Flip Flops 2.RS (Set-Reset) Flip Flops 3.T Flip Flops 4.JK Flip Flops 5.JKMS Flip Flops Information.
Lecture 5. Sequential Logic 1 Prof. Taeweon Suh Computer Science Education Korea University 2010 R&E Computer System Education & Research.
CO5023 Latches, Flip-Flops and Decoders. Sequential Circuit What does this do? The OUTPUT of a sequential circuit is determined by the current output.
1 KU College of Engineering Elec 204: Digital Systems Design Lecture 22 Memory Definitions Memory ─ A collection of storage cells together with the necessary.
How does the CPU work? CPU’s program counter (PC) register has address i of the first instruction Control circuits “fetch” the contents of the location.
Sequential Logic Flip-Flop Circuits By Dylan Smeder.
07/11/2005 Register File Design and Memory Design Presentation E CSE : Introduction to Computer Architecture Slides by Gojko Babić.
Lecture 23: 11/26/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.
CENG 241 Digital Design 1 Lecture 7 Amirali Baniasadi
ECE 301 – Digital Electronics Brief introduction to Sequential Circuits and Latches (Lecture #14)
ECE 331 – Digital System Design Introduction to Sequential Circuits and Latches (Lecture #16)
ECE Fall G. Byrd1 Register A register stores a multi-bit value. We use a collection of D-latches, all controlled by a common WE. When WE=1,
Computer Science 210 Computer Organization
Lecture 3. Lateches, Flip Flops, and Memory
Computer Architecture & Operations I
Class Exercise 1B.
Morgan Kaufmann Publishers
Computer Science 210 Computer Organization
COSC 2021: Computer Organization Instructor: Dr. Amir Asif
Jeremy R. Johnson Mon. Apr. 3, 2000
Computer Science 210 Computer Organization
How does the CPU work? CPU’s program counter (PC) register has address i of the first instruction Control circuits “fetch” the contents of the location.
CSE 370 – Winter Sequential Logic - 1
The Processor Lecture 3.1: Introduction & Logic Design Conventions
Sequential Logic.
Systems Architecture I
(Sequential-Circuit Building Blocks)
Presentation transcript:

1 Sequential Digital Circuits Alexander Titov 11 October 2014

2 Intel Laboratory at Moscow Institute of Physics and Technology MIPT-MIPS 2014 Project Layers of Abstraction in Computes Science (CS) Application Algorithms Programming Language Operating System Instruction Set Architecture Microarchitecture Gates/Register-Transfer Level (RTL) Circuits Physics Topics of this lecture

3 Intel Laboratory at Moscow Institute of Physics and Technology MIPT-MIPS 2014 Project But, combinational circuits have a significant limitation: they cannot remember any information Refresher: Combinational vs. Sequential Circuits If the output of a function is completely defined by the current input then the function is called combinational: Q t = F(x t, y t, z t, …) Combinational circuit (scheme) is an implementation of a combinational function A lot of things can be implemented using combinational circuits Just a few examples that we already know: summator, decoder, multiplexer But, combinational circuits have a significant limitation:

4 Intel Laboratory at Moscow Institute of Physics and Technology MIPT-MIPS 2014 Project Sequential Circuits Sequential circuits are able to store information If the output of a function depends not only on the current input, but on the previous state, then the function is called sequential Q t = F(x t, y t, z t, …, Q t-1 ) F(x t-1, y t-1, z t-1, …, Q t- 2 )) F(x t-2, y t-2, z t-2, …, Q t- 3 ))) Sequential circuit is an implementation of a sequential function Their main advantage is ability to remember the previous state Any circuit with memory is a sequential circuits

5 Intel Laboratory at Moscow Institute of Physics and Technology MIPT-MIPS 2014 Project SR Flip-Flop SRQ t-1 Qt xyout Q !Q x y out y ≡ x y 0 ≡ Q !Q reset set NOR: SR flip-flop: o The simplest store element: o SR flip-flop: QQ 01Q0 10Q1 11Q0 reset set Q !Q Prohibited state

6 Intel Laboratory at Moscow Institute of Physics and Technology MIPT-MIPS 2014 Project SR Flip-Flop reset set Q !Q R S Q SRQ t-1 Qt 00QQ 01Q0 10Q1 11Q0 S 0 1 R 0 1 Q 0 1 !Q 0 1 ? ? But, which signal will be really faster will depend on many factors (e.g., temperature). The output will be determined by the fastest signal

7 Intel Laboratory at Moscow Institute of Physics and Technology MIPT-MIPS 2014 Project D Flip-Flop Don’t have prohibited states Asserted by a level of the write enable signal (we) Store one bit of information Can be used as building block for creating static memory arrays S QR !Q Write enable Data D we Q D Q t-1 Qt D0QQ 01Q0 11Q1

8 Intel Laboratory at Moscow Institute of Physics and Technology MIPT-MIPS 2014 Project Trigger asserted by edge Don’t open for writing neither at we =0 nor at we =1 as one of the triggers is closed It is open for a very small amount of time when the write enable goes from 0 to 1 The value from the first trigger is written to the second trigger and then the first trigger is closed It is a trigger asserted by the positive edge of write enable signal Such types of triggers are mostly used to organize pipelined execution D we Q D Q out Write enable Data DweQ t-1 Qt D Q we D0QQ D1QQ D ↑ QD D ↓ QQ

9 Intel Laboratory at Moscow Institute of Physics and Technology MIPT-MIPS 2014 Project Single port 2^MxN Memory Array Memory Array address input data output data M N N Write enable

10 Intel Laboratory at Moscow Institute of Physics and Technology MIPT-MIPS 2014 Project Single port 4x1 Memory Array Memory Array address input data output data Write enable

11 Intel Laboratory at Moscow Institute of Physics and Technology MIPT-MIPS 2014 Project Single port 4x1 Memory Array Multiplexer Decoder Write control

12 Intel Laboratory at Moscow Institute of Physics and Technology MIPT-MIPS 2014 Project Single port 4x2 Memory Array Multiplexer bit[0] Decoder Write control Multiplexer bit[1]

Critical paths 13

14 Intel Laboratory at Moscow Institute of Physics and Technology MIPT-MIPS 2014 Project What is a critical path of scheme? Critical path is the slowest logic path in the circuit Reliable result of whole logic path can not be ready until critical path is passed by signal

15 Intel Laboratory at Moscow Institute of Physics and Technology MIPT-MIPS 2014 Project Example of critical path finding: Multiplexer

Thank You Q/A 16