Abstract

Decimal computation is highly demanded in many human-centric applications such as banking, accounting, tax calculation, and currency conversion. Hence the design and implementation of radix-10 arithmetic units attract the attention of many researchers. Among the basic decimal arithmetic operations, multiplication is not only a frequent operation but also has high complexity and considerable power consumption. Therefore, this paper concentrates on this issue and studies a general design methodology that reduces power/energy consumption via localizing switching activity without compromising target performance. This method decomposes a digit multiplier into smaller ones, like Karatsuba’s algorithm, while the multiplicand and the multiplier can be partitioned into different sizes. We take advantage of various size partitions in two types of symmetric and asymmetric, which final designs provide specific characteristics. All designs were implemented using VHDL and synthesized in the Design-Compiler toolbox with TSMC 130 nm Technology file. The results are significant; in respect to the original design, by a random test vector, 25% power reduction is achieved with no effect on latency and a negligible area penalty. Moreover, the experimental results indicate a potential for considerable reduction of power dissipation based on statistical properties of possible input data.

Highlights

  • Despite the fast and effective implementation of binary arithmetic functions, using decimal computation has been revived

  • A considerable number of research papers have been published on decimal arithmetic algorithms and hardware units such as decimal addition (two-operand (e.g., [7]) and multi-operand (e.g., [8])), decimal multiplication (sequential (e.g., [9]) and parallel (e.g., [10])), decimal division (subtractive (e.g., [11]) and multiplicative (e.g., [12])), and other arithmetic functions (e.g., [13])

  • To take advantage of state-of-the-art decimal multiplier designs, in Table I, we summarize some characteristics of several previous relevant works, based on Multiplier Recoding (MR), pre-computed multiples values (PMV), Multiple Encoding (ME), Partial Product Digit Set (PPDS), Partial Product Digit Encoding (PPDE), Reduced Partial product Digit Set (RPDS), and Reduced Partial product Digit Encoding (RPDE)

Read more

Summary

INTRODUCTION

Despite the fast and effective implementation of binary arithmetic functions, using decimal computation has been revived This revitalization has been done for three main reasons; (1) the advances in VLSI technology, (2) the appearance of a large amount of decimal data in humancentric applications such as financial, commercial, scientific, and internet-based applications so that the software implementations do not satisfy the high-performance requirements [1], and (3) the lack of exact binary representation for some decimal fractions (e.g., 0.2).

BACKGROUND
LL Y HH
HHL YHLH X HLH YHLH X HHH YLHL X HLH YHLH X LHH YLHL X LLH YLLH
LH X LL
EXPERIMENTAL RESULTS
CONCLUSION
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call