Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Calculate the time necessary to perform a multiply using the approach given in Figure 3.7 if an integer is 8 bits wide and an adder takes 4 time units.

Short Answer

Expert verified

Time units that is necessary to perform a multiplication:

12 time units

Step by step solution

01

Determine the Multiplication Using Adders

For each bit of multiplier, one 32-bit adder will be assigned. AND operation will be performed with the multiplier bit and the result will be the input to the adder.

The adders will be placed parallelly to organize 31 additions in a parallel manner. Instead of 31 repetitions, 31 additions will be performed simultaneously.

02

Determine the time units for multiplication in 31-adder setup

Given that the each step of the operation will take 4 time units.

The adders are arranged in a tree structure. It requires log2 levels.

It is given that the integer is 8-bit wide which is “a”. For this case 7 adders will be added in 3 levels.

Therefore, the time units taken for hardware is as follows:

3×t=3×4=12timeunits

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Question: Write down the bit pattern in the fraction assuming a floating-point format that uses Binary Coded Decimal (base 10) numbers in the fraction instead of base 2. Assume there are 24 bits, and you do not need to normalize. Is this representation exact?

Calculate 1.666015625×100×1.9760×104+1.9744×104by hand, assuming each of the values is stored in the 16-bit half-precision format described in Exercise 3.27 (and also described in the text). Assume 1 guard, 1 round bit, and 1 sticky bit, and round to the nearest even. Show all the steps, and write your answer in both the 16-bit floating-point format and in decimal.

Question: [10] Write down the binary representation of the decimal number 63.25 assuming the IEEE 754 single precision format.

IEEE 754-2008 contains a half precision that is only 16 bits wide. The left most bit is still the sign bit, the exponent is 5 bits wide and has a bias of 15, and the mantissa is 10 bits long. A hidden 1 is assumed. Write down the bit pattern to represent -1.5625×10-1assuming a version of this format, which uses an excess-16 format to store the exponent. Comment on how the range and accuracy of this 16-bit floating point format compares to the single precision IEEE 754 standard.

Calculate 3.4179687510-3×6.34765625×10-3×1.05625×102 by hand, assuming each of the values are stored in the 16-bit half precision format described in Exercise 3.27 ( and also described in the text). Assume 1 guard, 1 round bit, and 1 sticky bit, and round to the nearest even. Show all the steps, and write your answer in both the 16-bit floating point format and in decimal.

See all solutions

Recommended explanations on Computer Science Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free