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

What are the parts of a deployment diagram, ? Nodes: A node shows any hardw...

? Nodes: A node shows any hardware component. The configuration of hardware is shown by attributes of nodes. ? Components: A component shows software. Every component straight

Define syntax of mpi_bcast function, Q. Define syntax of MPI_Bcast function...

Q. Define syntax of MPI_Bcast function? MPI_Bcast(msgaddr, count, datatype, rank, comm):   This function is used by a process ranked rank in group comm to transmit messag

Multiple stack, how to implement the multiple stack

how to implement the multiple stack

Calculations for a standard vga graphics screen, Q. Calculations for a stan...

Q. Calculations for a standard VGA graphics screen? Let's do the calculations for a standard VGA graphics screen (640×480) using 16 colours. Total number of Pixels = 640 ×48

Define a variant of top-down parsing without backtracking, A parser which i...

A parser which is a variant of top-down parsing without backtracking is? Ans. Recursive Descend is a variant of top-down parsing without backtracking.

Difference between relocatable and self relocatable programs, Difference be...

Difference between relocatable and self relocatable programs. A relocatable program is one which can be processed to relocate it to a selected area of memory. For illustratio

Why we use debugger, Q. Why we use Debugger? Debugger is a program whic...

Q. Why we use Debugger? Debugger is a program which allows the user to test as well as debug the object file.  Theuser can use this program to perform subsequent functions.

Simplified boolean expression, Simplified the Boolean Algebra (x + y)(x + z...

Simplified the Boolean Algebra (x + y)(x + z) simplifies to ? Ans. x + yz as simplified the Boolean Algebra expression. [(x + y) (x + z)] = xx + xz + xy + yz = x + xz + xy + y

Show a string in assembly language, Q. Show a string in assembly language? ...

Q. Show a string in assembly language? MOV AH, 09H MOV DX, OFFSET   BUFF INT    21H Here data in input buffer stored in data segment is intended to be displayed on mo

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