Decimal online multioperand addition

In this paper we present different architectures for decimal online addition. The operands are represented using RBCD and the multioperand trees are built using as a component the online decimal full adder (olDFA) which was previously defined. We present different pipelined trees where the higher the amount of pipeline stages, the lower the cycle time. In addition, we study different multioperand architectures where the olDFA component internally pipelined (olDFA p ). We show that when dealing with decimal online multioperand addition, it is more efficient to work with pipelined trees having as components olDFA p modules.