Computer Science > QUESTIONS & ANSWERS > Iowa State University CPR E 281 mcarryme27 (All)
Synchronous Sequential Circuits Assigned: Week 12 Due Date: Nov. 12, 2018 1 This is the key. P1 (20 points): We want to design a circuit with input W and an output Z, where Z will equal 1 if, fo ... r the last three clock cycles, W has been 1. A: Draw a state diagram for a Moore Finite State Machine (FSM) that implements this circuit in four states, specified as follows: B: Complete a state table for the above state diagram with the state assignments as shown below for state variables D1 and D0. W=0 W=1 Z S-0 : 00 S-0 : 00 S-I : 01 0 S-I : 01 S-0 : 00 S-II : 10 0 S-II : 10 S-0 : 00 S-III : 11 0 S-III : 11 S-0 : 00 S-III : 11 1 C: Use K-maps to show that the output and next-state variables can be expressed as: D: Let’s consider if the states were encoded as: S-0 = 00, S-I = 01, S-II = 11, S-III = 10 This study source was downloaded by 100000824368823 from CourseHero.com on 11-12-2022 21:49:51 GMT -06:00 https://www.coursehero.com/file/72285473/HW10-Sample-Solutionspdf/ Cpr E 281 HW10 ELECTRICAL AND COMPUTER ENGINEERING IOWA STATE UNIVERSITY Synchronous Sequential Circuits Assigned: Week 12 Due Date: Nov. 12, 2018 2 Use K-maps to show that the output and next-state variables with this new encoding can be expressed as: E: Draw the circuit for this FSM (developed in part D) using only DFFs, AND gates, and one OR gate (Do not use any NOT gates). [Show More]
Last updated: 3 years ago
Preview 1 out of 8 pages
Buy this document to get the full access instantly
Instant Download Access after purchase
Buy NowInstant download
We Accept:
Can't find what you want? Try our AI powered Search
Connected school, study & course
About the document
Uploaded On
Nov 13, 2022
Number of pages
8
Written in
All
This document has been written for:
Uploaded
Nov 13, 2022
Downloads
0
Views
61
Scholarfriends.com Online Platform by Browsegrades Inc. 651N South Broad St, Middletown DE. United States.
We're available through e-mail, Twitter, Facebook, and live chat.
FAQ
Questions? Leave a message!
Copyright © Scholarfriends · High quality services·