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

What are escape sequences characters, What are escape sequences characters?...

What are escape sequences characters? List any six of them.  The characters which when used with output functions like printf( ),putc(),put() etc. helps in formatting the outpu

Binary resolution, Binary Resolution: However we saw unit resolution f...

Binary Resolution: However we saw unit resolution for a propositional inference rule in the previous lecture:  (A?  B,   ¬B) /A Thus we can take this a little further to

Illustrated three stages of data mining process, Illustrated three stages o...

Illustrated three stages of data mining process? Stage 1: Exploration: This stage generally starts along with data preparation that may involve cleaning data, selecting subse

Hardware interrupts - computer architecture, Hardware interrupts: Har...

Hardware interrupts: Hardware interrupts -from I/O devices, processor, memory Software interrupts-produced by a program. Direct Memory Access (DMA)  Interrupt or Poll

What is a sap system, What is a SAP system? The union of all s/w compo...

What is a SAP system? The union of all s/w components that are assigned to the similar databases is known as a SAP system.

Implement that function using only nand gates, Q. Find simplified function ...

Q. Find simplified function F and implement that function using only NAND gates. 1.  F(A,B,C) = (A+B) (A'+B+C') (A'+B'+C') 2.  F (A,B,C,D) = A'B'C'+B'CD'+A'BCD'+AB'C' 3.

What is reification and behaviour, What is reification and behaviour? R...

What is reification and behaviour? Reification is the promotion of something that is not an object into an object. Behavior usually requires this description. It isn't usually

What is downcasting in programming, Downcasting concept is the casting from...

Downcasting concept is the casting from a general to a more particular type, i.e. casting down the hierarchy in programming

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