Fixed arithmetic pipelines, Computer Engineering

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

Posted Date: 3/4/2013 4:18:25 AM | Location : United States







Related Discussions:- Fixed arithmetic pipelines, Assignment Help, Ask Question on Fixed arithmetic pipelines, Get Answer, Expert's Help, Fixed arithmetic pipelines Discussions

Write discussion on Fixed arithmetic pipelines
Your posts are moderated
Related Questions
design a dfa which accept all the string over a and b ending with ab or ba

Define throughput?  Throughput in CPU scheduling is the number of processes that are completed per unit time. For long processes, this rate might be one process per hour; for s

Q. What is Input - Output Instructions? An I/O instruction is stored in memory of computer and is fetched as well as executed by processor producing an I/O-related command for

Question 1 What is modulation? Explain why is modulation required? 2 Briefly explain about ASK, FSK and PSK 3 Explain about the Nyquist Bandwidth and Nyquist Theorem 4

For the one who still has no idea about the BIOS on your PC, notice when you first turn on your PC or laptop a few screens pop up. It may be a logo such as DELL or HP or ASUS, Tyan

Explain 100 line exchange with two-motion line finders. Design: In such design, here are 24 line finders. When any of the 100 subscribers has to find access to any of the 24

What kinds of statements are present in an assembly language program? Discuss. An assembly program contains subsequent three types of statements: 1. Imperative statements: The

State the scope of security policy The scope of security policy depends on aspects such as the size of the Intranet site, type of information hosted on it, and the number of u

Define Rules for Reducing Karnaugh Maps? The rules for reducing Karnaugh Maps (k- maps) are as follows: All of the 1's in the Karnaugh Map are called as minterms. The

Write a program to read in a positive integer and check whether it is prime or not? /* Program to check whether a given number is prime or not*/] # include # include