Professional Documents
Culture Documents
Apex Institute of Technology Computer Organization & Architecture (CST-281)
Apex Institute of Technology Computer Organization & Architecture (CST-281)
Apex Institute of Technology Computer Organization & Architecture (CST-281)
Sharanjit kaur
E9807
DISCOVER . LEARN . EMPOWER
Assistant Professor
1
CSE(AIT), CU
About Course
This course is introduced to 4th semester students of BE
Title Level
To have a good understanding of Understand &
various functional units of Remember
computer
To familiarize students with the Understand &
architectures of a CPU
Remember
To understand and design a basic Apply
computer system
3
Course Outcomes
• Understand the Design, Organization and Functionality Various Functional Units of Computer like
CPU (CU, ALU, Registers), Memory Organization, I/O Organization and Parallel Processors.
• Define different number systems, binary addition and subtraction, 2’s complement representation
and operations with this representation.
• Analysis of Central Processing Unit after learning Hardwired and Microprogrammed Architecture
of CU.
• Apply their Learning to Design a Basic Computer System.
• Explain the concept of stored program, role of operating system, Instruction sets and Addressing
modes and Demonstrate problems on Addressing modes
4
Contents to be Covered
• Multiplication-shift and add
• Booth’s Algorithm
Multiplication- Shift and add
• Assumptions: Program should take first and second numbers as
input to the program .
• Now it should implement certain logic to multiply 8 bit Numbers
using Add and Shift Method .
• Consider that one byte is present in the AL register and another byte
is present in the BL register.
• We have to multiply the byte in AL with the byte in BL.
6
Process
• Add number with itself and rotate the other number each time and
shift it by one bit to left along with carry.
• If carry is present add the two numbers.
• Initialize the count to 4 as we are scanning for 4 digits.
• Decrement counter each time the bits are added.
• The result is stored in AX. Display the result.
7
Example
• AL = 11 H, BL = 10 H, Count = 4
8
What is booth’s algorithm?
Booth's multiplication algorithm is an algorithm which
multiplies 2 signed or unsigned integers in 2's complement.
This approach uses fewer additions and subtractions than
more straightforward algorithms.
9
Points to remember(for unsigned)
Firstly take two registers Q and M
Load multiplicand and multiplier in this registers
For eg., In 4 * 5 , 4 is multiplicand and 5 is multiplier.
We also need third register A, which is initialize to 0(zero).
We also need a register to store carry bit resulting from
addition . Hence, we take one bit register Q-1
10
Contd.
Multiplicand(M) is added to register Q and the result is
stored in register A
Then all bits of the A,Q,Q-1 are shifted to the right one bit.
Depending upon last bit of Q and single bit of Q-1 following
arithmetic operations are performed.
11
Contd.
Possible arithmetic actions:
• 00 no arithmetic operation
• 01 add multiplicand to left half of product.
• 10 Subtract multiplicand from left half of product.
• 11 no arithmetic operation.
12
Source:https://www.slideshare.net/prochwani95/booths-algorithma014-a015
13
Source:https://www.slideshare.net/prochwani95/booths-algorithma014-a015)
14
Source:https://www.slideshare.net/prochwani95/booths-algorithma014-a015
15
Flow Chart
Source:https://www.slideshare.net/prochwani95/booths-algorithma014-a015)
16
Source:https://www.slideshare.net/prochwani95/booths-algorithma014-a015)
17
Source:https://www.slideshare.net/prochwani95/booths-algorithma014-a015)
18
Key Points
• Multiplication using Shift and add operations
• Booth’s Algorithm
19
References
• Text Books:
• Computer System Architecture M. M. Mano:, 3rd ed., Prentice Hall of India,
New Delhi, 1993.
• Computer Organization and Design: The Hardware/Software Interface, David
A. Patterson and John L. Hennessy.
• Computer Organization and Embedded Systems, Carl Hamacher.
20
Thank you
e-Mail: Sharanjit.e9807@cumail.in
21