Binary floating-point number range, Computer Engineering

Assignment Help:

Q. Binary floating-point number range?

Smallest Negative number

  Maximum mantissa and maximum exponent

    =    - (1 -2-24) × 2127

 Largest negative number

  Minimum mantissa and Minimum exponent

    = -0.5 × 2-128

 Smallest positive number 

    = 0.5 × 2-128

Largest positive number

    = (1 -2-24) × 2127

398_Binary floating-point number range.png

Figure: Binary floating-point number range for given 32 bit format

In floating point numbers basic transaction is between range of numbers and accuracy also known as precision of numbers. If we raise exponent bits in 32-bit format then range can be increased but accuracy of numbers would go down as size of mantissa would become smaller. Let's have an illustration that will elucidate term precision. Suppose we have one bit binary mantissa then we would be able to represent only 0.10 and 0.11 in normalised form as provided in above illustration (having an implicit 1). Values like 0.101, 0.1011 and so on can't be represented like complete numbers. Either they have to be estimated or truncated and would be represented as either 0.10 or 0.11. So it will produce a truncation or round off error. The higher the number of bits in mantissa better would be precision.

In case of floating point numbers for raising both precision and range more bits are required. This can be obtained by employing double precision numbers. A double precision format is generally of 64 bits.

Institute of Electrical and Electronics Engineers (IEEE) is a group that has created many standards in aspect of various aspects of computer has created IEEE standard 754 for floating-point representation and arithmetic. Fundamental aim of developing this standard was to facilitate portability of programs from one to another computer. This standard has resulted in growth of standard numerical capabilities in different microprocessors. This representation is displayed in figure below.

2060_Binary floating-point number range1.png

Figure: IEEE Standard 754 format


Related Discussions:- Binary floating-point number range

Explain two dimensional array, Explain two dimensional array In two dim...

Explain two dimensional array In two dimensional arrays, array is a pointer-to-pointer-to-data type.: at the first level, it points to a block of pointers, one for each row. Th

Define edge triggered d flip flop, Define Edge Triggered D flip-flop? D...

Define Edge Triggered D flip-flop? D latch has only two inputs C(control) and D(data). The operation of a D flip-flop is a lot simpler and it has only one input addition to the

What do you mean by instruction cycle, Q. What do you mean by instruction c...

Q. What do you mean by instruction cycle? We have considered the instruction execution in previous section. Now let's consider more about different types of instruction executi

Fully parallel associative processor (fpap), Fully Parallel Associative Pro...

Fully Parallel Associative Processor (FPAP):  This processor accepts the bit parallel memory organisation. FPAP has two type of this associative processor named as: Word Org

Write html code to accomplish the web page to insert frame, Write the HTML ...

Write the HTML code to accomplish the web page to insert the frame extending 300 pixels across the page from left side. The HTML code to accomplish the web page is given below

Define clock rate, Define clock rate? The clock rate is given by, R=1/P...

Define clock rate? The clock rate is given by, R=1/P, where P is the length of single clock cycle.

Define the difference between union and structure, Define the difference be...

Define the difference between union and structure The main difference between union and structure is the storage allocation. In Union , for each variable the compiler allocates

Illustrate header section of a device driver, Q. Illustrate Header section ...

Q. Illustrate Header section of a device driver? Header comprises information which allows DOS to identify the driver. It also comprises pointers which allow it to chain to ot

Explain wait for graph-resource request and allocation graph, Explain Wait ...

Explain Wait for graph (WFG) with Resource request and allocation graph (RRAG). WFG with RRAG: A graph G = (V,E) is termed as bipartite if V can be decomposed in two

Introduction to computers, explain classification of computers in detail.al...

explain classification of computers in detail.also explain various application areas of computers

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd