Motivation Combinational logic functions can be represented, and defined, by truth tables. Sequential logic function cannot, because their behavior depends.

Slides:

Advertisements

Similar presentations

ENGIN112 L23: Finite State Machine Design Procedure October 27, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 23 Finite State Machine.

Advertisements

Introduction to Sequential Circuits

1 CSULB -- CECS 201 – A Primer for FSM’s © 2014 R.W. Allison.

Finite State Machines (FSMs)

CS1Q Computer Systems Lecture 12 Simon Gay. Lecture 12CS1Q Computer Systems - Simon Gay 2 Design of Sequential Circuits The systematic design of sequential.

1 Combinational Logic Design&Analysis. 2 Introduction We have learned all the prerequisite material: – Truth tables and Boolean expressions describe functions.

TOPIC : Finite State Machine(FSM) and Flow Tables UNIT 1 : Modeling Module 1.4 : Modeling Sequential circuits.

Give qualifications of instructors: DAP

Circuits require memory to store intermediate data

Chapter 3 Digital Logic Structures

FSMs 1 Computer Organization I September 2009 © McQuain, Feng & Ribbens Motivation Combinational logic functions can be represented, and defined,

CS 151 Digital Systems Design Lecture 37 Register Transfer Level

ECE 301 – Digital Electronics Circuit Design and Analysis (Lecture #9A) The slides included herein were taken from the materials accompanying Fundamentals.

Basic Register A register is a sequential component that can store multiple bits.

Give qualifications of instructors: DAP

CSCE 211: Digital Logic Design

11/10/2004EE 42 fall 2004 lecture 301 Lecture #30 Finite State Machines Last lecture: –CMOS fabrication –Clocked and latched circuits This lecture: –Finite.

State Machines Used to Design Sequential Circuits.

ECE 301 – Digital Electronics Introduction to Sequential Logic Circuits (aka. Finite State Machines) and FSM Analysis (Lecture #17)

ECE 331 – Digital Systems Design Introduction to Sequential Logic Circuits (aka. Finite State Machines) and FSM Analysis (Lecture #19)

CSCI 3301 Transparency No. 9-1 Chapter #9: Finite State Machine Optimization Contemporary Logic Design.

Midterm Wednesday Chapter 1-3: Number /character representation and conversion Number arithmetic CMOS logic elements Combinational logic elements and design.

Lecture 10 Topics: Sequential circuits Basic concepts Clocks

Elevator Controller We’re hired to design a digital elevator controller for a four-floor building st try: Design a counter that counts up.

CSCE 211: Digital Logic Design Chin-Tser Huang University of South Carolina.

OCR GCSE Computing © Hodder Education 2013 Slide 1 OCR GCSE Computing Chapter 2: Binary Logic.

Finite State Machines (FSMs) and RAMs and inner workings of CPUs COS 116, Spring 2010 Guest: Szymon Rusinkiewicz.

16. Binary Numbers Programming in C++ Computer Science Dept Va Tech August, 1999 © Barnette ND, McQuain WD, Keenan MA 1 Binary Number System Base.

CPS3340 COMPUTER ARCHITECTURE Fall Semester, /05/2013 Lecture 4: Basics of Logic Design Instructor: Ashraf Yaseen DEPARTMENT OF MATH & COMPUTER.

Exclusive OR Gate. Logically, the exclusive OR (XOR) operation can be seen as either of the following operations:exclusive OR (XOR) 1. A AND NOT B OR.

Unit 13 Analysis of Clocked Sequential Circuits Ku-Yaw Chang Assistant Professor, Department of Computer Science and Information.

ECE 331 – Digital System Design Circuit Design and Analysis (Lecture #9A) The slides included herein were taken from the materials accompanying Fundamentals.

Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Complete Example.

DLD Lecture 26 Finite State Machine Design Procedure.

1. Introduction Intro Programming in C++ Computer Science Dept Va Tech August, 2002 © Barnette ND & McQuain WD 1 Algorithm:a finite set of instructions.

1 ENGG 1015 Tutorial Three Examples of Finite State Machines Supplementary notes Learning Objectives  Learn about Design of Finite State Machines Ack.:

Gates & Logic Computer Organization I 1 August 2009 © McQuain, Feng & Ribbens Logic Design Goal:to become literate in most common concepts.

Digital System Design using VHDL

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.

COMPUTER ARCHITECTURE & OPERATIONS I Instructor: Yaohang Li.

Finite State Machine. Clock Clock cycle Sequential circuit Digital logic systems can be classified as combinational or sequential. – Combinational circuits.

Logic Design (CE1111 ) Lecture 6 (Chapter 6) Registers &Counters Prepared by Dr. Lamiaa Elshenawy 1.

Chapter 3 Boolean Algebra and Digital Logic T103: Computer architecture, logic and information processing.

Lecture 1 Gunjeet kaur Dronacharya group of institutions.

1 Lecture 13: Sequential Circuits, FSM Today’s topics:  Sequential circuits  Finite state machines  Single-cycle CPU Reminder: midterm on Tue 10/20.

The Stored Program Computer

Hardware Verification

Sequential logic design principles

Motivation Combinational logic functions can be represented, and defined, by truth tables. Sequential logic function cannot, because their behavior depends.

Introduction CPU performance factors

Exclusive OR Gate.

Boolean Algebra A Boolean algebra is a set B of values together with:

Simple Processor Control Unit

Assistant Prof. Fareena Saqib Florida Institute of Technology

FINITE STATE MACHINES (FSMs)

Lecture 13: Sequential Circuits, FSM

Lecture 13: Sequential Circuits, FSM

CSE 370 – Winter Sequential Logic-2 - 1

CSE 370 – Winter Sequential Logic - 1

Lecture 17 Logistics Last lecture Today HW5 due on Wednesday

Guest Lecture by David Johnston

Combinational Circuits

Basic MIPS Implementation

Lecture 17 Logistics Last lecture Today HW5 due on Wednesday

EGR 2131 Unit 12 Synchronous Sequential Circuits

Lecture 4 Sequential units. Registers

Clocks A clock is a free-running signal with a cycle time.

Computer System.

Presentation transcript:

Motivation Combinational logic functions can be represented, and defined, by truth tables. Sequential logic function cannot, because their behavior depends upon both the state of their inputs and their current state. Implementing the control logic for a CPU will require using sequential logic functions, and we need a tool to express and model those functions mathematically. Computer Science Dept Va Tech January 2006 ©2006 McQuain WD

Finite State Machine A finite state machine (FSM) is… - a finite set of states Q = {S0, S1, . . . , SN}, and - a set of possible input values I = {i0, i1, . . . , iK}, and - a set of possible output values O = {o0, o1, . . . , oM}, and - a next state function F:QxIS, and - an output function G:QxIO The next state function maps the current inputs and the current state the next state of the FSM. The output function maps the current state and possibly the current inputs to a set of asserted outputs. Computer Science Dept Va Tech January 2006 ©2006 McQuain WD

Example Here's a simple FSM representing a basic digital function. We have: Q = {E, O} I = {0, 1, end} O = {'E', 'O'} What's the next state function? What does it DO? E O start halt 1 end/E end/O Computer Science Dept Va Tech January 2006 ©2006 McQuain WD

Example: Parity Checker Here's an application of the FSM from the previous slide: Here's the next-state function for the previous slide. Here's a bit-chucker to pass the bits to the next-state function. Here's the memory element to store the current state. Here's a counter to disable changes after 8 ticks Computer Science Dept Va Tech January 2006 ©2006 McQuain WD

Relationship to Hardware Common design issues in hardware control can be efficiently represented and analyzed using FSMs. Computer Science Dept Va Tech January 2006 ©2006 McQuain WD