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

What is self reference, What is self reference?  The Turing machine tha...

What is self reference?  The Turing machine that ignores its input and prints out a copy of its own description,   we call this as SELF. There is a computable function q: €*€*,

What is partition, What is partition? Partitions divide a system into s...

What is partition? Partitions divide a system into several independent or weakly coupled subsystems, each giving one kind of service. Partitions use peer-peer subsystems.

Data structure, what are the fundamental data structures

what are the fundamental data structures

What is write-back or copy-back protocol, What is write-back or copy-back p...

What is write-back or copy-back protocol? For a write operation using this protocol during write-hit: the method is to update only the cache and to mark it as updated with an a

Explain half-adder with truth-table and logic diagram, What is a half-adder...

What is a half-adder? Explain a half-adder with the help of truth-table and logic diagram. Ans. Half Adder: It is a logic circuit for the addition of two 1-bit numbers is term

Propositional logic - artificial intelligence, Propositional Logic - artifi...

Propositional Logic - artificial intelligence: This is a limited logic, which permit  us to write sentences about propositions - statements about the world - which can either b

Computer graphics, explain area sub division method algorithm

explain area sub division method algorithm

How to write good assembly programs, Preparation of writing the program ...

Preparation of writing the program 1.  Write an algorithm for your program closer to assembly language. For instance the algorithm for preceding program will be: get NUM1

Hiring problem algorithm, Consider the Hire Assistant problem. We interview...

Consider the Hire Assistant problem. We interview n candidates and always hire the best qualified so far. Let n = 5 for our example. Find the probabilities that we hire exactly 1 t

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