Define arithmetic pipelines, Computer Engineering

Assignment Help:

Arithmetic Pipelines

The technique of pipelining can be applied to various complex and low arithmetic operations to speed up processing time. Pipelines used for arithmetic calculations are called Arithmetic pipelines. In this segment we discuss arithmetic-pipelines based on arithmetic operations. Arithmetic-pipelines are created for simple fixed point and complex floating-point arithmetic operations. These arithmetic operations are well-matched to pipelining because these operations can be efficiently divided in subtasks for the pipeline phases. For applying the arithmetic pipelines we normally use following two types of adder:

I. Carry propagation adder (CPA): It adds two numerals such that carries generated in successive digits are propagated.

II. Carry save adder (CSA): It adds two numerals such that carries generated are not propagated rather these are saved in a carry vector.

 


Related Discussions:- Define arithmetic pipelines

De morgan''s laws - artificial intelligence, De Morgan's Laws Continuin...

De Morgan's Laws Continuing with the relationship between  ∧  and  ∨ , we can also use De Morgan's Law to rearrange sentences involving negation in conjunction with these conne

Design 4 to 1 multiplexer with strobe input using nand gates, Design a 4 : ...

Design a 4 : 1 multiplexer with strobe input using NAND gates. Ans. Design of 4 : 1 multiplexer with strobe input using NAND gates.

Buses - computer architecture, Buses: Execution of 1 instruction ne...

Buses: Execution of 1 instruction need the following 3 steps to be performed by the CPU: I.  Fetch the contents of the memory location pointed at by the computer syst

Fifo discipline, You have been retained to examine how many check-in agents...

You have been retained to examine how many check-in agents should be used at a check-in counter for a big hotel. During normal business hours, customers arrive at a rate of about 2

What do you mean by perfect shuffle permutation, Q. What do you mean by Per...

Q. What do you mean by Perfect Shuffle Permutation? Perfect Shuffle Permutation: It was proposed by Harold Stone (1971). Consider N objects each is represented by n bit number

Define the aims of program generation activity, Program generation activity...

Program generation activity aims at? Ans. At automatic generation of program the program generation activity aims.

Observing the existing system first hand, Observing the existing system fir...

Observing the existing system first hand This involves watching personnel using the existing system to find out precisely how it works. There are a number of disadvantages as

Depth-first search is different from breadth-first search, Depth-first sear...

Depth-first search is different from Breadth-first search in the following ways: A depth search traversal method goes to the deepest level of the tree first and then works up w

Explain the page stealer and the fault handler, How the Kernel handles both...

How the Kernel handles both the page stealer and the fault handler? The page stealer and the fault handler thrash because of the shortage of the memory. If the sum of the worki

For what DMSP stands, For what DMSP stands? DMSP stans here for Dist ri...

For what DMSP stands? DMSP stans here for Dist ributed Mai l system Protocol.

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