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

Advantages on electronic payment system, Advantages on electronic payment s...

Advantages on electronic payment system It gives good security schemes.  Four necessary security requirements for safe e-payments are Authentication, Encryption, Integrity,

Describe _blank, Q. Describe _blank, _self, _parent and _top tags? Thes...

Q. Describe _blank, _self, _parent and _top tags? These all are attributes of tag. The below example describes each of these attributes. <

Show the foundation of ALU design, Q. Show the foundation of ALU design? ...

Q. Show the foundation of ALU design? The foundation of ALU design starts with micro-operation implementation. Thus let's first explain how bus can be used for Data transfer m

Extract data from tables without using the event ''get'', Is it possible to...

Is it possible to extract data from tables without using the event 'GET' in the report with an appropriate LDB. False.   You can extract data from tables using Select stateme

Dfd, Give a 5-minute presentation on your team''s solution

Give a 5-minute presentation on your team''s solution

What are single stage and multistage networks, What are single stage and mu...

What are single stage and multistage networks? Compare the strengths and weaknesses of each. OR List the major difference in single stage, two stages and three stage Netw

Level of any node of a tree, Level of any node of a tree is :- Its distanc...

Level of any node of a tree is :- Its distance from the root

Perfect induction, Any identity or equality in Boolean algebra, suchas de M...

Any identity or equality in Boolean algebra, suchas de Morgan's Theorem can be proved usingthe method of perfect induction. 1. All combinations of variables are written down.

Describe about the layered computer design, Describe about the Layered comp...

Describe about the Layered computer design Introduction Layered computer design focuses on computer design. It uses top-down, layered approach to design and also to improve

Explain direct memory access, Explain Direct Memory Access. A modest en...

Explain Direct Memory Access. A modest enhances in hardware enables an IO device to transfer a block of information to or from memory without CPU intervention. This task needs

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