hw9 - CSE140 Fall 2006 Homework #9 CSE140 Homework #9 Due...

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

View Full Document Right Arrow Icon
Homework #9 CSE140 Homework #9 Due date: Thursday, 11/30/06 You must show ALL steps for obtaining the solution. Just reporting the correct answer, without showing work performed at each step will result in getting 0 points for that problem. Problems : 1. A resetable mod-n counter counts from 0 to (n - 1) when Rst = 0, and outputs 0 when Rst = 1. Design a resetable mod-37 counter using a resetable mod-64 counter, AND gates, OR gates, and NOT gates. 2. Consider an ALU with two n-bit data inputs A = An. ..A1 and B=Bn. ..B1, two selection inputs S1 and S0, one n-bit data output F = Fn. ..F1, and one-bit carry out bit cout that implements the following four functions: Implement this ALU for 2- bit data, using exactly two full adders, exactly two multiplexers, and as many other AND, OR, and NOT gates as you need. S1 S0 ALU Operations 0 0 (A==B) 0 1 (Ai<Bi) 1 0 Ai+Bi+1 1 1 Ai-Bi-1 3. Consider the following circuit: a. Derive the next state and output table for the given circuit above. b. Draw the finite state machine corresponding to your next state and output table.
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 / 2

hw9 - CSE140 Fall 2006 Homework #9 CSE140 Homework #9 Due...

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