University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Science
|
|
- Aleesha Townsend
- 5 years ago
- Views:
Transcription
1 University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Science EECS 150 Fall 2005 R. H. Katz Problem Set # 5 (Assigned 5 October, Due 14 October) SOLUTIONS 1. Consider the design of an elevator controller. The building has three floors, an up button on the first floor, up and down buttons on the second floor, a down button on the third floor, and three buttons inside the elevator indicating the floor to go to. Note that more than one button inside the elevator may have been pressed and active at the same time. While you can make assumptions, the behavior of the system must be reasonable. For example, pressing the Floor 2 button with the elevator on the second floor causes the elevator to remain there with its door open. Also if the elevator is moving from the second to the third floor, pressing the first floor button inside the elevator should have no effect. (a) Identify your inputs, outputs, and name and describe your states. What additional circuitry, like timers, flip-flops, comparators, etc., do you need outside of the state machine? One possible solution Inputs: Outputs: F1, F2, F3 (Buttons inside the elevator) 1U, 2U, 2D, 3D (Buttons on each floor) AF1, AF2, AF3 (Sensors to tell when Elevator Arrives at Floor) Open (Whether door is open or closed) For a complex system, timers could be used to wait a few seconds before the door closes after user selects the floor. Registers can be used to store the floor selection of the passenger if multiple floors were selected. S_F1: S_MF1: At Floor One, Open Door. Wait for user to press selection. In Transit to Floor 1. Door closed. Wait for arrival at selected floor via AF1 (Arrival at F1)
2 Draw a symbolic state diagram for your design, labeling all state transitions. F1 AF1 At F1 Open F2 2U 2D Moving to F1 Close F2 2U 2D Moving to F2 Close F1 1U F3 3D AF2 F3 At F3 Open F1 1U At F2 Open F2 AF3 Moving to F3 Close F3 3D (b) Write sketch Verilog code for a Moore Machine implementation of this state diagram. (*) begin NS = CS; Case (CS) S_F1: begin If (F2 2U 2D) NS = S_MF2; If(F3 3D) NS = S_MF3; S_F2: S_F3: begin If(F1 1U) NS = S_MF1; If(F3 3D) NS = S_MF3; begin If(F1 1U) NS = S_MF1;
3 If (F2 2U 2D) NS = S_MF2; S_MF1: begin If (AF1) NS = S_F1; S_MF2: begin If (AF2) NS=S_F2; case S_MF3: begin If (AF3) NS=S_F3; (posedge clk) begin If (Reset) CS<=S_F1; Else CS<=NS; Assign Door_Open = (CS==S_F1) (CS==S_F2) (CS==S_F3); 2. Consider the following variation on the traffic light controller problem. A North-South road intersects an East-West road. In addition to the Red/Yellow/Green traffic lights, the N-S road has green left-turn arrows. The arrows work as follows. With the traffic lights red in all direction, the N-S left turn arrows are illuminated Green. Then they turn yellow and finally they turn red. At this point, the N-S lights cycle Green/Yellow/Red. In the N-S direction, the Green Arrow time is 16 seconds and the Yellow Arrow time is 8 s. Overlapping with this is Red light time, which is 88 s. The Green light time is 24 s and the Yellow light time is 8 s. The Red Arrow time is what is left after the other arrows have been illuminated within the N-S cycle. The E-W lights are: Red 56 s, Green 56 s, and Yellow 8 s. (a) Draw a simple timing chart that shows the behavior of the N-S and E-W traffic lights and the Left Turn Arrow lights.
4 (b) Identify your inputs and outputs. What additional circuitry, like timers and flip-flops, do you need outside of the state machine? Input: Timer Output: NS_R, NS_Y, NS_G, EW_R, EW_Y, EW_G, L_R, L_Y, L_G (Signal for Each Light) Need a timer to keep track of the elapsed time. The timer is formed with a counter with a one second clock. A comparator is then used to check the timer against the time for each state. (c) Draw a symbolic state diagram. Make clear your assumptions, consistent with the specification above. (d) Write sketch Verilog code for a Moore Machine implementation of this state diagram. (*) begin NS = CS; Case (CS) Timer_Reset = 1 b0;
5 NS = CS; ArrowG: begin if (Timer==16) begin NS = ArrowY; ArrowY: begin if (Timer==8) begin NS = EW_G; EW_G: begin if (Timer==56) begin NS = EW_Y; EW_Y: begin if (Timer==8) begin NS = NS_G; NS_G: begin if (Timer==24) begin NS = NS_Y; NS_Y: begin if (Timer==8) begin NS = ArrowG; end Case (posedge clk) begin If (Reset) CS<=S_F1; Else CS<=NS; Assign Arrow_Green = (CS==ArrowG); Assign Arrow_Yellow = (CS==ArrowY); Assign Arrow_Red = ~(ArrowY ArrowG);
6 Assign NS_Green = (CS==NS_G); Assign NS_Yellow = (CS==NS_Y); Assign NS_Red = ~(NS_Green NS_Yellow); Assign EW_Green = (CS==EW_G); Assign EW_Yellow = (CS==EW_Y); Assign EW_Red = ~(EW_Green EW_Yellow); 3. Professor Katz has a complicated washing machine at home. It can advance through the following states in the following sequence: Extra Prewash, Prewash, Main Wash 1, Main Wash 2, Rinse 1, Rinse 2, Rinse 3, Starch, Rinse Hold, Graduated Spin, and Spin. The user selectively positions a dial to Extra Prewash, Prewash, or Main Wash 1 to indicate the initial state for the wash. When the Start button is pressed, the cycle begins in the selected initial state. The machine has a program control to indicate the kind of fabrics being washed: Cotton Normal, Cotton Short, Permanent Press Normal, Permanent Press Short, Delicates Normal, Delicates Short, and Woolens. Normal cotton and permanent press programs cycle through every state following the initial state. Short cotton and permanent press programs and the Delicates Normal program pass through Main Wash 1, skip Main Wash 2, enter Rinse 1 and 2, and skip Rinse 3. Delicates Short and Woolens are similar but also skip the second rinse. Finally if the Short Spin/Rinse Hold button is depressed, the program holds in the Rinse Hold state until the button is released, and then advances directly to Spin skipping the Graduated Spin. (a) Identify your inputs, outputs, and name and describe your states. What additional circuitry, like timers and flip-flops, do you need outside of the state machine? Inputs: Outputs: ExtraPrewash, Prewash, MainWash1, Start, Hold CN, CS, PPN, PPS, DN, DS, W (Type of Material) State Machine In Need a timer that signals the end of the current cycle. (b) Draw a symbolic state diagram for your design, labeling all state transitions. Indicate any additional assumptions you are making.
7 Start & MainWash1 / MainWash1 Initial Start & Extra Prewash / ExtraPrewash Start & Prewash / Prewash Timer & (CN PPN) / MainWash2 Timer & (CN PPN) / MainWash1 Timer & (CN PPN ) / Prewash Timer & (CS PPS DDN) / Rinse1 Timer & (CS PPS DDN) / Rinse1 4 Timer / Rinse 1 5 Timer & (DS W) / Rinse1 Timer & (CS PPS DDN) / Rinse2 Timer & (CN PPN) / Rinse 2 6 Timer & (DS W) / Rinse1 Timer / Idle Timer / Starch 7 Hold & Timer / Rinse Hold ~Hold & Timer / Rinse Hold 8 11 Timer / Graduated Spin ~Hold / Spin 9 10 Timer / Spin (c) Write sketch Verilog code for a Mealy Machine implementation of this state diagram. (*) Begin CS = NS; Case (CS) Initial:
8 If (Start) begin If (ExtraPrewash) begin NS = 1; State = ExtraPrewash If (Prewash) begin NS = 2; State = Prewash; If (MainWash1) begin NS = 3; State = MainWash1; 1: if (Timer) begin If (CN PPN) begin NS = 2; State = Prewash; If (CS PPS DDN) begin NS = 5; If (DS W) begin NS = 7; 2: if (Timer) begin If (CN PPN) begin NS = 3; State = MainWash1; If (CS PPS DDN) begin NS = 5; If (DS W) begin NS = 7; 3: If (Timer && (CN PPN) begin NS = 4; State = MainWash2; 4: If (Timer) begin NS = 5; 5: If (Timer) begin If (CN PPN) begin NS = 6; State = Rinse2; If (CS PPS DDN) begin
9 NS = 7; State = Rinse2; 6: If (Timer) begin NS = 7; State = Starch; 7: If (~Hold && Timer) begin NS = 8 State = RinseHold; If (Hold && Timer) begin NS = 11; State = RinseHold; 8: If (Timer) begin NS = 9 State = GraduatedSpin; 9: If (Timer) begin NS = 10; State = Spin; 10: If (Timer) begin NS = Initial; State = Idle; 11: If (~Hold) begin NS = 10 State = Spin; Case
EE 231 Fall EE 231 Homework 8 Due October 20, 2010
EE 231 Homework 8 Due October 20, 20 1. Consider the circuit below. It has three inputs (x and clock), and one output (z). At reset, the circuit starts with the outputs of all flip-flops at 0. x z J Q
More informationB.10 Finite State Machines B.10
B.10 Finite State Machines B-67 128-bit word needs 8. This type of code is called a Hamming code, after R. Hamming, who described a method for creating such codes. B.10 Finite State Machines B.10 As we
More informationXSver: Sequential Verilog Examples
XSver 1 XSver: Sequential Verilog Examples Early digital designers and many designers through the 1980s wrote out state tables by hand and built corresponding circuits using the synthesis methods that
More informationMealy and Moore examples
CSE 37 Spring 26 Introduction to igital esign ecture 2: uential ogic Technologies ast ecture Moore and Mealy Machines Today uential logic technologies Ving machine: Moore to synch. Mealy OPEN = creates
More informationCSE140L: Components and Design Techniques for Digital Systems Lab. FSMs. Instructor: Mohsen Imani. Slides from Tajana Simunic Rosing
CSE4L: Components and Design Techniques for Digital Systems La FSMs Instructor: Mohsen Imani Slides from Tajana Simunic Rosing Source: Vahid, Katz Flip-flops Hardware Description Languages and Sequential
More informationIntroduction to Verilog and ModelSim. (Part 6 State Machines)
Introduction to Verilog and ModelSim (Part 6 State Machines) State Machine Actually, a Finite State Machine (FSM) mathematical model of computation abstract machine with finite states can only be in ONE
More informationStamp Gives the Green Light To Efficient Programming
Column #26, April 1997 by Scott Edwards: Stamp Gives the Green Light To Efficient Programming THE ELECTRONICS Q&A column here in N&V is an amazing resource. Q&A editor T. J. Byers will go to any length
More informationModeling of Finite State Machines. Debdeep Mukhopadhyay
Modeling of Finite State Machines Debdeep Mukhopadhyay Definition 5 Tuple: (Q,Σ,δ,q 0,F) Q: Finite set of states Σ: Finite set of alphabets δ: Transition function QχΣ Q q 0 is the start state F is a set
More informationFinite-State Machine (FSM) Design
1 Finite-State Machine (FSM) Design FSMs, an important category of sequential circuits, are used frequently in designing digital systems. From the daily used electronic machines to the complex digital
More informationRealDigital. Problem Set #7 S1 S2 S3 Y Z X Y + Y Z X Z
Problem Set #7 RealDigital 1. (10 points) Modify the state diagram branching conditions in the diagrams below as needed to ensure the sum and exclusion rules are obeyed in each case. You can add a holding
More informationproblem maximum score 1 10pts 2 8pts 3 10pts 4 12pts 5 7pts 6 7pts 7 7pts 8 17pts 9 22pts total 100pts
University of California at Berkeley College of Engineering epartment of Electrical Engineering and Computer Sciences EECS150 J. Wawrzynek Spring 2003 2/21/03 Exam I Solutions Name: I number: This is a
More informationGeneral FSM design procedure
Sequential logic examples Basic design approach: a 4-step design process Hardware description languages and finite state machines Implementation examples and case studies finite-string pattern recognizer
More informationAn Implementation of Automatic Washing Machine Control System Using Verilog HDL
An Implementation of Automatic Washing Machine Control System Using Verilog HDL 1 Gururaj E, 2 Chetan B V Assistant Professor Department of Electronics & Communication Engineering GM Institute of Technology,
More informationEECS150 - Digital Design Lecture 20 - Finite State Machines Revisited
EECS150 - Digital Design Lecture 20 - Finite State Machines Revisited April 2, 2009 John Wawrzynek Spring 2009 EECS150 - Lec20-fsm Page 1 Finite State Machines (FSMs) FSM circuits are a type of sequential
More informationECE 2300 Digital Logic & Computer Organization. More Finite State Machines
ECE 2300 Digital Logic & Computer Organization Spring 2018 More Finite State Machines Lecture 9: 1 Announcements Prelab 3(B) due tomorrow Lab 4 to be released tonight You re not required to change partner(s)
More informationECE 2300 Digital Logic & Computer Organization. More Verilog Finite State Machines
ECE 2300 Digital Logic & Computer Organization Spring 2018 More Verilog Finite Machines Lecture 8: 1 Prelim 1, Thursday 3/1, 1:25pm, 75 mins Arrive early by 1:20pm Review sessions Announcements Monday
More informationCS 151 Midterm. Instructions: Student ID. (Last Name) (First Name) Signature
CS 151 Midterm Name Student ID Signature :, (Last Name) (First Name) : : Instructions: 1. Please verify that your paper contains 11 pages including this cover. 2. Write down your Student-Id on the top
More informationSequential Logic Implementation. Mealy vs. Moore Machines. Specifying Outputs for a Mealy Machine. Specifying Outputs for a Moore Machine
uential Logic Implementation! Models for representing sequential circuits " bstraction of sequential elements " Finite state machines and their state diagrams " Inputs/ " Mealy, Moore, and synchronous
More informationEECS 151/251A: SRPING 2017 MIDTERM 1
University of California College of Engineering Department of Electrical Engineering and Computer Sciences E. Alon Thursday, Mar 2 nd, 2017 7:00-8:30pm EECS 151/251A: SRPING 2017 MIDTERM 1 NAME Last First
More informationECE 551: Digital System *
ECE 551: Digital System * Design & Synthesis Lecture Set 5 5.1: Verilog Behavioral Model for Finite State Machines (FSMs) 5.2: Verilog Simulation I/O and 2001 Standard (In Separate File) 3/4/2003 1 Explicit
More informationGeneral FSM design procedure
Sequential logic examples Basic design approach: a 4-step design process Hardware description languages and finite state machines Implementation examples and case studies finite-string pattern recognizer
More informationEECS Components and Design Techniques for Digital Systems. Lec 07 PLAs and FSMs 9/ Big Idea: boolean functions <> gates.
Review: minimum sum-of-products expression from a Karnaugh map EECS 5 - Components and Design Techniques for Digital Systems Lec 7 PLAs and FSMs 9/2- David Culler Electrical Engineering and Computer Sciences
More informationFinite State Machines
Finite State Machines Design methodology for sequential logic -- identify distinct states -- create state transition diagram -- choose state encoding -- write combinational Verilog for next-state logic
More informationSequential Logic Design
Sequential Logic Design Design of Digital Circuits 2017 Srdjan Capkun Onur Mutlu (Guest starring: Frank K. Gürkaynak and Aanjhan Ranganathan) http://www.syssec.ethz.ch/education/digitaltechnik_17 Adapted
More informationUniversity of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences. Spring 2010 May 10, 2010
University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences EECS150 J. Wawrzynek Spring 2010 May 10, 2010 Final Exam Name: ID number: This is
More informationControl in Digital Systems
CONTROL CIRCUITS Control in Digital Systems Three primary components of digital systems Datapath (does the work) Control (manager, controller) Memory (storage) B. Baas 256 Control in Digital Systems Control
More informationProblem Set # 6 (Assigned 27 February, Due 9 March)
University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Science EECS 150 Spring 2007 R. H. Katz Problem Set # 6 (Assigned 27 February, Due 9 March)
More information7.3 Case Study - FV of a traffic light controller
Formal Verification Using Assertions 247 7.3 Case Study - FV of a traffic light controller 7.3.1 Model This design represents a simple traffic light controller for a North-South and East-West intersection.
More informationC A R L E T O N U N I V E R S I T Y. FINAL EXAMINATION April Duration: 3 Hours No. of Students: 108
C A R L E T O N U N I V E R S I T Y FINAL EXAMINATION April 2011 Duration: 3 Hours No. of Students: 108 Department Name & Course Number: ELEC 3500 Digital Electronics Course Instructor(s): Ralph Mason
More informationDebouncing a Switch. A Design Example. Page 1
Debouncing a Switch A Design Example Page 1 Background and Motivation Page 2 When you throw a switch (button or two-pole switch) It often bounces Page 3 Another switch switch after inversion Page 4 Yet
More informationFinite State Machines
Lab Workbook Introduction (FSM) are sequential circuit used in many digital systems to control the behavior of systems and dataflow paths. Examples of FSM include control units and sequencers. This lab
More informationEE178 Lecture Verilog FSM Examples. Eric Crabill SJSU / Xilinx Fall 2007
EE178 Lecture Verilog FSM Examples Eric Crabill SJSU / Xilinx Fall 2007 In Real-time Object-oriented Modeling, Bran Selic and Garth Gullekson view a state machine as: A set of input events A set of output
More informationEECE 417 Computer Systems Architecture
EECE 417 Computer Systems Architecture Department of Electrical and Computer Engineering Howard University Charles Kim Spring 2007 1 Computer Organization and Design (3 rd Ed) -The Hardware/Software Interface
More informationQuick Introduction to SystemVerilog: Sequental Logic
! Quick Introduction to SystemVerilog: Sequental Logic Lecture L3 8-545 Advanced Digital Design ECE Department Many elements Don Thomas, 24, used with permission with credit to G. Larson Today Quick synopsis
More informationLast Lecture: Divide by 3 FSM
Last Lecture: Divide by 3 FSM Output should be 1 every 3 clock cycles S2 S0 S1 The double circle indicates the reset state Slide derived from slides by Harris & Harris from their book 1 Finite State Machines
More informationCS150 Fall 2012 Solutions to Homework 6
CS150 Fall 2012 Solutions to Homework 6 October 6, 2012 Problem 1 a.) Answer: 0.09 ns This delay is given in Table 65 as T ILO, specifically An Dn LUT address to A. b.) Answer: 0.41 ns In Table 65, this
More informationModeling Sequential Circuits in Verilog
Modeling Sequential Circuits in Verilog COE 202 Digital Logic Design Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals Presentation Outline Modeling Latches and Flip-Flops Blocking versus
More informationSE 1: Software Requirements Specification and Analysis
SE 1: Software Requirements Specification and Analysis Lecture 8: Reference Model for RE Nancy Day, Davor Svetinović http://www.student.cs.uwaterloo.ca/ cs445/winter2006 uw.cs.cs445 U Waterloo SE1 (Winter
More information7.3.3 Same Inputs in Antecedent and Consequent
Formal Verification Using Assertions 249 There are some special scenarios in which the user may want to intentionally toggle the reset signal during a session. This may be needed to check conditions such
More informationLaboratory Exercise 3 Davide Rossi DEI University of Bologna AA
Laboratory Exercise 3 Davide Rossi DEI University of Bologna AA 2017-2018 Objectives Summary of finite state machines (Mealy, Moore) Description of FSMs in System Verilog Design of control blocks based
More informationIn the previous lecture, we examined how to analyse a FSM using state table, state diagram and waveforms. In this lecture we will learn how to design
1 In the previous lecture, we examined how to analyse a FSM using state table, state diagram and waveforms. In this lecture we will learn how to design a fininte state machine in order to produce the desired
More informationIn the previous lecture, we examined how to analyse a FSM using state table, state diagram and waveforms. In this lecture we will learn how to design
In the previous lecture, we examined how to analyse a FSM using state table, state diagram and waveforms. In this lecture we will learn how to design a fininte state machine in order to produce the desired
More informationECE 2300 Digital Logic & Computer Organization. More Verilog Finite State Machines
ECE 2300 Digital Logic & Computer Organization Spring 2017 More Verilog Finite State Machines Lecture 8: 1 Announcements 1 st batch of (raw) quiz scores released on CMS Solutions to HW 1-3 released on
More informationReal Time Operating System
Chapter 11 Real Time Operating System Lesson 06 Case Study of Traffic Light for use of RTOS 51 in Design Assumptions When a vehicle coming from north, Left turn (north to west) allowed directly Left-lane
More informationEPC6055 Digital Integrated Circuits EXAM 1 Fall Semester 2013
EPC6055 Digital Integrated Circuits EXAM 1 Fall Semester 2013 Print Here Student ID Signature This is a closed book exam. The exam is to be completed in one-hundred ten (110) minutes. Don t use scratch
More informationFSM and Efficient Synthesizable FSM Design using Verilog
FSM and Efficient Synthesizable FSM Design using Verilog Introduction There are many ways to code FSMs including many very poor ways to code FSMs. This lecture offers guidelines for doing efficient coding,
More informationThe UNIVERSITY of NORTH CAROLINA at CHAPEL HILL
The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Comp 541 Digital Logic and Computer Design Fall 2014 Lab #4: Sequential Design: Counters Issued Wed 9/10/14; Due Wed 9/17/14 (11:59pm) This lab assignment
More informationActivity The Coordinate System and Descriptive Geometry
Activity 1.5.1 The Coordinate System and Descriptive Geometry Introduction North, east, south, and west. Go down the street about six blocks, take a left, and then go north for about 2 miles; you will
More informationDO NOT COPY. " Input and output pins
808 Chapter 9 Sequential-Circuit Design Examples Table 9-4 module tbirdsdo Output-coded state title 'Output-Coded T-Bird Tail Lights State Machine' assignment for the TBIRDS device 'P16V8R'; T-bird tail-lights
More informationFinite State Machines
Lab Workbook Introduction (FSM) are sequential circuit used in many digital systems to control the behavior of systems and dataflow paths. Examples of FSM include control units and sequencers. This lab
More informationLecture 08 Finite State Machine Design Using VHDL
Lecture 08 Finite State Machine Design Using VHDL 10/1/2006 ECE 358: Introduction to VHDL Lecture 8-1 Today Sequential digital logic system design state diagram/state graph 10/1/2006 ECE 358: Introduction
More informationEECS150 - Digital Design Lecture 17 Memory 2
EECS150 - Digital Design Lecture 17 Memory 2 October 22, 2002 John Wawrzynek Fall 2002 EECS150 Lec17-mem2 Page 1 SDRAM Recap General Characteristics Optimized for high density and therefore low cost/bit
More informationCS/EE Homework 7 Solutions
CS/EE 260 - Homework 7 Solutions 4/2/2001 1. (20 points) A 4 bit twisted ring counter is a sequential circuit which produces the following sequence of output values: 0000, 1000, 1100, 1110, 1111, 0111,
More informationOutline. EECS Components and Design Techniques for Digital Systems. Lec 11 Putting it all together Where are we now?
Outline EECS 5 - Components and Design Techniques for Digital Systems Lec Putting it all together -5-4 David Culler Electrical Engineering and Computer Sciences University of California Berkeley Top-to-bottom
More informationDIGITAL LOGIC WITH VHDL (Fall 2013) Unit 6
DIGITAL LOGIC WITH VHDL (Fall 2013) Unit 6 FINITE STATE MACHINES (FSMs) Moore Machines Mealy Machines FINITE STATE MACHINES (FSMs) Classification: Moore Machine: Outputs depend only on the current state
More informationThe University of Alabama in Huntsville Electrical and Computer Engineering CPE/EE 422/522 Spring 2005 Homework #6 Solution
5.3(a)(2), 5.6(c)(2), 5.2(2), 8.2(2), 8.8(2) The University of Alabama in Huntsville Electrical and Computer Engineering CPE/EE 422/522 Spring 25 Homework #6 Solution 5.3 (a) For the following SM chart:
More informationExample 58: Traffic Lights
208 Chapter 8 Listing 8.7(cont.) doorlock2_top.vhd btn012
More information(Refer Slide Time: 1:43)
(Refer Slide Time: 1:43) Digital Circuits and Systems Prof. S. Srinivasan Department of Electrical Engineering Indian Institute of Technology, Madras Lecture - 27 Pattern Detector So, we talked about Moore
More informationDIGITAL LOGIC DESIGN VHDL Coding for FPGAs Unit 6
DIGITAL LOGIC DESIGN VHDL Coding for FPGAs Unit 6 FINITE STATE MACHINES (FSMs) Moore Machines Mealy Machines Algorithmic State Machine (ASM) charts FINITE STATE MACHINES (FSMs) Classification: Moore Machine:
More informationMicro800 and Connected Components Workbench. Getting Started Guide. Copyright 2011 Rockwell Automation, Inc.
Micro800 and Connected Components Workbench Getting Started Guide Copyright 2011 Rockwell Automation, Inc. Table of Contents Chapter 1: Software Requirements and Installing the Software Chapter 2: Create
More informationGraduate Institute of Electronics Engineering, NTU. Lecturer: Chihhao Chao Date:
Design of Datapath Controllers and Sequential Logic Lecturer: Date: 2009.03.18 ACCESS IC LAB Sequential Circuit Model & Timing Parameters ACCESS IC LAB Combinational Logic Review Combinational logic circuits
More informationUniversity of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Science
University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Science EECS 150 Spring 2002 Original Lab By: J.Wawrzynek and N. Weaver Later revisions by
More informationLast Lecture. Talked about combinational logic always statements. e.g., module ex2(input logic a, b, c, output logic f); logic t; // internal signal
Last Lecture Talked about combinational logic always statements. e.g., module ex2(input logic a, b, c, output logic f); logic t; // internal signal always_comb t = a & b; f = t c; should use = (called
More informationMicroprocessors/Microcontrollers
Microprocessors/Microcontrollers A central processing unit (CPU) fabricated on one or more chips, containing the basic arithmetic, logic, and control elements of a computer that are required for processing
More informationDigital Integrated Circuits
Digital Integrated Circuits Lecture 3 Jaeyong Chung System-on-Chips (SoC) Laboratory Incheon National University GENERAL MODEL OF MEALY MACHINE Chung EPC6055 2 GENERAL MODEL OF MOORE MACHINE Chung EPC6055
More informationVerilog Synthesis and FSMs. UCB EECS150 Fall 2010 Lab Lecture #3
Verilog Synthesis and FSMs UCB EECS150 Fall 2010 Lab Lecture #3 Agenda Logic Synthesis Behavioral Verilog HDL Blocking vs. Non-Blocking Administrative Info Lab #3: The Combo Lock FSMs in Verilog HDL 2
More informationMidterm Exam Thursday, October 24, :00--2:15PM (75 minutes)
Last (family) name: Answer Key First (given) name: Student I.D. #: Department of Electrical and Computer Engineering University of Wisconsin - Madison ECE 551 Digital System Design and Synthesis Midterm
More informationThe UNIVERSITY of NORTH CAROLINA at CHAPEL HILL
The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Comp 541 Digital Logic and Computer Design Prof. Montek Singh Fall 2017 Lab #3A: Sequential Design: Counters Issued Wed 9/6/17; Due Wed 9/13/17 (11:59pm)
More informationEE 231 Fall EE 231 Homework 13 Due December 3, 2010
EE 23 Fall 2 EE 23 Homework 3 Due December 3, 2. Explain in words and write the HDL statements for the operations specified by the following register transfer notations; (a) R R, R2 R Transfer the contents
More informationDesign of Sequential Logic: Flip flops, counter, state machine, stacks
Design of Sequential Logic: Flip flops, counter, state machine, stacks 1 Today s goal Learn how to use always and if statements to design flip flops. Learn how to design sequential logic such as counters,
More informationDigital Integrated Circuits
Digital Integrated Circuits Lecture 4 Jaeyong Chung System-on-Chips (SoC) Laboratory Incheon National University BCD TO EXCESS-3 CODE CONVERTER 0100 0101 +0011 +0011 0111 1000 LSB received first Chung
More informationUniversity of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences. EECS 150 Spring 2000
University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences EECS 150 Spring 2000 Lab #8: EPROMs This lab is to be completed with a project partner.
More informationBlocking(=) vs Nonblocking (<=) Assignment. Lecture 3: Modeling Sequential Logic in Verilog HDL. Procedural assignments
Blocking(=) vs Nonblocking (
More informationproblem maximum score 1 8pts 2 6pts 3 10pts 4 15pts 5 12pts 6 10pts 7 24pts 8 16pts 9 19pts Total 120pts
University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences EECS150 J. Wawrzynek Spring 2010 3/31/09 Name: ID number: Midterm Exam This is a closed-book,
More informationUNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AN:p ENGINEERING. ECE241F - Digital Syst~ms Final Examination
~.. UNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AN:p ENGINEERING ECE241F - Digital Syst~ms Final Examination December 19, 2017, 2:00pm-4:30pm Duration: 2.5 hours Examiners: P. Anderson, P. Chow and
More informationFederal Urdu University of Arts, Science and Technology, Islamabad VLSI SYSTEM DESIGN. Prepared By: Engr. Yousaf Hameed.
VLSI SYSTEM DESIGN Prepared By: Engr. Yousaf Hameed Lab Engineer BASIC ELECTRICAL & DIGITAL SYSTEMS LAB DEPARTMENT OF ELECTRICAL ENGINEERING VLSI System Design 1 LAB 01 Schematic Introduction to DSCH and
More informationDesigning Safe Verilog State Machines with Synplify
Designing Safe Verilog State Machines with Synplify Introduction One of the strengths of Synplify is the Finite State Machine compiler. This is a powerful feature that not only has the ability to automatically
More informationHARDWARE SOFTWARE CO-DESIGN
HARDWARE SOFTWARE CO-DESIGN BITS Pilani Dubai Campus Dr Jagadish Nayak Models and Architecture BITS Pilani Dubai Campus Models and Architecture Model: a set of functional objects and rules for composing
More informationDIGITAL SYSTEM DESIGN
DIGITAL SYSTEM DESIGN Prepared By: Engr. Yousaf Hameed Lab Engineer BASIC ELECTRICAL & DIGITAL SYSTEMS LAB DEPARTMENT OF ELECTRICAL ENGINEERING Digital System Design 1 Name: Registration No: Roll No: Semester:
More informationPlease Read This First!
Please Read This First! Quick Start Your system Data has been Preinstalled. To light all scoreboards in your system turn on the control. Press the YES key when prompted, Do you want to start where last
More informationMLEP Intermediate GPS Workshop Exercise Two Using Maps
During this exercise, you will scale coordinates from a map and enter them into the GPS receiver. This requires a ruler (provided) and all calculations require a paper and pencil. During this exercise,
More informationVerilog HDL. Gate-Level Modeling
Verilog HDL Verilog is a concurrent programming language unlike C, which is sequential in nature. block - executes once at time 0. If there is more then one block, each execute concurrently always block
More informationEE414 Embedded Systems Ch 9. State Machines
EE414 Embedded Systems Ch 9. State Machines Byung Kook Kim School of Electrical Engineering Korea Advanced Institute of Science and Technology Outline State Machine Model 9.1 Introduction 9.2 Models vs.
More informationSPIN part 2. Verification with LTL. Jaime Ramos. Departamento de Matemática, Técnico, ULisboa
SPIN part 2 Verification with LTL Jaime Ramos Departamento de Matemática, Técnico, ULisboa Borrowed from slides by David Henriques, Técnico, ULisboa LTL model checking How Spin works Checks non-empty intersection
More informationPDHonline Course G349. State Machines. Mark A. Strain, P.E. PDH Online PDH Center
PDHonline Course G349 State Machines Mark A. Strain, P.E. 2013 PDH Online PDH Center 5272 Meadow Estates Drive Fairfax, VA 22030-6658 Phone & Fax: 703-988-0088 www.pdhonline.org www.pdhcenter.com An Approved
More informationEECS 373 Design of Microprocessor-Based Systems
EECS 373 Design of Microprocessor-Based Systems Mark Brehob University of Michigan Clocks, Counters, Timers, Capture, and Compare Some slides by Prabal Dutta and Thomas Schmid 1 iphone Clock App World
More informationParallel versus serial execution
Parallel versus serial execution F assign statements are implicitly parallel Ì = means continuous assignment Ì Example assign E = A & D; assign A = B & C; Ì A and E change if B changes F always blocks
More informationRTL Design (Using ASM/SM Chart)
Digital Circuit Design and Language RTL Design (Using ASM/SM Chart) Chang, Ik Joon Kyunghee University Process of Logic Simulation and Synthesis Design Entry HDL Description Logic Simulation Functional
More informationChapter 10. case studies in sequential logic design
Chapter. case studies in sequential logic design This is the last chapter of this course. So far, we have designed several sequential systems. What is the general procedure? The most difficult part would
More informationDexter Washer Programing. Part # 8533-***-*** 03/14
Dexter Washer Programing 3 PROGRAMMING INSTRUCTIONS: The washer control can be programmed to prompt the user for alternate vend prices, change washer cycle times, temperatures and many other options. This
More informationEECS 373 Practice Midterm / Homework #3 Fall 2014
Exam #: EECS 373 Practice Midterm / Homework #3 Fall 2014 Name: Uniquename: Sign the honor code: I have neither given nor received aid on this exam nor observed anyone else doing so. Scores: Problem #
More informationVerilog Tutorial. Introduction. T. A.: Hsueh-Yi Lin. 2008/3/12 VLSI Digital Signal Processing 2
Verilog Tutorial T. A.: Hsueh-Yi Lin Introduction 2008/3/12 VLSI Digital Signal Processing 2 Verilog: A common language for industry HDL is a common way for hardware design Verilog VHDL Verilog is widely
More informationLaboratory Exercise 7
Laboratory Exercise 7 Finite State Machines This is an exercise in using finite state machines. Part I We wish to implement a finite state machine (FSM) that recognizes two specific sequences of applied
More informationEECS 373 Midterm 2 Fall 2018
EECS 373 Midterm 2 Fall 2018 Name: unique name: Sign the honor code: I have neither given nor received aid on this exam nor observed anyone else doing so. Nor did I discuss this exam with anyone after
More informationFPGA Design Challenge :Techkriti 14 Digital Design using Verilog Part 1
FPGA Design Challenge :Techkriti 14 Digital Design using Verilog Part 1 Anurag Dwivedi Digital Design : Bottom Up Approach Basic Block - Gates Digital Design : Bottom Up Approach Gates -> Flip Flops Digital
More informationUniversity of Toronto Faculty of Applied Science and Engineering Edward S. Rogers Sr. Department of Electrical and Computer Engineering
University of Toronto Faculty of Applied Science and Engineering Edward S. Rogers Sr. Department of Electrical and Computer Engineering Final Examination ECE 241F - Digital Systems Examiners: S. Brown,
More informationQuestion Total Possible Test Score Total 100
Computer Engineering 2210 Final Name 11 problems, 100 points. Closed books, closed notes, no calculators. You would be wise to read all problems before beginning, note point values and difficulty of problems,
More informationVerilog introduction. Embedded and Ambient Systems Lab
Verilog introduction Embedded and Ambient Systems Lab Purpose of HDL languages Modeling hardware behavior Large part of these languages can only be used for simulation, not for hardware generation (synthesis)
More informationEECS150, Fall 2004, Midterm 1, Prof. Culler. Problem 1 (15 points) 1.a. Circle the gate-level circuits that DO NOT implement a Boolean AND function.
Problem 1 (15 points) 1.a. Circle the gate-level circuits that DO NOT implement a Boolean AND function. 1.b. Show that a 2-to-1 MUX is universal (i.e. that any Boolean expression can be implemented with
More informationCMPE 415 Verilog Case-Statement Based State Machines I
Department of Computer Science and Electrical Engineering CMPE 415 Verilog Case-Statement Based State Machines I Prof Ryan Robucci Basic State Machines Mealy Machine a/q0 c/q3 a/q0 a,b,c/q4 S0 S1 S2 b/q2
More information