Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
B.27 [15] <§B.6> Write the equations for the carry- lookahead logic for a 64-bit adder using the new

B.27 [15] <§B.6> Write the equations for the carry- lookahead logic for a 64-bit adder using the new

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question

# B.29

Carryln a0 b0 a1 b1 Carryln Result0-3 a2 ALUO b2 pi gi PO a3 b3 GO C1 ci + 1 Carry-lookahead unit a4 b4 Carryln Result4–7 a5 b5 ALU1 a6 b6 P1 pi + 1 a7 G1 gi + 1 b7 C2 ci + 2 a8 b8 a9 b9 Carryln Result8–11 ALU2 a10 b10 pi +2 gi + 2 P2 a11 G2 b11 C3 ci + 3 a12- b12 Carryln Result12–15 а13 b13 a14 b14 a15 b15 ALU3 pi + 3 gi + 3 P3 G3 C4 ci + 4 CarrvOut
Transcribed Image Text:Carryln a0 b0 a1 b1 Carryln Result0-3 a2 ALUO b2 pi gi PO a3 b3 GO C1 ci + 1 Carry-lookahead unit a4 b4 Carryln Result4–7 a5 b5 ALU1 a6 b6 P1 pi + 1 a7 G1 gi + 1 b7 C2 ci + 2 a8 b8 a9 b9 Carryln Result8–11 ALU2 a10 b10 pi +2 gi + 2 P2 a11 G2 b11 C3 ci + 3 a12- b12 Carryln Result12–15 а13 b13 a14 b14 a15 b15 ALU3 pi + 3 gi + 3 P3 G3 C4 ci + 4 CarrvOut
B.27 [15] <§B.6> Write the equations for the carry- lookahead logic for a 64-bit adder using the new notation from Exercise B.26 and using 16-bit adders as building blocks. Include a drawing similar to Figure B.6.3 in your solution. B.28 [10] <$B.6> Now calculate the relative performance of adders. Assume that hardware corresponding to any equation containing only OR or AND terms, such as the equations for pi and gi on page B-40, takes one time unit T. Equations that consist of the OR of several AND terms, such as the equations for c1, c2, c3, and c4 on page B-40, would thus take two time units, 2T. The reason is it would take T to produce the AND terms and then an additional T to produce the result of the OR. Calculate the numbers and performance ratio for 4-bit adders for both ripple carry and carry lookahead. If the terms in equations are further defined by other equations, then add the appropriate delays for those intermediate equations, and continue recursively until the actual input bits of the adder are used in an equation. Include a drawing of each adder labeled with the calculated delays and the path of the worst-case delay highlighted. B.29 [15] <§B.6> This exercise is similar to Exercise B.28, but this time calculate the relative speeds of a 16-bit adder using ripple carry only, ripple carry of 4- bit groups that use carry lookahead, and the carry- lookahead scheme on page B-39. D 20 r151 Thi
Transcribed Image Text:B.27 [15] <§B.6> Write the equations for the carry- lookahead logic for a 64-bit adder using the new notation from Exercise B.26 and using 16-bit adders as building blocks. Include a drawing similar to Figure B.6.3 in your solution. B.28 [10] <$B.6> Now calculate the relative performance of adders. Assume that hardware corresponding to any equation containing only OR or AND terms, such as the equations for pi and gi on page B-40, takes one time unit T. Equations that consist of the OR of several AND terms, such as the equations for c1, c2, c3, and c4 on page B-40, would thus take two time units, 2T. The reason is it would take T to produce the AND terms and then an additional T to produce the result of the OR. Calculate the numbers and performance ratio for 4-bit adders for both ripple carry and carry lookahead. If the terms in equations are further defined by other equations, then add the appropriate delays for those intermediate equations, and continue recursively until the actual input bits of the adder are used in an equation. Include a drawing of each adder labeled with the calculated delays and the path of the worst-case delay highlighted. B.29 [15] <§B.6> This exercise is similar to Exercise B.28, but this time calculate the relative speeds of a 16-bit adder using ripple carry only, ripple carry of 4- bit groups that use carry lookahead, and the carry- lookahead scheme on page B-39. D 20 r151 Thi
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS