Successfully reported this slideshow.
We use your LinkedIn profile and activity data to personalize ads and to show you more relevant ads. You can change your ad preferences anytime.
Computer Arithmetic
 Prepared by:
 Buddha Shrestha
 Devendra Bhandari
 Diasy Dongol
• Arithmetic means the operation with operand.
– Like
• ADDITION ( + )
• SUBTRACTION ( - )
• MULTIPLICATION ( * )
• DIVIDE...
Eight Conditions for Signed-
Magnitude Addition/Subtraction
Operation
ADD
Magnitudes
SUBTRACT Magnitudes
A > B A < B A = B...
Hardware for signed-magnitude
addition and subtraction
A register
AVF
E
Bs
AS
B register
Complementer
Parallel Adder
S
Loa...
Add
operation
≠ 0 =0
A>=B
As = BS
=0=1
Augend in A
Added in B
END
As BS+
EA A + B
AVF E
EA A + B +1
AVF 0
E
A
As 0
A A
A A...
• For Example of Addition
• (+1) + (+2)
(+A) + (+B)
Add
operation
≠ 0 =0
A>=B
As = BS
=0=1
Augend in A
Added in B
END
As BS+
EA A + B
AVF E
EA A + B +1
AVF 0
E
A
As 0
A A
A A...
• (-1) + (+2)
(-A) + (+B)
Add
operation
≠ 0 =0
A>=B
As = BS
=0=1
Augend in A
Added in B
END
As BS+
EA A + B
AVF E
EA A + B +1
AVF 0
E
A
As 0
A A
A A...
• For Example of Subtraction
• (+1) - (-2)
(+A) - (-B)
As ≠ BS
Subtract
operation
≠ 0 =0
A>=B
As = BS
=0 =1
Miuend in A
Subtrahend in B
END
As BS+
EA A + B
AVF E
EA A + B +1
AVF...
• (+5) – (+2)
(+A) – (+B)
As ≠ BS
Subtract
operation
≠ 0 =0
A>=B
As = BS
=0 =1
Miuend in A
Subtrahend in B
END
As BS+
EA A + B
AVF E
EA A + B +1
AVF...
Figure: Hardware for signed-2’s
complement addition and subtraction.
BR register
Complementer and
parallel adder
AC regist...
Subtract
Figure: Algorithm for adding and subtracting numbers
in signed-2’s complement representation.
Add
Augend in AC
Ad...
Figure: Hardware for multiply operation
Bs
B register Sequence counter (SC)
Complementer
and parallel adder
A register Q r...
SC
Qn
Multiply operation
Multiplicand in B
Multiplier in Q
As Qs Bs
Qs Qs Bs
A 0,E 0
SC n-1
EA A + Bshr EAQ
SC SC-1
END
(p...
BOOTH MULTIPLICATION
ALGORITHM
 Introduction
 Hardware for Booth Algorithm
 Booth Algorithm for multiplication of signe...
INTRODUCTION
 multiplication algorithm that multiplies two
signed binary numbers in two's complement
notation.
 was inve...
Hardware for Booth Algorithm
Sign bits are not separated
from the rest of the
registers
rename registers A,B, and
Q as A...
Booth Algorithm for
multiplication of signed 2’s
complement numbers
= 10
=00
=11
Multiplicand in BR
Multiplier in QR
AC<-0
Qn+1<-0
SC<-n
Qn
Qn+1
AC<-AC+BR+1 AC<-AC+BR
ASHR(AC & QR)
SC<-SC-1
...
Computer arithmetic
Computer arithmetic
Upcoming SlideShare
Loading in …5
×
Upcoming SlideShare
Computer arithmetic
Next
Download to read offline and view in fullscreen.

7

Share

Download to read offline

Computer arithmetic

Download to read offline

Related Books

Free with a 30 day trial from Scribd

See all

Computer arithmetic

  1. 1. Computer Arithmetic  Prepared by:  Buddha Shrestha  Devendra Bhandari  Diasy Dongol
  2. 2. • Arithmetic means the operation with operand. – Like • ADDITION ( + ) • SUBTRACTION ( - ) • MULTIPLICATION ( * ) • DIVIDE ( / )
  3. 3. Eight Conditions for Signed- Magnitude Addition/Subtraction Operation ADD Magnitudes SUBTRACT Magnitudes A > B A < B A = B (+A) + (+B) + (A + B) (+A) + (-B) + (A – B ) - (B – A ) + (A – B ) (-A) + (+B) - (A – B ) + (B – A ) + (A – B ) (-A) + (-B) - ( A + B) (+A) - (+B) + (A – B ) - (B – A ) + (A – B ) (+A) - (-B) + (A + B) (-A) - (+B) - ( A + B) (-A) - (-B) - (A – B ) + (B – A ) + (A – B ) 1 2 3 4 5 6 7 8
  4. 4. Hardware for signed-magnitude addition and subtraction A register AVF E Bs AS B register Complementer Parallel Adder S Load Sum M Mode Control Input Carry Output Carry
  5. 5. Add operation ≠ 0 =0 A>=B As = BS =0=1 Augend in A Added in B END As BS+ EA A + B AVF E EA A + B +1 AVF 0 E A As 0 A A A A+1 As As As ≠ BS =0 =1 A<B
  6. 6. • For Example of Addition • (+1) + (+2) (+A) + (+B)
  7. 7. Add operation ≠ 0 =0 A>=B As = BS =0=1 Augend in A Added in B END As BS+ EA A + B AVF E EA A + B +1 AVF 0 E A As 0 A A A A+1 As As As ≠ BS =0 =1 A<B
  8. 8. • (-1) + (+2) (-A) + (+B)
  9. 9. Add operation ≠ 0 =0 A>=B As = BS =0=1 Augend in A Added in B END As BS+ EA A + B AVF E EA A + B +1 AVF 0 E A As 0 A A A A+1 As As As ≠ BS =0 =1 A<B
  10. 10. • For Example of Subtraction • (+1) - (-2) (+A) - (-B)
  11. 11. As ≠ BS Subtract operation ≠ 0 =0 A>=B As = BS =0 =1 Miuend in A Subtrahend in B END As BS+ EA A + B AVF E EA A + B +1 AVF 0 E A As 0 A A A A+1 As As =0 =1 A<B
  12. 12. • (+5) – (+2) (+A) – (+B)
  13. 13. As ≠ BS Subtract operation ≠ 0 =0 A>=B As = BS =0 =1 Miuend in A Subtrahend in B END As BS+ EA A + B AVF E EA A + B +1 AVF 0 E A As 0 A A A A+1 As As =0 =1 A<B
  14. 14. Figure: Hardware for signed-2’s complement addition and subtraction. BR register Complementer and parallel adder AC register V Overflow
  15. 15. Subtract Figure: Algorithm for adding and subtracting numbers in signed-2’s complement representation. Add Augend in AC Addend in BR AC AC + BR V overflow END Minuend in AC Subtrahend in BR AC AC + BR + 1 V overflow END
  16. 16. Figure: Hardware for multiply operation Bs B register Sequence counter (SC) Complementer and parallel adder A register Q register As E Qs (rightmost bit) Qn 0
  17. 17. SC Qn Multiply operation Multiplicand in B Multiplier in Q As Qs Bs Qs Qs Bs A 0,E 0 SC n-1 EA A + Bshr EAQ SC SC-1 END (products is in AQ) = 0 = 0 = 1 ≠ 0 Figure: Flowchart for multiply operation.
  18. 18. BOOTH MULTIPLICATION ALGORITHM  Introduction  Hardware for Booth Algorithm  Booth Algorithm for multiplication of signed 2’s complement numbers
  19. 19. INTRODUCTION  multiplication algorithm that multiplies two signed binary numbers in two's complement notation.  was invented by Andrew Donald Booth in 1950  used desk calculators that were faster at shifting than adding and created the algorithm to increase their speed is of interest in the study of computer architecture.
  20. 20. Hardware for Booth Algorithm Sign bits are not separated from the rest of the registers rename registers A,B, and Q as AC,BR and QR respectively Qn designates the least significant bit of the multiplier in register QR Flip-flop Qn+1 is appended to QR to facilitate a double bit inspection of the multiplier BR register Sequence COUNTER (SC) Complementer and parallel adder AC register QR register Qn Qn+1
  21. 21. Booth Algorithm for multiplication of signed 2’s complement numbers
  22. 22. = 10 =00 =11 Multiplicand in BR Multiplier in QR AC<-0 Qn+1<-0 SC<-n Qn Qn+1 AC<-AC+BR+1 AC<-AC+BR ASHR(AC & QR) SC<-SC-1 SC END Multiply ≠ 0 = 0 = 01
  • MotheRakesh1

    Aug. 20, 2018
  • besh22

    Mar. 24, 2018
  • yashjagan

    Nov. 27, 2017
  • shivagupta26

    Jul. 12, 2017
  • Buddhans

    Feb. 3, 2017
  • krishnashah41

    May. 1, 2016
  • PrasannakumarReddy3

    May. 16, 2015

Views

Total views

6,530

On Slideshare

0

From embeds

0

Number of embeds

2

Actions

Downloads

328

Shares

0

Comments

0

Likes

7

×