Homework06_key - CS/ECE 3810 Solutions Homework #6 Fall...

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

View Full Document Right Arrow Icon
CS/ECE 3810 Solutions Homework #6 Fall 2009 This problem asks you to design an overflow detection unit for a 32-bit ALU. This problem is based on these diagrams: (I have modified the diagram for the ALU for the highest bit to include a ‘Signed’ inpu t to the overflow detection unit.)
Background image of page 1

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

View Full DocumentRight Arrow Icon
The left diagrams are the single-bit ALUs that are combined to form the 32-bit ALU on the right. The lower-left ALU is only used for the highest bit of the 32-bit ALU. As specified in the problem, and as shown in the diagram, there are six inputs to the overflow detection unit: high bit of a , high bit of b , Binvert , Sum , Carry , and Signed. The goal of this problem is to design a logic circuit to detect overflow using only these inputs. Discussion All that is required for the discussion is a description of the six cases where overflow will occur: 1. Two positive numbers should not ever sum up to be a negative number. Overflow will occur if both a and b are false (indicating positive numbers), Signed is true (indicating signed arithmetic), Binvert is false (indicating addition), and Sum is true (indicating a negative number). 2.
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 4

Homework06_key - CS/ECE 3810 Solutions Homework #6 Fall...

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