H.

Wu

Page 1

Assignment 2: Computer Arithmetic, Fall 2013

Due: 5pm, Friday, Oct 11, 2013 (Electronic submission via Clew is required) 1. (20 marks) Perform binary SD carry-free addition for A + B , and D + E , by rst using Table 2.1 in the lecture notes, and if it is not working, then use Table 2.2, where A = 101012 , B = 110012, D = 11102 , and E = 110112 . 2. (10 marks) Represent X = 5 and A = 7 in 4-bit 2s complement representation and then use sequential multiplication algorithm to obtain the product X A. 3. (10 marks) Let X = (0.100000)2 = 1/2 and D = (0.101)2 = 5/8. Use restoring division algorithm to obtain the quotient Q = 0.q1 qm and the remainder R = 2m rm . 4. (15 marks) Find the normalized machine representations of the oatingpoint number 114.40625 28 i). in the single-precision IEEE format; ii). in the double-precision IEEE format. 5. (15 marks) Find the value for the following IEEE single-precision representation. The nal result should be in the form 1.a 2b , where 1.a is a decimal number with integer digit of 1 and four fractional digits, and b is a decimal integer. 1 1 1 0 0 0 1 1 0 0 1 0 1 0 0 19 zeros 6. (15 marks) Suppose that the input is X = x1 x0 .x1 x2 x3 , and the output is an integer. Give the truth table and then draw a block diagram using adder and/or necessary logic gates for an implementation of round-to-the-nearest scheme. 7. (15 marks) Find the maximal positive and negative errors and the bias for the ROM rounding scheme with l = 4 and d = 2. Dept ECE, University of Windsor