{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

HW11_Solution

# HW11_Solution - COCO F09 HW11 SOLUTION ECSE-2610 Computer...

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

COCO F09 HW11 SOLUTION Page 1/6 ECSE-2610 Computer Components and Operations Homework # 11 – SOLUTION Due Wednesday, November 18, in studio 1. (15 points) In this problem, you will design a sequential machine to function as a serial adder. There are two inputs X 1 and X 0 and one output Z. The inputs represent two binary numbers, input bit-by-bit, with the least significant bits presented first. The output is their sum, calculated bit-by-bit, including carry, as each pair of input bits is seen. For example (reading left to right), X 1 011010 X 0 110110 Z 100011 Here is the state diagram, with half of the arrows filled in. a. (2 points) Is this a Moore machine or a Mealy machine? Circle one and briefly explain your answer. Solution The output depends only on the state, not the input directly. b. (4 points) Fill in the rest of the arrows, with their labels. Solution 11 01, 10 10 01 11 00 00 11 00 01, 10 [1] [0] [0] [1] 11 11 00 00 01, 10 01, 10

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

View Full Document
COCO F09 HW11 SOLUTION Page 2/6 c. (3 points)
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 6

HW11_Solution - COCO F09 HW11 SOLUTION ECSE-2610 Computer...

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

View Full Document
Ask a homework question - tutors are online