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

Hardware implementation for signed-magnitude data, Hardware Implementation ...

Hardware Implementation for signed-magnitude data When multiplication  is  implemented  in  digital  computer,  we  change  process lightly. Here, in place of providing registe

How can system improved when free lines are available, How can system impro...

How can system improved if one arrive at the probability of availability of free lines during the busy hour? Improvement can be made when the system is act as a loss system in

How can you pass a struct by reference in e, How can you pass a struct by r...

How can you pass a struct by reference in e?   The question is phrased in a tricky way because passing by reference is the default and only possible way to pass structs in e. I

Pseudocode, 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1

1 1 1 1 2 1 1 3 3 1 1 4 6 4 1

Kirchoff''s voltage law , Kirc hoff's Voltage Law   The sum ...

Kirc hoff's Voltage Law   The sum of all the voltage drops around a closed circuit loop will add to zero  V1+(-V2)+(-V3)+(-V4)= 0

Demonstrate arc consistency, Demonstrate Arc consistency: To demonstra...

Demonstrate Arc consistency: To demonstrate the worth of performing an arc-consistency check before starting a serarch for a solution, we'll use an example from Barbara Smith'

What is performance testing in loadrunner, Timing for both read and update ...

Timing for both read and update transactions should be gathered to verify whether system functions are being performed in an acceptable timeframe. This should be done standalone an

the bias and standard error , A random variable (X) is modelled as an expo...

A random variable (X) is modelled as an exponentially distributed with mean 30 units. Simulate N = 50 samples from this distribution, and every sample must have m = 20 simulated va

What are the disadvantages of fcfs scheduling algorithm, What are the disad...

What are the disadvantages of FCFS scheduling algorithm as compared to shortest job first (SJF) scheduling? Disadvantages: (i) Waiting time can be huge if short requests w

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