High performance signed-digit decimal adders

Decimal arithmetic is desirable for high precision requirements of many financial, industrial and scientific applications. Furthermore, hardware support for decimal arithmetic has gained momentum with the revision of the IEEE 754 standard. This paper presents a new scheme for carry-free decimal addition using a signed-digit representation. In order to simplify the hardware requirements, each signed decimal digit uses a two's complement representation instead of complex representations found in other signed-digit decimal arithmetic implementations. Flagged adder speculation is used for fast addition of the constants required in the correction step. The proposed scheme is compared to existing signed-digit decimal adders. Each architecture is synthesized on 0.18μm technology for comparison in area, delay and power. The results show that both operation speed and area usage can be significantly improved with respect to existing signed-digit decimal adders.

[1]  James E. Stine,et al.  Compressor trees for decimal partial product reduction , 2008, GLSVLSI '08.

[2]  Ahmet Akkas,et al.  Reduced Delay BCD Adder , 2007, 2007 IEEE International Conf. on Application-specific Systems, Architectures and Processors (ASAP).

[3]  C. N. Zhang,et al.  VLSI designs for redundant binary-coded decimal addition , 1988, Seventh Annual International Phoenix Conference on Computers an Communications. 1988 Conference Proceedings.

[4]  Erdal Oruklu,et al.  Design and Synthesis of a Three Input Flagged Prefix Adder , 2007, 2007 IEEE International Symposium on Circuits and Systems.

[5]  Michael J. Schulte,et al.  Decimal multiplication with efficient partial product generation , 2005, 17th IEEE Symposium on Computer Arithmetic (ARITH'05).

[6]  Eric M. Schwarz,et al.  Power6 Decimal Divide , 2007, 2007 IEEE International Conf. on Application-specific Systems, Architectures and Processors (ASAP).

[7]  Michael J. Schulte,et al.  High-speed multioperand decimal adders , 2005, IEEE Transactions on Computers.

[8]  David Y. Y. Yun,et al.  RBCD: redundant binary coded decimal adder , 1989 .

[9]  Erdal Oruklu,et al.  Design and Synthesis of a Carry-Free Signed-Digit Decimal Adder , 2007, 2007 IEEE International Symposium on Circuits and Systems.

[10]  A. A. Bayrakci,et al.  An Efficient Vanishing Point Detection by Clustering on the Normalized Unit Sphere , 2007 .

[11]  Michael F. Cowlishaw,et al.  Decimal floating-point: algorism for computers , 2003, Proceedings 2003 16th IEEE Symposium on Computer Arithmetic.

[12]  Antonin Svoboda.  Decimal Adder with Signed Digit Arithmetic , 1969, IEEE Transactions on Computers.

[13]  Michael J. Schulte,et al.  Decimal Floating-Point Multiplication Via Carry-Save Addition , 2007, 18th IEEE Symposium on Computer Arithmetic (ARITH '07).

[14]  M. Bayoumi,et al.  Algorithms for Energy-Efficient Query-Reduction in Wireless Sensor Networks , 2007, 2006 International Workshop on Computer Architecture for Machine Perception and Sensing.