Fixed arithmetic pipelines, Computer Engineering

Assignment Help:

Fixed Arithmetic pipelines

 We obtain the example of multiplication of fixed numbers. The Two fixed-point numbers are added by the ALU using shift and add operations. This sequential implementation makes the multiplication a slow process. If we seem at the multiplication process cautiously, then we examine that this is the process of adding the multiple copies of shifted multiplicands as given below:

                                  10_Fixed Arithmetic pipelines.png

Now, we can signify the following phases for the pipeline:

  • The first stage produces the partial product of the numbers, which shows the six rows of shifted multiplicands.
  • In the second phase, the six numbers are given to the two CSAs merging into four numbers.
  • In the third stage, there is a one CSA merging the numbers into 3 numbers.
  • In the fourth stage, there is a one number merging three numbers into 2 numbers.
  • In the fifth stage, the final two numbers are added through a CPA to get the last product.

These phases have been implemented using CSA tree as shown in Figure:-

                                                       2015_Fixed Arithmetic pipelines 1.png

 

                                  Arithmetic pipeline for Multiplication of two 6-digit fixed numbers


Related Discussions:- Fixed arithmetic pipelines

What are the simplest way to restrict the users, What are the simplest way ...

What are the simplest way to restrict the users The simplest way to restrict the users to peek inside the internals of the Web site is to use firewalls, where the information c

Network topology, According to the report, network 1 and network 2 are not ...

According to the report, network 1 and network 2 are not able to reach network 3. As shown on OTBNetwork Topology above, OTB Inc. has 2 routing protocols running due transition iss

First-order inference rules - artificial intelligence, First-Order Inferenc...

First-Order Inference Rules -artificial intelligence: Now we have a perfect definition of a first-order model is,in the same way, we may define soundness for first-order infere

Explain message, Differentiate between message switching, packet switching ...

Differentiate between message switching, packet switching and circuit switching Message switching: Recourse computer sends data to switching office that stores the data in

Difference between finite automata and turing machine, What are the differe...

What are the difference between finite automata and Turing Machines?  Turing machine can alter symbols on its tape, while the FA cannot change symbols on tape.  Also  TM  has  a

Boolean algebra, Boolean algebra. Boolean algebra mathematical method ...

Boolean algebra. Boolean algebra mathematical method based on human reasoning. In Boolean algebra only two states exist; true and false which are written as 1 (true) and 0 (fa

What is XML DTD (Document Type Definition), What is XML DTD (Document Type ...

What is XML DTD (Document Type Definition)? DTD is a document which defines legal building blocks of a particular XML document. This defines the document structure along with

Explain what are user controls, Briefly explain what user controls are and ...

Briefly explain what user controls are and what server controls are and the differences between the two.   An ASP.NET control (sometimes known as a server control) is a server-

Explain the typical organization of a computer, Q. Explain the typical orga...

Q. Explain the typical organization of a computer? There are two principal components: hardware and software. The former refers to physical components such as memory unit (MU),

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