The number of stages is referred to as the
depth of the pipeline. As an example of a pipeline, consider the
floating point addition of two numbers of the form .
breakdown of this function into stages is as follows :
The extra complexity of a pipelined
adder pays off when adding long sequences of numbers. Operations
at each stage can be done on different pairs of inputs, e.g. one
stage can be comparing the exponents in one pair of operands at
the same time another stage is adding the mantissas of a
different pair of operands.
- If swap the operands. Find the difference in
- Shift to the right by bits.
- Compute the
mantissa of the sum by adding and . The exponent of the
sum is .
- Normalize the sum.