Scribd
Upload
12 views

Computer Organisation

The document discusses different number representation techniques used in computing such as binary, decimal, hexadecimal and octal number systems. It then focuses on floating point number representation which uses a sign bit, exponent and mantissa to represent numbers. It also describes arithmetic operations on floating point numbers like addition, subtraction, multiplication and division.

Uploaded by

Omkar Jha
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
12 views

Computer Organisation

The document discusses different number representation techniques used in computing such as binary, decimal, hexadecimal and octal number systems. It then focuses on floating point number representation which uses a sign bit, exponent and mantissa to represent numbers. It also describes arithmetic operations on floating point numbers like addition, subtraction, multiplication and division.

Uploaded by

Omkar Jha
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/ 4

Introduction

To represent all forms of information inside digital computers, the


binary number system is used. Binary bits are used to represent
alphanumeric characters (i.e., 0 and 1). Digital representations are
easier to develop, store, and produce with more accuracy and
precision.
For digital number representation, there are several sorts of number
representation approaches, such as the hexadecimal number system,
binary number system, decimal number system, and octal number
system.
In modern computing, there are two basic techniques for storing real
numbers (i.e., numbers containing a fractional component).
Fixed Point Notation and Floating-Point Notation are the two. The
number of digits after the decimal point in fixed-point notation is
fixed, whereas the number of digits after the decimal point in floating-
point notation is variable.
Floating-Point Representation

The integer and fractional parts of this format are not given a specified
number of bits. Instead, it sets aside a particular number of bits for the
number (known as the mantissa) and another number of bits to indicate
where the decimal place is inside that number (called the exponent) and the
first bit is represented as the sign of the number.

The first part of the floating-point representation of data can be defined as


the mantissa. The exponent is the second portion that designates the decimal
(or binary) point’s position. A fraction of an integer can be used as the fixed
point mantissa. A number in the following form is always understood as a
floating-point number: Mxre.

Sign of Number : (S) Exponent : (E) Mantissa : (M)

0 signifies + & 1 signifies - 8-bit signed exponent in excess 23-bit fraction

Value represented = +-1.M*2E-127


A. Single Precision

Sign of Number : (S) Exponent : (E) Mantissa : (M)

0 signifies + & 1 signifies - 11-bit signed exponent in excess 52-bit fraction

Value represented = +-1.M*2E-1023


B. Double Precision
Arithmetic Operations on Floating-Point Number
The rule for addition and subtraction can be stated as follows :
Add/Subtract Rule
1. Choose the number with the smaller exponent and shift it’s mantissa right a

number of steps equal to the difference in exponents.

2. Set the exponent of the result equal to larger exponent.

3. Perform addition/subtraction on the mantissas and determine the sign of the

result.

4. Normalize the result, if necessary.

Multiply Rule
1. Add the exponents and subtract 127.

2. Multiply the mantissas and determine the sign of the result.

3. Normalize the result, if necessary.

Divide Rule
1. Subtract the exponents and add 127.

2. Divide the mantissas and determine the sign of the result.

3. Normalise the result, if necessary.

Example :
The floating-point representation pattern is 0 10000000 110 0000 0000 0000 0000 0000.

Solution : Sign bit S = 0 ⇒ positive number E = 1000 0000B = 128D (in normalized form)

Fraction is 1.11B (with an implicit leading 1) = 1 + 1×2^-1 + 1×2^-2 = 1.75D

The number is +1.75 × 2^(128-127) = +3.5D.


Conclusion

The great dynamic range of floating-point representation in computer


organisation simplifies the design and programming of numerical
operations. In the case of fixed-point representations, however, it limits the
available accuracy and makes operation implementation slower and more
difficult. Furthermore, because it avoids the requirement for particular
scaling methods, it may lead to disappointing outcomes in uninformed users.

You might also like