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

Carry look-ahead adder and booth''s algorithm, Describe carry look-ahead ad...

Describe carry look-ahead adder? Ans: The input carry required by a stage is directly computed from carry signals obtained from all of the preceding stages i-1,i-2,.....0, rat

Send a report to the printer, How to send a report to the printer instead o...

How to send a report to the printer instead of displaying it on the screen? We can send a report to the printer instead of displaying it on the screen.  To do this, use the key

Design a 4:1 mux in verilog, Design a 4:1 mux in Verilog   Mult...

Design a 4:1 mux in Verilog   Multiple styles of coding. e.g. Using if-else statements if(sel_1 == 0 && sel_0 == 0) output = I0; else if(sel_1 == 0 && sel_0 ==

Explain the edge-triggered j-k flip-flop, Explain the Edge-triggered J-K fl...

Explain the Edge-triggered J-K flip-flop? The J-K flip-flop works extremely similar to S-R flip-flop. The merely difference is that this flip-flop has NO invalid state.

Explain the design procedure for flip flop, Explain the Design Procedure fo...

Explain the Design Procedure for Flip Flop? The design procedure as follows. 1) Acquire the clear description of the desired flip flop X. 2) Acquire the present state- next

Representation in prolog - logic programs, Representation in Prolog - Logic...

Representation in Prolog - Logic Programs : Artificial intelligence If we impose some more constraints on first order logic, then we get to a representation language known as l

What is gimps native graphics file format, XCF is GIMP's "native" format. T...

XCF is GIMP's "native" format. This will preserve all information about an image, having the layers.

What is linear bounded automation, What is linear bounded automation?  ...

What is linear bounded automation?   A linear bounded automation is restricted type of Turing machine where in the tape head isn't permitted to move off the portion of the tape

Determine the simplified sop boolean expression, Reduce the following equat...

Reduce the following equation using k-map Y = BC‾D‾ + A‾BC‾D + ABC‾D + A‾BCD + ABCD Ans. Multiplying the first term with (A+A') Y = A'BC'D' + ABC'D' + A'BC'D + ABC'D + A'BCD + A

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