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

Explain tree, Tree (recursive definition) A tree is a finite set of one...

Tree (recursive definition) A tree is a finite set of one or more than one nodes such that. (1) There is a specially designated node known as the root. (2) The left over

Show basic concepts of permutation, Q. Show Basic concepts of permutation? ...

Q. Show Basic concepts of permutation? Let us look at the basic concepts of permutation with respect to interconnection network.  Let us say the network has set of n input node

Decomposition model of parallel programming, The PVM system supports functi...

The PVM system supports functional and data decomposition model of parallel programming. It attaches with C, C++, and FORTRAN. The C and C++ language bindings for the PVM user inte

Design a memory buffer of limited size, Extend task 1 so that it now suppor...

Extend task 1 so that it now supports a memory buffer of limited size. Provide the same functionality as task 1 except now make the server work with a limited buffer size. Like

Find minimal expression for sop. draw gate network, Q Consider the followin...

Q Consider the following expression. Assume that complement inputs are available. F(A,B,C,D) = ∑m (1,2,6,9,10,14) + ∑d (4,7,8,11,12) a. Find minimal expression for SOP. Draw

Explain the operation of 8:1 multiplexer, Explain the operation of 8:1 mult...

Explain the operation of 8:1 multiplexer. Ans: In this multiplexer 8 Input and 1 Output and three select lines i.e. S 2 , S 1 , S 0 are given. Any one of the inputs will be

What are the data types of vhdl, What are the Data types of VHDL VHDL....

What are the Data types of VHDL VHDL. A multitude of language or user defined data types can be used. This may mean dedicated conversion functions are needed to convert object

What are different normalization forms, What are different normalization fo...

What are different normalization forms? 1NF: Eliminate Repeating Groups Make a separate table for every set of related attributes, and give each table a primary key. Each fie

Draw the circuit diagram of a Master-Slave J-K flip-flop, Draw the circuit ...

Draw the circuit diagram of a Master-slave J-K flip-flop using NAND gates. What is race around condition? How is it eliminated in a Master-slave J-K flip-flop? Ans. Using NA

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