M16_2_M16_Discussion9

M16_2_M16_Discussion9 - Add the representations with an...

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

View Full Document Right Arrow Icon
UCLA Department of Electrical Engineering EEM16 – Fall 2011 Discussion 9 1. Ex. 10.5 Design a one-digit decimal adder in the Excess-3 code. Use two four-bit binary adders and one inverter. 2. Complete the following table Signed integer (in decimal) Representation (in decimal) Bit-vector a -25 b 190 c 11100 d 7 for a. Two’s complement, n = 7 bits b. One’s complement, n = 8 bits c. Two’s complement, n = 5 bits d. Two’s complement, n = 8 bits 3. Ex. 10.13 a. Show that in the ones’-complement representation, where ± ² ³ ´ µ , the addition of two signed integers represented by n -bit vectors can be performed by the following two steps:
Background image of page 1

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

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

Unformatted text preview: Add the representations with an n-bit adder. If the carry-out of the adder is 1, add 1 to the result of the addition and discard the carry-out. Remember that, in the ones-complement system, is also a representation of 0. b. Show that the second step of the operation can be implemented by connecting signal to the adder input , as shown in Figure 10.21. This is a combinational network with a loop, so it is necessary to verify that the operation is combinational. 4. Ex. 10.21 Design a 32-bit tree comparator using 4-bit modules....
View Full Document

This note was uploaded on 04/02/2012 for the course EE EEM16 taught by Professor Cabriv during the Fall '11 term at UCLA.

Page1 / 2

M16_2_M16_Discussion9 - Add the representations with an...

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