Answered step by step
Verified Expert Solution
Question
1 Approved Answer
Draw a carry save adder tree using 3 : 2 counters ( i . e . . full adders ) are building blocks ( wallace
Draw a carry save adder tree using
:
counters
i
e
full adders
are building blocks
wallace tree
to accumulate partial products in the multiplication of two operands in the two complement format, where each operand is
bit long. Assume that radix
Booth recoding is used. How many levels are there in the tree?, what is the length of the final CPA
in terms of the number of digit positions across which the carry needs to propagate?, Let the delay of each
level be triangle
:
then what is the total delay required by the tree to reduce the summation of partial products down to two operand,
excluding the delay of booth
recoding
Now draw another tree based on the
compressors What is the length of final carry
propagate adder? Let the delay of each level be triangle
:
Then what is the total delay of the tree? Derive conditions relating triangle
:
and triangle
:
under which
a
The wallace Tree is faster and
b
The
:
compressor tree is faster
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started