Scribd
Upload
19 views15 pages

Module 4 Data Representation

The document discusses Booth’s Multiplication Algorithm for multiplying signed binary integers and outlines the processes of restoring and non-restoring division. It also covers the IEEE 754 floating-point number representation standard, detailing its components, sizes, and the significance of biased exponents and normalized mantissas. Additionally, it includes examples of finding the IEEE 754 representation for specific decimal numbers.

Uploaded by

Deep Pandey (Prasad pandey)
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
19 views15 pages

Module 4 Data Representation

The document discusses Booth’s Multiplication Algorithm for multiplying signed binary integers and outlines the processes of restoring and non-restoring division. It also covers the IEEE 754 floating-point number representation standard, detailing its components, sizes, and the significance of biased exponents and normalized mantissas. Additionally, it includes examples of finding the IEEE 754 representation for specific decimal numbers.

Uploaded by

Deep Pandey (Prasad pandey)
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

Module 4: Data Representation and Arithmetic Algorithms

Booth’s Multiplication Algorithm


• Booth algorithm gives a procedure for multiplying binary integers in
signed 2’s complement representation.
• It operates on the fact that strings of 0’s in the multiplier require no
addition but just shifting and a string of 1’s in the multiplier from bit
weight 2k to weight 2m can be treated as 2(k+1) to 2m.
Example -9 X -13 = + 117
Division of integers: Restoring and non-restoring division
Restoring Division:
Non-restoring division
Signed Division
IEEE 754 floating point number representation
Floating Point Standard
• Defined by IEEE Std 754-1985
• Developed in response to divergence of representations
• Portability issues for scientific code
• It defines 4 main sizes of floating-point numbers
• 16, 32, 64 and 128 bit
• Sometimes referred to as Half, Single, Double and Quadruple
precision
• Two commonly used representations
• Single precision (32-bit)
• Double precision (64-bit)
IEEE 754 has 3 basic components:
• The Sign of Mantissa
• 0 represents a positive number
• 1 represents a negative number.
• The Biased exponent
• The exponent field needs to represent both positive and negative
exponents.
• A bias is added to the actual exponent in order to get the stored
exponent.
• excess representation = actual exponent + Bias (Ensures exponent
is unsigned)
• The Normalized Mantissa
• The mantissa is part of a number in scientific notation or a floating-
point number, consisting of its significant digits.
• Here we have only 2 digits, i.e. 0 and 1. So a normalized mantissa
is one with only one 1 to the left of the decimal.
find the IEEE 754 32-bit floating-point representation for −7.7510

find the IEEE 754 32-bit floating-point representation for −0.12510


IEEE reserved values

You might also like