HW6_solution - SOLUTION 1 ECE 2504 Introduction to Computer...

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

View Full Document Right Arrow Icon

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

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

Unformatted text preview: SOLUTION 1 ECE 2504 Introduction to Computer Engineering, Fall 2009 Homework 6 Due date: 11 Oct 09, 11:55pm Show all work. Use LogicWorks to draw circuit diagrams. 1. (6 pts) A sequential circuit has one JK flip flop, two inputs x and y, and one output S. The circuit consists of a full adder connected to the flip flop in the following way. J > K Q Q FA Y X Z S C Y X S Write the flip flop input equations Complete the state table. Hint: A full adder truth table is shown in section 1-5 in Mano. J=K=(xy + (x y)z) Note: This is equivalent to the following (xy)((x y)z) (x+y)( (x y)+z) x(x y) + xz + y(x y) + yz x(xy+xy) + xz+ y(xy+xy) + yz xxy + xxy + xz + xyy + xyy + yz J=K = xy + xz + yz Present State Inputs Intermediate Signals** FF Inputs Next State Output Q X Y Z C C=J=K Q(t+1) S 0 0 0 1 0 1 1 1 0 0 1 1 1 0 0 0 0 1 0 1 1 0 0 0 0 1 1 1 1 0 0 1 1 0 0 0 0 1 0 0 1 0 1 0 0 1 0 1 1 1 0 0 0 1 0 1 1 1 1 0 1 0 1 0 **Not truly part of the state table, but included here for clarity. SOLUTION 2 2. (5 pts) Draw the state diagram for a 3-bit counter that counts down using the following sequence (seven, six, five, four, three, two, one, zero, seven, ) when the input x=1 and holds...
View Full Document

Page1 / 9

HW6_solution - SOLUTION 1 ECE 2504 Introduction to Computer...

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

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