Algorithmic state machines

Slides:



Advertisements
Similar presentations
Algorithmic State Machines SD192 Digital Systems Lecture notes July 16, 2004.
Advertisements

Register Transfer Level
1ASM Algorithmic State Machines (ASM) part 1. ASM2 Algorithmic State Machine (ASM) ‏ Our design methodologies do not scale well to real-world problems.
Give qualifications of instructors: DAP
EKT 221 : Digital 2 ASM.
Finite State Machine Chapter 10 RTL Hardware Design by P. Chu.
CS 151 Digital Systems Design Lecture 37 Register Transfer Level
Overview Datapath and Control Algorithmic State Machines (ASM)
Chapter 8 Sequencing and Control Henry Hexmoor1. 2 Datapath versus Control unit  Datapath - performs data transfer and processing operations  Control.
Charles Kime © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 7 – Registers and Register Transfers Part 3 – Control of.
3/20/20091 More State Machines. Multiple processes.
The Control Unit: Sequencing the Processor Control Unit: –provides control signals that activate the various microoperations in the datapath the select.
1 COMP541 Sequencing and Control Montek Singh Mar 29, 2007.
Ch 8 - Control Unit and Algorithmic State Machines
Algorithmic State Machine (ASM) Charts
George Mason University ECE 448 – FPGA and ASIC Design with VHDL Finite State Machines State Diagrams, State Tables, Algorithmic State Machine (ASM) Charts,
1 KU College of Engineering Elec 204: Digital Systems Design Lecture 20 Datapath and Control Datapath - performs data transfer and processing operations.
Chapter 6 Memory and Programmable Logic Devices
Chapter 3 Planning Your Solution
ENG241 Digital Design Week #10 Sequencing and Control.
CoE3DJ4 Digital Systems Design Register transfers, sequencing and control (from chapters 7 and 8 of Mano and Kime)
State Machines.
Algorithmic State Machines.  1) Create an algorithm, using pseudocode, to describe the desired operation of the device. 2) Convert the pseudocode into.
IKI Register-transfer Design
1 KU College of Engineering Elec 204: Digital Systems Design Lecture 21 Multiplier Example Example: (101 x 011) Base 2 Note that the partial product summation.
Chap 8. Sequencing and Control. 8.1 Introduction Binary information in a digital computer –data manipulated in a datapath with ALUs, registers, multiplexers,
Instructor: Yuzhuang Hu Another Design Example: PIG (Chapter 7-10) PIG is a single dice game. Two players roll the dice in turns. When.
George Mason University Design of Controllers Finite State Machines and Algorithmic State Machine (ASM) Charts ECE 545 Lecture 14.
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use ECE/CS 352: Digital Systems.
A Simple Computer Architecture Digital Logic Design Instructor: Kasım Sinan YILDIRIM.
Register Transfer Level & Design with ASM
George Mason University Finite State Machines State Diagrams, State Tables, Algorithmic State Machine (ASM) Charts, and VHDL Code ECE 448 Lecture 6.
EKT 221/4 DIGITAL ELECTRONICS II Chapter 2 SEQUENCING AND CONTROL.
EKT 221 : Chapter 4 Computer Design Basics
Datapath - performs data transfer and processing operations The control unit sends: – Control signals – Control outputs The control unit receives: – External.
Selection Flow Charts If statements. Flow of Control The flow of control is a concept with which we’re already familiar. The concept of control relates.
Hao Zheng Comp Sci & Eng USF CDA 4253 FPGA System Design Chapter 5 Finite State Machines.
GROUP 2 CHAPTER 16 CONTROL UNIT Group Members ๏ Evelio L. Hernandez ๏ Ashwin Soerdien ๏ Andrew Keiper ๏ Hermes Andino.
1 ECE 545 – Introduction to VHDL Algorithmic State Machines Sorting Example ECE 656 Lecture 8.
Chapter 11: System Design Methodology Digital System Designs and Practices Using Verilog HDL and 2008, John Wiley11-1 Chapter 11: System Design.
ECE 448 Lecture 6 Finite State Machines State Diagrams vs. Algorithmic State Machine (ASM) Charts.
Instructor: Alexander Stoytchev CprE 281: Digital Logic.
ECE DIGITAL LOGIC LECTURE 21: FINITE STATE MACHINE Assistant Prof. Fareena Saqib Florida Institute of Technology Fall 2015, 11/24/2015.
ASM Charts. Outline  ASM Charts Components of ASM Charts ASM Charts: An Example  Register Operations  Timing in ASM Charts  ASM Charts => Digital.
1 Basic Processor Architecture. 2 Building Blocks of Processor Systems CPU.
ASM block The state box represents the state in the FSM, and the output in the state box describes the desired output values when the FMS enters this state.
Chapter 20 Computer Operations Computer Studies Today Chapter 20.
 Designing CU – One FF per State Method  5 Transformation Rules  Transformation Process  Microprogrammed Control Unit.
George Mason University Finite State Machines Refresher ECE 545 Lecture 11.
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use ECE/CS 352: Digital Systems.
Figure 8.1. The general form of a sequential circuit.
ECE 448 Lecture 6 Finite State Machines State Diagrams, State Tables, Algorithmic State Machine (ASM) Charts, and VHDL Code.
ECE 448 Lecture 6 Finite State Machines State Diagrams vs. Algorithmic State Machine (ASM) Charts.
Microsoft Visual Basic 2005 BASICS
KU College of Engineering Elec 204: Digital Systems Design
Instruction cycle Instruction: A command given to the microprocessor to perform an operation Program : A set of instructions given in a sequential.
Overview Datapath and Control Algorithmic State Machines (ASM)
Iterative Versus Sequential Circuits
Table 8.1 Verilog 2001 HDL Operators
Instructor: Alexander Stoytchev
ECE 545 Lecture 12 Design of Controllers Finite State Machines and Algorithmic State Machine (ASM) Charts.
Lecture 26 – Hardwired and Microprogrammed Control
Instructor: Alexander Stoytchev
REGISTER TRANSFER LEVEL (RTL) DESIGN Using ASM CHART
Chapter 14 Control Unit Operation
KU College of Engineering Elec 204: Digital Systems Design
ASM and Micro-programmed State Machines
ECE 448 Lecture 6 Finite State Machines State Diagrams, State Tables, Algorithmic State Machine (ASM) Charts, and VHDL Code.
ECE 448 Lecture 6 Finite State Machines State Diagrams, State Tables, Algorithmic State Machine (ASM) Charts, and VHDL code ECE 448 – FPGA and ASIC Design.
ECE 448 Lecture 6 Finite State Machines State Diagrams vs. Algorithmic State Machine (ASM) Charts.
Presentation transcript:

Algorithmic state machines DSD Using Verilog

Overview Datapath and Control Algorithmic State Machines (ASM) ASM chart Timing considerations

Datapath and Control Datapath - performs data transfer and processing operations Control Unit - Determines the enabling and sequencing of the operations The control unit receives: External control inputs Status signals Control inputs Data outputs Datapath Control signals Status signals unit Describe properties of the state of the datapath The control unit sends: Control signals Control outputs

Control Unit Types Two distinct classes: Programmable Non-programmable. A programmable control unit has: A program counter (PC) or other sequencing register with contents that points to the next instruction to be executed An external ROM or RAM array for storing instructions and control information Decision logic for determining the sequence of operations and logic to interpret the instructions A non-programmable control units does not fetch instructions from a memory and is not responsible for sequencing instructions This type of control unit is our focus in this chapter

Algorithmic State Machines The function of a state machine (or sequential circuit) can be represented by a state table or a state diagram. A flowchart is a way of showing actions and control flow in an algorithm. An Algorithmic State Machine (ASM) is simply a flowchart-like way to specify state diagrams for sequential logic and, optionally, actions performed in a datapath. While flowcharts typically do not specify “time”, an ASM explicitly specifies a sequence of actions and their timing relationships.

ASM Primitives State Box (a rectangle) Scalar Decision Box (a diamond) Vector Decision Box (a hexagon) Conditional Output Box (oval). The State Box is a rectangle, marked with the symbolic state name, containing register transfers and output signals activated when the control unit is in the state. The Scalar Decision Box is a diamond that describes the effects of a specific input condition on the control. It has one input path and two exit paths, one for TRUE (1) and one for FALSE (0). The Vector Decision Box is a hexagon that describes the effects of a specific n-bit (n > 2) vector of input conditions on the control. It has one input path and up to 2n exit paths, each corresponding to a binary vector value. The Conditional Output Box is an oval with entry from a decision block and outputs activated for the decision conditions being satisfied.

State Box A rectangle with: The symbolic name for the state marked outside the upper left top Containing register transfer operations and outputs activated within or while leaving the state An optional state code, if assigned, outside the upper right top (Symbolic Name) (Optional state code) IDLE 0000 (Register transfers or outputs) R ← 0 RUN

Scalar Decision Box A diamond with: One input path (entry point). One input condition, placed in the center of the box, that is tested. A TRUE exit path taken if the condition is true (logic 1). A FALSE exit path taken if the condition is false (logic 0). (False Condition) (True Condition) (Input) 1 START

Vector Decision Box A hexagon with: One Input Path (entry point). A vector of input conditions, placed in the center of the box, that is tested. Up to 2n output paths. The path taken has a binary vector value that matches the vector input condition (Vector of Input Conditions) (Binary Vector Values) 00 01 10 Z, Q0

Conditional Output Box An oval with: One input path from a decision box or decision boxes. One output path Register transfers or outputs that occur only if the conditional path to the box is taken. Transfers and outputs in a state box are Moore type - dependent only on state Transfers and outputs in a conditional output box are Mealy type - dependent on both state and inputs From Decision Box(es) (Register transfers or outputs) R ← 0 RUN

Connecting Boxes Together By connecting boxes together, we begin to see the power of expression. What are the: Inputs? Outputs? Conditional Outputs? Transfers? Conditional Transfers? IDLE R← 0 START 1 PC ← 0 AVAIL INIT

ASM Blocks IDLE AVAIL START R← R + 1 R ← 0 Q0 1 MUL0 MUL1 ASM BLOCK Entry Exit One state box along with all decision and conditional output boxes connected to it is called an ASM Block. The ASM Block includes all items on the path from the current state to the same or other states.

ASM Timing Outputs appear while in the state Register transfers occur at the clock while exiting the state - New value occur in the next state! Clock cycle 1 Clock cycle 2 Clock cycle 3 Clock START Q 1 AVAIL IDLE MUL 1 0034 0000 State A