Floating point arithmetic pipelines, Computer Engineering

Assignment Help:

Floating point Arithmetic pipelines

Floating point computations are the finest candidates for pipelining. Take the instance of addition of two floating point numbers. Following phases are identified for the addition of two floating point numbers:

  • First phase will compare the exponents of the two numbers.
  • Second phase will look for alignment of mantissas.
  • Third phase, mantissas are added.
  • In the last phase, the result is normalized.

These phases are given below:-

                                         1393_Floating point Arithmetic pipelines.png

                                            Arithmetic Pipeline for Floating point addition of two numbers


Related Discussions:- Floating point arithmetic pipelines

Path & Path Production, Take the following flow graph and use the procedure...

Take the following flow graph and use the procedure in chapter 8 to derive an equivalent regular expression. Show all intermediate graphs (to ensure that you follow the procedure,

Explain sequential sharing, Explain Sequential sharing. Sequential s...

Explain Sequential sharing. Sequential sharing: In this technique of sharing, a file can be shared through only one program at a time, it is file accesses by P1 and P2 are

Relation ship, what is relationship among objects in software engineering??...

what is relationship among objects in software engineering??

What is an unsigned integer constant, What is an unsigned integer constant?...

What is an unsigned integer constant? An integer constant is the number in the range of - 32768 to + 32767; because an integer constant always gets two bytes in memory and in t

Two methods of copying a information document, There are basically two meth...

There are basically two methods of copying: Photocopying This is a modified development of photography. It is quite expensive and slow and is not often used for routine rep

Explain the boolean equations for logic circuits, Explain The Boolean Equat...

Explain The Boolean Equations for Logic Circuits? A Boolean equation is the mathematical representation of a logic circuit using standard Boolean terms. All the logic gates (AND,

Result extends to functions - perceptrons, Result extends to functions - pe...

Result extends to functions - perceptrons: Thus the dotted lines can be seen as the threshold in perceptrons: whether the weighted sum, S, falls below it, after then the perce

PADOVAN STRING, write a program that counts the number of occurrences of th...

write a program that counts the number of occurrences of the string in the n-th Padovan string P(n)

Explain concurrent sharing, Explain Concurrent sharing. Concurrent s...

Explain Concurrent sharing. Concurrent sharing: Some number of programs may share a file concurrently. While this is the case, this is essential to ignore mutual interferen

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