ps4f02 - Massachusetts Institute of Technology Department...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.111 & Introductory Digital Systems Laboratory Problem Set 4 Lecture 10 Day Due: Lecture 12 Day Problem 1: Simple Finite State Machine The sequential circuit below has one D flip-flop, two inputs (X and Y), and one output (S). The circuit consists of a full adder circuit whose carry output is connected to a D flip- flop. 1. Derive the truth table for the above circuit. 2. Draw the state diagram for this circuit (be sure to show the output S in the diagram). 3. Is the finite state machine of the Moore type or the Mealy type? Explain. 4. Assume that the timing characteristics for the flip-flop are t p = t setup = t hold = 2 ±s, and for the full adder t p = 4 ±s. Assuming that all inputs (X and Y) are synchronous with the system clock, what is the greatest clock speed at which the system could run? Problem 2: Parking Ticket Machine
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 3

ps4f02 - Massachusetts Institute of Technology Department...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online