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

Question: There are times when we want to add a collection of numbers together. Suppose you wanted to add four 4-bit numbers (A, B, E, F) using 1-bit full adders. Let’s ignore carry lookahead for now. You would likely connect the 1-bit adders in the organization at the top of Figure B.14.1. Below the traditional organization is a novel organization of full adders. Try adding four numbers using both organizations to convince yourself that you get the same answer.

Short Answer

Expert verified

Answer

Adding four numbers using both organizations gives the same value.

Step by step solution

01

Consider any four 4-bit numbers A, B, C, and D

Suppose the four 4-bit numbers are:

A=1100

B=1011

C=1000

D=1110

The values of a3, a2, a1, a0 are 1, 1, 0, 0 respectively.

The values of b3, b2, b1, b0 are 1, 0, 1, 1 respectively.

The values of e3, e2, e1, e0 are 1, 0, 0, 0 respectively.

The values of f3, f2, f1, f0 are 1, 1, 1, 0 respectively.

02

Truth table for performing addition operation on traditional organization

The truth table for performing addition operations in a traditional organization is:

INPUTS
OUTUTS

A

B

SUM

CARRY

0

0

0

0

0

1

1

0

1

0

1

0

1

1

0

1

03

Addition of four numbers using traditional organization 

The following diagram shows the addition operation performed on the four 4-bit numbers A, B, C, and D.

The sum of the four numbers is 101101.

04

Truth table for performing addition operation on novel organization

The truth table for performing addition operation on a novel organization is:

INPUTSOUTPUTS

A

B

Carry

Carry Out

SUM

0

0

0

0

0

0

0

1

0

1

0

1

0

0

1

0

1

1

1

0

1

0

0

0

1

1

0

1

1

0

1

1

0

1

0

1

1

1

1

1

05

Addition of four numbers using novel organization

The following diagram shows the addition operation performed on the four 4-bit numbers A, B, C, and D.

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

Derive the product-of-sums representation for Eshown on page B-11 starting with the sum-of-products representation. You will need to use DeMorgan’s theorems.

When a program is adapted to run on multiple processors in a multiprocessor system, the execution time on each processor is comprised of computing time and the overhead time required for locked critical sections and/or to send data from one processor to another.

Assume a program requires t = 100 s of execution time on one processor. When run p processors, each processor requires t/p s, as well as an additional 4 s of overhead, irrespective of the number of processors. Compute the per-processor execution time for 2, 4, 8, 16, 32, 64, and 128 processors. For each case, list the corresponding speedup relative to a single processor and the ratio between actual speedup versus ideal speedup (speedup if there was no overhead).

Assume a program requires the execution of 50×106FP instructions, 110×106INT instructions,80×106L/S instructions, and16×106branch instructions. The CPI for each type of instruction is 1, 1, 4, and 2, respectively. Assume that the processor has a 2 GHz clock rate:

1.14.1 By how much must we improve the CPI of FP instructions if we want the program to run two times faster?

1.14.2 By how much must we improve the CPI of L/S instructions if we want the program to run two times faster?

1.14.3 By how much is the execution time of the program improved if the CPI of INT and FP instructions is reduced by 40%and the CPI of L/S and Branch is reduced by 30%?

Question: Aside from the smart cell phones used by a billion people, list and describe four other types of computers

Compilers can have a profound impact on the performance of an application. Assume that for a program., compiler A results in a dynamic instruction count of 1.0E9 and has an execution time of 1.1 s, while compiler B results in a dynamic instruction count of 1.2E9 and an execution time of 1.5 s.

a) Find the average CPI for each program given that the processor has a clock cycle time of 1 ns.

b) Assume the compiled programs run on two different processors. If the execution times on the two processors are the same, how much faster is the clock of the processor running compiler A’s code versus the clock of the processor running compiler B’s code?

c) A new compiler is developed that uses only 6.0E8 instructions and has an average CPI of 1.1. What is the speedup of using this new compiler versus using compiler A or B on the original processor?

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