Scribd
Upload
167 views

Notes U-2 EC2303 - Computer - Architecture - and - Organization - Lecture - Notes - Unit - 2

This document contains lecture notes from Anna University on the topic of data path design for computer architecture and organization. It discusses various algorithms for fixed point arithmetic operations like addition, subtraction, multiplication, and division. It describes combinational and sequential arithmetic logic units. Specific multiplication algorithms covered include booth's algorithm and modified booth's algorithm. It also briefly mentions floating point arithmetic, coprocessors, and pipeline processing.

Uploaded by

sathish
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
167 views

Notes U-2 EC2303 - Computer - Architecture - and - Organization - Lecture - Notes - Unit - 2

This document contains lecture notes from Anna University on the topic of data path design for computer architecture and organization. It discusses various algorithms for fixed point arithmetic operations like addition, subtraction, multiplication, and division. It describes combinational and sequential arithmetic logic units. Specific multiplication algorithms covered include booth's algorithm and modified booth's algorithm. It also briefly mentions floating point arithmetic, coprocessors, and pipeline processing.

Uploaded by

sathish
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 15

The KB for Engineering Students

EC2303 - Computer Architecture and Organization


UNIT II : DATA PATH DESIGN

Fixed Point Arithmetic, Addition, Subtraction, Multiplication and Division, Combinational and Sequential ALUs, Carry
look ahead adder, Robertson algorithm, booth's algorithm, non-restoring division algorithm, Floating Point Arithmetic,
Coprocessor, Pipeline Processing, Pipeline Design, Modified booth's Algorithm.

Anna University | B.E Electronics and Communication Engineering | Semester V | Lecture Notes
UNIT II : DATA PATH DESIGN EC2303 - Computer Architecture and Organization

UNIT – II
DATA PATH DESIGN

Anna University | B.E Electronics and Communication Engineering | Semester V 1


UNIT II : DATA PATH DESIGN EC2303 - Computer Architecture and Organization

Anna University | B.E Electronics and Communication Engineering | Semester V 2


UNIT II : DATA PATH DESIGN EC2303 - Computer Architecture and Organization

Multiplication

More complicated than addition


• Accomplished via shifting and addition
More time and more area
Let's look at 3 versions based on grade school algorithm
01010010 (multiplicand)
x 01101101 (multiplier)
Negative numbers: convert and multiply
Use other better techniques like Booth’s encoding

Anna University | B.E Electronics and Communication Engineering | Semester V 3


UNIT II : DATA PATH DESIGN EC2303 - Computer Architecture and Organization

Anna University | B.E Electronics and Communication Engineering | Semester V 4


UNIT II : DATA PATH DESIGN EC2303 - Computer Architecture and Organization

Anna University | B.E Electronics and Communication Engineering | Semester V 5


UNIT II : DATA PATH DESIGN EC2303 - Computer Architecture and Organization

Anna University | B.E Electronics and Communication Engineering | Semester V 6


UNIT II : DATA PATH DESIGN EC2303 - Computer Architecture and Organization

Signed Multiplication

The easiest way to deal with signed numbers is to first convert the multiplier and multiplicand to positive
numbers and then remember the original sign. It turns out that the last algorithm will work with signed
numbers provided that when we do the shifting steps we extend the sign of the product.

Speeding up multiplication (Booth’s Algorithm)

The way we have done multiplication so far consisted of repeatedly scanning the multiplier, adding the
multiplicand (or zeros) and shifting the result accumulated.

Observation:
if we could reduce the number of times we have to add the multiplicand that would make the all process
faster.
Let say we want to do:

Bxa where a=7ten=0111two


With the algorithm used so far we successively:

add b, add b, add b, and add 0

Booth’s Algorithm
Observation: If besides addition we also use subtraction, we can reduce the number of consecutives additions
and therefore we can make the multiplication faster.

This requires to ―
recode‖ the multiplier in such a way that the number of consecutive 1s in the multiplier
(indeed the number of consecutive additions we should have done) are reduced.

The key to Booth‘s algorithm is to scan the multiplier and classify group of bits into the beginning, the middle
and the end of a run of 1s

Using Booth’s encoding for multiplication

Anna University | B.E Electronics and Communication Engineering | Semester V 7


UNIT II : DATA PATH DESIGN EC2303 - Computer Architecture and Organization

If the initial content of A is an-1…a0 then i-th multiply step, the low-order bit of register A is
ai and step (i) in the multiplication algorithm becomes:
1. If ai=0 and ai-1=0, then add 0 to P
2. If ai=0 and ai-1=1, then add B to P
3. If ai=1 and ai-1=0, then subtract B from P
4. If ai=1 and ai-1=1, then add 0 to P
(For the first step when i=0, then add 0 to P)

Anna University | B.E Electronics and Communication Engineering | Semester V 8


UNIT II : DATA PATH DESIGN EC2303 - Computer Architecture and Organization

Division

Even more complicated can be accomplished via shifting and addition/subtraction


More time and more area we will look at 3 versions based on grade school algorithm

0011 | 0010 0010 (Dividend)

Negative numbers: Even more difficult There are better techniques, we won‘t look at them

Anna University | B.E Electronics and Communication Engineering | Semester V 9


UNIT II : DATA PATH DESIGN EC2303 - Computer Architecture and Organization

Anna University | B.E Electronics and Communication Engineering | Semester V 10


UNIT II : DATA PATH DESIGN EC2303 - Computer Architecture and Organization

Anna University | B.E Electronics and Communication Engineering | Semester V 11


UNIT II : DATA PATH DESIGN EC2303 - Computer Architecture and Organization

Anna University | B.E Electronics and Communication Engineering | Semester V 12


UNIT II : DATA PATH DESIGN EC2303 - Computer Architecture and Organization

Anna University | B.E Electronics and Communication Engineering | Semester V 13


UNIT II : DATA PATH DESIGN EC2303 - Computer Architecture and Organization

Anna University | B.E Electronics and Communication Engineering | Semester V 14

You might also like