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

Analysis of algorithms, Analysis of Algorithms For this task, each stu...

Analysis of Algorithms For this task, each student should do two things: An empirical analysis of the runtime and comparisons made for all algorithms as a function of input si

Where virtual memory is used, Where Virtual memory is used ? Ans. Virtu...

Where Virtual memory is used ? Ans. Virtual memory is utilized in all main commercial operating systems.

Explain about microcomputers, Q. Explain about Microcomputers? Microco...

Q. Explain about Microcomputers? Microcomputers: A microcomputer's CPU is a microprocessor. They are characteristically used as single usercomputer though present day microco

What is reducibility, What is reducibility?  The primary method of prov...

What is reducibility?  The primary method of proving some problems are computationally unsolvable.       It is known as reducibility. Reducibility always includes two problems

DW, Define a job scheduling strategy that will meet business requirement of...

Define a job scheduling strategy that will meet business requirement of reporting availability by 6am CST for the following cubes

Recursive binary search, The implementation of a (non-recursive) binary sea...

The implementation of a (non-recursive) binary search of an array. The assumption is that a given array is sorted. We want to see if a particular value, that we'll call the target

Direct addressing and immediate addressing mode , Direct Addressing and  I...

Direct Addressing and  Immediate Addressing mode - computer architecture:  Immediate Addressing: It is the simplest form of addressing. Here, the operand is itself given

Classifier with classes, Consider one versus the rest voting used for class...

Consider one versus the rest voting used for classifier with three classes {a, b, c}. Given a row of data denoted as x0 suppose that the classifier for a versus the rest predicts t

Find the minimum sop and pos expression, Q.  Find the minimum SOP and POS e...

Q.  Find the minimum SOP and POS expression for the following functions using K- Map and realize the expression using appropriate gates. Also realize SOP form using NAND-to-NAND ga

Simplify the boolean expression, Simplify the Boolean expression F = C(B + ...

Simplify the Boolean expression F = C(B + C)(A + B + C). Ans. Simplification of the given Boolean Expression F = C (B +C) (A+B+C) given as F = C (B+C) (A+B+C) = CB + CC [(A+B+C

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