Digital Arithmetic

Partially Combinational Implementation

167

the throughput R. That is,

1

R = 3.39

tstage

The delay of the operation (also called the

latency)

corresponds to the sum of the

delays of the stages. Consequently, the organization of the adders as a tree reduces

the latency.

If a conventional output is required, a conversion is needed. The conversion

should be pipelined into stages of the same delay as the addition stages.

3,5

Partially Combinational Implementation

The combinational implementation is faster than the sequential because of the

following two reasons:

9 In the combinational case it is possible to organize the adders in a tree