CS 151 Final. Q1 Q2 Q3 Q4 Q5 Total Credit Score. Instructions: Student ID. (Last Name) (First Name) Signature

Similar documents
CS 151 Midterm. (Last Name) (First Name)

CS 151 Quiz 4. Instructions: Student ID. (Last Name) (First Name) Signature

CS 151 Final. (Last Name) (First Name)

CS 151 Midterm. Instructions: Student ID. (Last Name) (First Name) Signature

CS 151 Midterm. Instructions: Student ID. (Last Name) (First Name) Signature

EPC6055 Digital Integrated Circuits EXAM 1 Fall Semester 2013

CS303 LOGIC DESIGN FINAL EXAM

Sequential Circuits. inputs Comb FFs. Outputs. Comb CLK. Sequential logic examples. ! Another way to understand setup/hold/propagation time

Sequential Logic Implementation. Mealy vs. Moore Machines. Specifying Outputs for a Mealy Machine. Specifying Outputs for a Moore Machine

ECE 2300 Digital Logic & Computer Organization. More Verilog Finite State Machines

ECE 2300 Digital Logic & Computer Organization. More Finite State Machines

DIGITAL LOGIC WITH VHDL (Fall 2013) Unit 6

ECE 551 Digital System Design and Synthesis. Instructor: Kewal K. Saluja. Midterm Exam

Finite State Machines

EECS150 - Digital Design Lecture 20 - Finite State Machines Revisited

DIGITAL LOGIC DESIGN VHDL Coding for FPGAs Unit 6

University of Toronto Faculty of Applied Science and Engineering Edward S. Rogers Sr. Department of Electrical and Computer Engineering

ECE 2300 Digital Logic & Computer Organization. More Verilog Finite State Machines

Graduate Institute of Electronics Engineering, NTU. Lecturer: Chihhao Chao Date:

General FSM design procedure

problem maximum score 1 10pts 2 8pts 3 10pts 4 12pts 5 7pts 6 7pts 7 7pts 8 17pts 9 22pts total 100pts

Exp#8: Designing a Programmable Sequence Detector

FPGA for Software Engineers

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

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

ECE 2020B Fundamentals of Digital Design Spring problems, 6 pages Exam Two 26 February 2014

University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences. Spring 2010 May 10, 2010

ECE 2030D Computer Engineering Spring problems, 5 pages Exam Two 8 March 2012

Finite State Machines

(Refer Slide Time: 1:43)

Midterm Exam Thursday, October 24, :00--2:15PM (75 minutes)

York University AS/AK/ITEC INTRODUCTION TO DATA STRUCTURES. Midterm Sample I. Examiner: S. Chen Duration: One Hour and 30 Minutes

York University. AP/ITEC Section M INTRODUCTION TO DATA STRUCTURES Winter Midterm Test

First Name: Last Name: PID: CSE 140L Exam. Prof. Tajana Simunic Rosing. Winter 2010

Design of Digital Circuits ( L) ETH Zürich, Spring 2017

Finite State Machines

General FSM design procedure

Question Total Possible Test Score Total 100

Controller Implementation--Part I. Cascading Edge-triggered Flip-Flops. Clock Skew. Cascading Edge-triggered Flip-Flops. Why Gating of Clocks is Bad!

One and a half hours. Section A is COMPULSORY UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE

Lecture 08 Finite State Machine Design Using VHDL

General FSM design procedure

Finite-State Machine (FSM) Design

Student Number: UTORid: Question 0. [1 mark] Read and follow all instructions on this page, and fill in all fields.

Finite State Machines

Lecture #1: Introduction

University of Toronto Faculty of Applied Science and Engineering Edward S. Rogers Sr. Department of Electrical and Computer Engineering

University of Florida EEL 3744 Spring 2017 Dr. Eric M. Schwartz Department of Electrical & Computer Engineering 22 February Mar-17 1:44 PM

Storage Elements & Sequential Circuits

FSM Design Problem (10 points)

I 3 I 2. ! Language of logic design " Logic optimization, state, timing, CAD tools

Laboratory Exercise 3 Davide Rossi DEI University of Bologna AA

VHDL for Synthesis. Course Description. Course Duration. Goals

EECS 151/251A: SRPING 2017 MIDTERM 1

ECE 551: Digital System *

R07. Code No: V0423. II B. Tech II Semester, Supplementary Examinations, April

CS/ECE 252 Introduction to Computer Engineering

University of Toronto Mississauga. Flip to the back cover and write down your name and student number.

R a) Simplify the logic functions from binary to seven segment display code converter (8M) b) Simplify the following using Tabular method

ECE 341 Midterm Exam

Sunburst Design - Verilog-2001 Design & Best Coding Practices by Recognized Verilog & SystemVerilog Guru, Cliff Cummings of Sunburst Design, Inc.

EECS150. Implement of Processor FSMs

Verilog for High Performance

Quick Introduction to SystemVerilog: Sequental Logic

Math 52 - Fall Final Exam PART 1

Introduction to Verilog and ModelSim. (Part 6 State Machines)

Lecture 3. Behavioral Modeling Sequential Circuits. Registers Counters Finite State Machines

Laboratory Exercise 7

ECE 2030B 1:00pm Computer Engineering Spring problems, 5 pages Exam Two 10 March 2010

Control in Digital Systems

ECE 341 Midterm Exam

3 Designing Digital Systems with Algorithmic State Machine Charts

Alternative Ways to Implement Processor FSMs. Outline. Moore Machine State Diagram. Random Logic. Moore Machine Diagram

Block diagram view. Datapath = functional units + registers

ECE 545 Lecture 12. Datapath vs. Controller. Structure of a Typical Digital System Data Inputs. Required reading. Design of Controllers

Computer Organization. Structure of a Computer. Registers. Register Transfer. Register Files. Memories

Digital System Design with SystemVerilog

UNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AN:p ENGINEERING. ECE241F - Digital Syst~ms Final Examination

ECE 465, Spring 2010, Instructor: Prof. Shantanu Dutt. Project 2 : Due Fri, April 23, midnight.

The University of Alabama in Huntsville ECE Department CPE Midterm Exam February 26, 2003

Q1: Functions / 33 Q2: Arrays / 47 Q3: Multiple choice / 20 TOTAL SCORE / 100 Q4: EXTRA CREDIT / 10

Chapter 10. case studies in sequential logic design

CS 559 Computer Graphics Midterm Exam March 22, :30-3:45 pm

Abstraction of State Elements. Sequential Logic Implementation. Forms of Sequential Logic. Finite State Machine Representations

Controller Implementation--Part II

Outline. Finite State Machine. 2. Representation of FSM. 1. Overview on FSM

The LC3's micro-coded controller ("useq") is nothing more than a finite-state machine (FSM). It has these inputs:

ECE 341 Midterm Exam

(ii) Simplify and implement the following SOP function using NOR gates:

CprE 583 Reconfigurable Computing

EE 109L Review. Name: Solutions

ENEL Digital Circuits Midterm Examination

KING FAHD UNIVERSITY OF PETROLEUM & MINERALS COMPUTER ENGINEERING DEPARTMENT

Transistor: Digital Building Blocks

INTRODUCTION OF MICROPROCESSOR& INTERFACING DEVICES Introduction to Microprocessor Evolutions of Microprocessor

2015 Paper E2.1: Digital Electronics II

Mealy and Moore examples

ASKnLearn LMS

Without fully opening the exam, check that you have pages 1 through 11.

INSTITUTE OF AERONAUTICAL ENGINEERING Dundigal, Hyderabad ELECTRONICS AND COMMUNICATIONS ENGINEERING

Transcription:

CS 151 Final Name Student ID Signature :, (Last Name) (First Name) : : Instructions: 1. Please verify that your paper contains 15 pages including this cover. 2. Write down your Student-Id on the top of each page of this final. 3. This exam is closed book. No notes or other materials are permitted. 4. Total credits of this final are 100 + 10 EXTRA CREDIT. 5. To receive credit you must show your work clearly. 6. No re-grades will be entertained if you use a pencil. 7. Calculators are NOT allowed. Q1 Q2 Q3 Q4 Q5 Total Credit 25 15 30 15 25 110 Score CS 151 Digital Logic Design, Winter Quarter 2007, Final Page 1

Q1: Design of a Moore Machine [25 points] We want to design a non-resetting sequence detector using a finite state machine with one input X and one output Y. The FSM asserts its output Y when it recognizes the following input bit sequence: "1101". The machine will keep checking for the proper bit sequence and does not reset to the initial state after it has recognized the string. [Note: As an example the input string X= "..1101101.." will cause the output to go high twice: Y = "..0001001.."] (a) Capture the Moore FSM. (10points) CS 151 Digital Logic Design, Winter Quarter 2007, Final Page 2

(b) Create the architecture (3 points) CS 151 Digital Logic Design, Winter Quarter 2007, Final Page 3

(c) Encode the states (use a simple binary encoding) (2 points) (d) Create the state table (10 points) CS 151 Digital Logic Design, Winter Quarter 2007, Final Page 4

Q2: [RTL Design] [15 points] We want to design a timer with 2 modes: 1Min, 30Sec. There is a START button and a STOP button for this timer. The timer is initially in standby mode. Then, we select a mode by pressing 1Min or 30Sec. After pressing the button START, the timer starts counting until it reaches the time (if it is in 1Min mode it counts for 1 minute and if it is in 30Sec mode, it counts for 30 seconds). Then it beeps and goes to standby mode. If during the time that the timer is working we press the STOP button the timer beeps and it goes to standby mode. If the timer is working in 30Sec mode and the user presses 1Min button, then after completion of 30 seconds the timer works for another 30 seconds. This can happen just once and then the timer beeps and goes to standby mode. Assuming that we have necessary components to design the circuit for this timer, design the high-level state machine for this timer. CS 151 Digital Logic Design, Winter Quarter 2007, Final Page 5

CS 151 Digital Logic Design, Winter Quarter 2007, Final Page 6

Q3: [Data Path Design] [30 points] The following high-level state machine is designed to find an input X in a register file of size 1024. X is the input that we are searching for in the register file, START is a one bit input and RETURN and DONE are the outputs. Mem[t] is the value stored in the register file at address t. CS 151 Digital Logic Design, Winter Quarter 2007, Final Page 7

1. Design the data path for this high-level state machine. [15 points] CS 151 Digital Logic Design, Winter Quarter 2007, Final Page 8

2. Design the interface of the controller and the data path as well as the interface of the system. [5 points] CS 151 Digital Logic Design, Winter Quarter 2007, Final Page 9

3. Design the controller s FSM. [10 points] CS 151 Digital Logic Design, Winter Quarter 2007, Final Page 10

Q4: [FSM Timing] [15 points] The following FSM has one bit input I and one bit output O. (I/O is presented on each edge of the FSM). 1. Determine if it is a Mealy machine or a Moore machine. [2 points] CS 151 Digital Logic Design, Winter Quarter 2007, Final Page 11

2. In the following timing diagram show how the state and the output change with input. Assume that we initially start from state S0. [13 points] NOTE: Assume that delay of the gates and the register is negligible. 0 CS 151 Digital Logic Design, Winter Quarter 2007, Final Page 12

Q5: [Component Design] [25 points] 1. We want to design a frequency divider circuit that divides a given frequency by 3 or 5. If the input MODE=0 it divides the frequency by 3 and if MODE= 1 it divides the frequency by 5. [15 points] Use as many of the following as needed in your design: a- 3-bit counter with clear b- 2-to-1 multiplexer c- Logic gates (AND, OR, NOT) CS 151 Digital Logic Design, Winter Quarter 2007, Final Page 13

2. Design a 16-to-1 multiplexer using ONLY 4-to-1 multiplexers. [10 points] CS 151 Digital Logic Design, Winter Quarter 2007, Final Page 14

CS 151 Digital Logic Design, Winter Quarter 2007, Final Page 15