Explain fixed arithmetic pipelines, Computer Engineering

Assignment Help:

Fixed Arithmetic pipelines

We take the illustration of multiplication of fixed numbers. Two fixed point numerals are added by ALU (Arithmetic and logic unit) using shift and add operations. This serial execution makes multiplication a slow process. If we look at the multiplication procedure carefully then we study that this is the procedure of adding the multiple copies of shifted multiplicands as displayed below:

1397_Fixed Arithmetic pipelines.png

Now we can recognize the subsequent phases for pipeline:

  • The first phase produces the partial product of the numbers that forms the six rows of shifted multiplicands.
  • In second phase the six numbers are specified to two CSAs merging into four numbers.
  • In third phase there is a single CSA merging numbers into 3 numbers.
  • In fourth phase there is a single number merging three numbers in 2 numbers.
  • In fifth stage the final two numbers are added by a CPA to obtain the final product.

These phases have been implemented by means of CSA tree as displayed in Figure below.

1080_Fixed Arithmetic pipelines 1.png

Figure: Arithmetic pipeline for Multiplication of two 6-digit fixed numbers


Related Discussions:- Explain fixed arithmetic pipelines

Describe the role of software developers, Describe the role of Software dev...

Describe the role of Software developers Software developers have wide experience of tackling such issues. Students who develop software project spending days and nights strug

Maximum number of nodes in a binary tree, The maximum number of nodes in a ...

The maximum number of nodes in a binary tree of depth 5 is 31 is the maximum number of nodes in a binary tree

Discuss the important characteristics of 8237, Question 1 Discuss the w...

Question 1 Discuss the working principle of an interrupt and hardware actions in interrupt handling 2 Discuss the important characteristics of 8237 3 Describe the format

A full binary tree with ''n'' non-leaf nodes, A full binary tree with 'n' n...

A full binary tree with 'n' non-leaf nodes have  2n+l nodes.

Explain executing request using message-passing architecture, Explain the E...

Explain the Executing Requests Using a Message-Passing Architecture Executing requests using a message-passing architecture requires good fundamental client-server programming

What do you mean by daisy chain, Q. What do you mean by Daisy chain? Th...

Q. What do you mean by Daisy chain? This scheme provides a hardware poll. With this scheme, an interrupt acknowledge line is chain by different interrupt devices. All I/O inter

Codevita test, provide answers for Luminous Jewels - The Polishing Game?

provide answers for Luminous Jewels - The Polishing Game?

What is the working set of a process, What is the working set of a process?...

What is the working set of a process? The set of pages that are referred by the method in the last "n", references, where "n" is called the window of the working set of the pro

Define pipeline speedup, Define pipeline speedup. S(m)=T(l)/T(m) Whe...

Define pipeline speedup. S(m)=T(l)/T(m) Where T(m) is the execution time for some target workload on an m-stage pipeline. T(l) is the execution time for some workload an

What are the steps include constructing a functional model, What are the St...

What are the Steps include constructing a Functional Model Recognize input and output values Build data flow diagrams which shows functional dependencies Explain

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