by, ajinkya karande adarsh yoga - computer science · tree that uses full adders known as wallace...
TRANSCRIPT
![Page 1: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/1.jpg)
By,Ajinkya Karande
Adarsh Yoga
![Page 2: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/2.jpg)
IntroductionEarly computer designers believed saving
computer time and memory were more important than programmer time.
Bug in the divide algorithm used in Intel chips.Basics of Integer/Floating point Addition,
Subtraction, Multiplication and Division algorithms
Refinements and variations on these algorithms
![Page 3: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/3.jpg)
Integer ArithematicHalf AdderSum : a XOR bCarry : a AND b
![Page 4: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/4.jpg)
Integer ArithematicFull Adder
Sum : a¬b¬c + ¬ab¬c +a¬bc + abcCarry : (a XOR b)c + ab
![Page 5: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/5.jpg)
Integer ArithematicRipple Carry Adder
![Page 6: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/6.jpg)
Integer Multiplication
![Page 7: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/7.jpg)
Integer MultiplicationUnsigned Multiplication:
1. LSB of A is 1, add B to P
2. Shift registers P and A right with carry-out ofthe sum being moved into the high-order bitof P, the low-order bit of P being moved inregister A.
![Page 8: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/8.jpg)
Integer Division
![Page 9: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/9.jpg)
Integer DivisionRestoring Division1. Shift register pair (P,A) one bit left.2. Subtract content of B from P3. If result in step 2. is negative, set Ao to zero
else to 14. If result in step 2. is negative, restore the old
value of P by adding the contents of B backin P
![Page 10: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/10.jpg)
Integer DivisionNon – Restoring DivisionIf P is negative
1.a Shift (P,A) pair one bit left2.a Add the contents of register B to P
Else,1.b Shift (P,A) pair one bit left2.b Subtract the contents of register B from P
3. If P is –ve, set the low order bit of A to zero else set it to one.
![Page 11: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/11.jpg)
Signed NumbersFour ways to represent signed numbers: Sign Magnitude One’s Complement Biased Two’s Complement Formula for Two’s Complement of a
number:-an-12 n-1 + an-22 n-2 + …. + a12 1 + a0
![Page 12: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/12.jpg)
Booth Recoding Examines the bits of a from the LSB to the
MSB For example, if a=7=0111 then the step 1 of
integer multiplication will successively add B, add B, add B and add 0.
Booth recoding “recodes” 7 as 8-1=1000-0001=1001
Works equally well for positive and negative numbers
![Page 13: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/13.jpg)
Booth RecodingIf the initial content of register A is an-1…a0 thenthe multiplication algorithm for signed numbers,
1. If Ai = 0 and Ai-1 = 0 add 0 to P2. If Ai = 0 and Ai-1 = 1 add B to P3. If Ai = 1 and Ai-1 = 0 subtract B from P4. If Ai = 1 and Ai-1 = 1 add 0 to P
Works because
![Page 14: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/14.jpg)
System IssuesOverflow:Three approaches to detect overflows in signed
arithmetic, Set bit on overflow. Trap on overflow. Do nothing.
No traps unsigned arithmetic since they are primarily used in manipulating addresses.
![Page 15: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/15.jpg)
System Issues Should the result of multiplication be a 2n bit
result? (or just return the lower order n bits?)Against: Virtually in all high level languages, the
result is of the same typeFor: Can be used to substantially speed up the
multiplication.
![Page 16: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/16.jpg)
System IssuesThree possible system-level approaches tospeeding up multiplication Single-cycle multiply step.Do integer multiplication in FPU.Have an autonomous unit in the CPU do the
multiplication.
![Page 17: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/17.jpg)
System IssuesDivision and remainder for negative numbers:Built-in hardware instructions should correspond
to what high-level languages specify.No agreement among existing programming
languages. Eg: -5 MOD 3, -5 DIV 3.
![Page 18: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/18.jpg)
Floating Point Arithmetic IEEE standard for FPA specifies single precision
(32 bits) and double precision (64 bits) floating point numbers.
Consists of an exponent and a significand. If e is the biased exponent and f is the value of
the fraction, then the number is 1.f*2e-127. Special values NaN, ∞, -∞.Denormal numbers to represent
result<1.0*2Emin.
![Page 19: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/19.jpg)
Floating Point Multiplication
FP multiplication consists of three stepsMultiplies the significands using ordinary integer
multiplication.Rounds the result to take care of the precision.Computes the new exponent.
![Page 20: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/20.jpg)
Rounding Algorithm
If MSB of P is 0, shift P left by 1 bit. If MSB of P is 1, then set s=s OR r and r=g where r is
the round bit, g is the guard bit and s is the sticky bit.
![Page 21: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/21.jpg)
Rounding Algorithm
![Page 22: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/22.jpg)
Floating Point AdditionTakes two inputs of p bits and returns a p-bit
result Ideal algorithm would first perform the addition
and then round the result to p bits
![Page 23: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/23.jpg)
Floating Point Addition Consider, two 6 bit numbers 1.10011 and 1.10001*2-5
Discarding the lower order bits of the second addend, we get
![Page 24: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/24.jpg)
Floating Point AdditionDesignate from the discarded bits, the MSB as g
(guard bit), the next MSB as r (round bit) and the logical OR of the remaining bits as s(sticky bit)
Round the sum using the Rounding Algorithm specified for multiplication.
In case of subtraction 2’s complement taken and the sum is computed as above.
![Page 25: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/25.jpg)
Floating Point DivisionApproach to compute division converges to the
quotient using an iterative technique called Newton’s iteration.
Cast the problem as finding the zero of a function.
![Page 26: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/26.jpg)
Floating Point Division If xi is the guess at zero,
The equation has zero at
By recasting zero as finding zero of a function, f(x)=x-1-b. Hence f ’(x)=-1/x2
![Page 27: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/27.jpg)
Floating Point DivisionNow a/b is computed by Scale b in the range 1≤b<2 and get an
approximate value of 1/b. Iterate xi+1=xi(2-xib) until it is accurate enough
(xn).Compute axn and reverse the scaling done.Iterate until, |(xi-1/b)/(1/b)|=2-p.
![Page 28: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/28.jpg)
More on Floating Point ArithmeticFused Multiply-AddMotivated by IBM RS/6000 which has an
instruction that computes ab+c the fused multiply-add.
Used to implement efficient floating-point multiple precision packages.
![Page 29: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/29.jpg)
ExceptionsFive types1. Underflow2. Overflow3. Divide by zero4. Inexact5. Invalid
![Page 30: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/30.jpg)
ExceptionsUnderflow:Underflow occurs when there is loss of accuracy It is set whenever the delivered result is different
from what would be delivered in a system with the same fraction size.
Overflow:Occurs when the result of an arithmetic
operation is too large to hold.
![Page 31: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/31.jpg)
ExceptionsDivide by Zero:Occurs when the divisor is zeroInexact: If there was a result that couldn’t be represented
exactly and had to be rounded, inexact is signaled.
Invalid: If the arithmetic operation results in NAN
![Page 32: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/32.jpg)
Speeding Up Integer AdditionCarry-LookaheadThe ith sum will be
Rewriting ci in terms of ai and bi
![Page 33: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/33.jpg)
Speeding Up Integer Addition
![Page 34: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/34.jpg)
Speeding Up Integer AdditionIt takes one logic level to form p and g, two levelsto form the carries and two for the sum in all fivelogic levels.Carry Lookahead idea is used to build an adderthat has log2n logic levels.c1 = g0 + c0p0
c2 = G01 + c0P01
G01 = g1 + p1g0
P01 = p1p0
![Page 35: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/35.jpg)
Speed Up Integer Addition
![Page 36: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/36.jpg)
Speed Up Integer Addition
![Page 37: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/37.jpg)
Speed Up Integer Addition
![Page 38: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/38.jpg)
Speed Up Integer AdditionCarry Skip Adder If any block generates carry, the carry-out of a
becomes trueThe carry-out from each least-significant block is
fed to AND gate with the P signal If carry-out and P signals both are true, then
carry skips the blockPractical only if carry-in signals are cleared at the
start of each operations
![Page 39: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/39.jpg)
Speed Up Integer Addition
![Page 40: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/40.jpg)
Speed Up Integer AdditionCarry-Select AdderPerforms two additions in parallel, with carry-in
as zero and carry-in as one
On determining final carry-in correct sum is selected
![Page 41: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/41.jpg)
Speeding Up Integer Addition
![Page 42: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/42.jpg)
Speeding Up Integer Addition
![Page 43: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/43.jpg)
Asymptotic time and space requirements
![Page 44: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/44.jpg)
Speeding Up Integer Multiplication and DivisionSRT Division1. If B has k leading zeros, shift all registers left by k bitsFor i = 0 to n-12.a. If top 3 bits of P are equal, Qi = 0, shift (P,A) one bit left2.b. If top 3 bits of P are not all equal and P is negative, set Qi
= -1, shift (P,A) one bit left, add B2.c. Otherwise set Qi = 1, shift (P,A) one bit left, subtract BEnd loop3. If remainder is –ve, correct by adding B and correct
quotient by subtracting 1 from Qo. Shift the remainder k bits right
![Page 45: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/45.jpg)
Speeding Up Integer Multiplication and Division
![Page 46: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/46.jpg)
Difference Between nonrestoringdivision and SRT divisionALU decision rule: In non-restoring it is
determined by sign of P, in SRT it is determined by two most significant bits of P
Final quotient: In non-restoring it is immediate from successive signs of P, in SRT there are three quotient digits (0,1,-1) and the final quotient is computed in full n-bit adder
Speed: SRT division will be faster on operands that produce zero quotient bits
![Page 47: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/47.jpg)
Speeding Up Integer Multiplication using single Adder Load sum and carry bits of P to zero Shift lower order sum bit of P into A n-1 high order bits of P are shifted to next lower-adder
in next cycle Two Drawbacks to carry-save adders
i. Requires more hardwareii. After last step higher order word must be fed into an ordinary adder to combine the sum and carry parts
Speedup without using extra adder is to examine k low order bits of A at each step than just one bit
![Page 48: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/48.jpg)
Speeding Up Integer Multiplication using single Adder
![Page 49: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/49.jpg)
Speeding Up Multiplication using single Adder
![Page 50: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/50.jpg)
Faster Multiplication with many Adders
![Page 51: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/51.jpg)
Faster Multiplication with many AddersAn array MultiplierLatency similar to carry-save adderMultiplication can be pipelined, increasing total
throughput Space available may not hold the array to
multiply two double precision numbers
![Page 52: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/52.jpg)
Faster Multiplication with many Adders
![Page 53: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/53.jpg)
Faster Multiplication with many AddersThe above design cannot be pipelinedArray has smaller latency than using single adder,
array is combinational circuit, signal flows directly without being clocked
Even/odd array design for speedupThe notion of running two adds in parallel
![Page 54: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/54.jpg)
Faster Multiplication with many Adders
![Page 55: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/55.jpg)
Faster Multiplication with many AddersEven/odd array has time of O(n)Can be reduced to logn using treeTree that uses full adders known as Wallace treeWallace tree was designed of choice for high
speed multipliersDue to irregular structure of Wallace trees, not
used in VLSI designs
![Page 56: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/56.jpg)
Faster Multiplication with many Adders
![Page 57: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/57.jpg)
ReferencesComputer Architecture - John L Hennessy,
David Patterson
Computer Organization Architecture – William Stallings
![Page 58: By, Ajinkya Karande Adarsh Yoga - Computer Science · Tree that uses full adders known as Wallace tree ... Computer Architecture - John L Hennessy, David Patterson](https://reader031.vdocument.in/reader031/viewer/2022022016/5b778c117f8b9a47518d597d/html5/thumbnails/58.jpg)
THANK YOU