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 th...

Full description

Saved in:
Bibliographic Details
Published in:2012 Conference Record of the Forty Sixth Asilomar Conference on Signals, Systems and Computers (ASILOMAR) pp. 350 - 354
Main Authors: Garcia-Vega, C., Gonzalez-Navarro, S., Villalba, J., Zapata, E. L.
Format: Conference Proceeding
Language:English
Published: IEEE 01-11-2012
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISBN:9781467350501
1467350508
ISSN:1058-6393
2576-2303
DOI:10.1109/ACSSC.2012.6489022