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

Chapter 6: Appendix B, 26 (page 500)

B.26 [5] <§B.6> Rewrite the equations on page B-44 for a carry-lookahead logic for a 16-bit adder using a new notation. First, use the names for the CarryIn signals of the individual bits of the adder. That is, use c4, c8, c12, … instead of C1, C2, C7, …. In addition, let Pi,j; mean a propagate signal for bits i to j, and Gi,j; mean a generate signal for bits i to j. For example, the equation

C2 = G1+( P1.G0)+( P1.P0. c0) can be rewritten as

c8= G 7,4 + (P7,4 .G7,0) +( P7,4 .P3,0.c0)

This more general notation is useful in creating wider adders.

Short Answer

Expert verified

After rewriting the equationfor a carry-lookahead logic for a 16-bit adder using the mentioned notation:

  • C4=G3+(P3.G2)+( P3.P2.G1)+( P3.P2.P1.G0)+ ( P3.P2.P1.P0.c0) can be rewritten as c16= G 7,12+( P15,12. G 7,8)+( P15,12. P11,8. G 7,4)+( P15,12. P11,8. P7,4. G7,0)+ ( P15,12. P11,8. P7,4. P3,0.c0)
  • C3=G2+(P2.G1)+(P2.P1.G0)+(P2.P1.P0.c0)can be rewritten as

c12= G 7,8+( P11,8. G 7,4)+( P11,8. P7,4. G7,0)+( P11,8. P7,4. P3,0.C0)

  • C2 = G1+( P1.G0)+( P1.P0. c0) can be rewritten as

c8= G 7,4 + (P7,4.G7,0) +( P7,4.P3,0.c0)

  • C1=G0+(P0.c0) can be rewritten as

c4= G7,0+( P3,0. c0)

Step by step solution

01

Define the concept.

The specified figure of 16 bit carry look-ahead adder:

For G0,

=G7,0

=g7+(p7.g2)+(p7.p2.g1)+( p7.p2.p1.g0)

For G1,

G1

= G 7,4

=g7+(p7.g6)+(p7.p6.g5)+( p7.p6.p5.g4)

For G2,

G2

= G 7,8

=g11+(p11.g10)+(p11.p10.g9)+( p11.p10.p9.g8)

For G3,

G3

= G 7,12

=g15+(p15.g14)+(p15.p14.g13)+( p15.p14.p13.g12)

02

Determine the calculation.

The carry out c16 is simplified as,

C4=G3+(P3.G2)+( P3.P2.G1)+( P3.P2.P1.G0)+ ( P3.P2.P1.P0.c0)

The carry out c12 is simplified as,

C3=G2+(P2.G1)+(P2.P1.G0)+(P2.P1.P0.c0)

The carry out c8 is simplified as,

C2 = G1+( P1.G0)+( P1.P0. c0)

The carry out c4 is simplified as,

C1=G0+(P0.c0)

According to the mentioned-condition

G3 can be written as G 7,12

G2 can be written as G 7,8

G1 can be written as G 7,4

G0 can be written as G7,0

P3 can be written as P15,12

P2 can be written as P11,8

P1 can be written as P7,4

P0 can be written as P3,0

Hence for the 16 bit carry look-ahead adder,

  • C4=G3+(P3.G2)+( P3.P2.G1)+( P3.P2.P1.G0)+ ( P3.P2.P1.P0.c0) can be rewritten as c16= G 7,12+( P15,12. G 7,8)+( P15,12. P11,8. G 7,4)+( P15,12. P11,8. P7,4. G7,0)+ ( P15,12. P11,8. P7,4. P3,0.c0)
  • C3=G2+(P2.G1)+(P2.P1.G0)+(P2.P1.P0.c0)can be rewritten as

c12= G 7,8+( P11,8. G 7,4)+( P11,8. P7,4. G7,0)+( P11,8. P7,4. P3,0.C0)

  • C2 = G1+( P1.G0)+( P1.P0. c0) can be rewritten as

c8= G 7,4 + (P7,4.G7,0) +( P7,4.P3,0.c0)

  • C1=G0+(P0.c0) can be rewritten as

c4= G7,0+( P3,0. c0)

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

B.21 [10] <§§B.3, B.4> Given the following logic diagram for an accumulator, write down the Verilog module implementation of it. Assume a positive edge triggered register and asynchronous Rst.

A systolic array is an example of an MISD machine. A systolic array is a pipeline network or “wavefront” of data processing elements. Each of these elements does not need a program counter since execution is triggered by the arrival of data. Clocked systolic arrays compute in “lock-step” with each processor undertaking alternate compute and communication phases.

6.12.1 [10] Consider proposed implementations of a systolic array (you can find these in on the internet or in technical publications). Then attempt to program the loop provided in Exercise 6.11 using this MISD model. Discuss any difficulties you encounter.

6.12.2 [10] Discuss the similarities and differences between an MISD and SIMD machine. Answer this question in terms of data-level parallelism.

One logic function that is used for a variety of purposes

(including within adders and to compute parity) is exclusive OR. The output of a two-input exclusive OR function is true only if exactly one of the inputs is true. Show the truth table for a two-input exclusive OR function and implement this function using AND gates, OR gates, and inverters

A.6 [5] Using SPIM, write and test an adding machine program that repeatedly reads in integers and adds them into a running sum. The program should stop when it gets an input that is 0, printing out the sum at that point. Use the SPIM system calls described on pages A-43 and A-45.

Implement the four-input odd-parity function with a PLA.

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