IEICE Trans - Efficient Algorithm and Fast Hardware Implementation for Multiply-by-(1+2<SUP>k</SUP>)

Efficient Algorithm and Fast Hardware Implementation for Multiply-by-(1+2^k)

Chin-Long WEY  Ping-Chang JUI  Muh-Tian SHIUE

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E98-A   No.4   pp.966-974
Publication Date: 2015/04/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E98.A.966
Type of Manuscript: PAPER
Category: VLSI Design Technology and CAD
Keyword:
constant multiplier,  ripple carry adder (RCA),  carry-lookahead adder (CLA),  hybrid adder (HyA),  booth algorithm,

Full Text: PDF>>

Summary:
A constant multiplier performs a multiplication of a data-input with a constant value. Constant multipliers are essential components in various types of arithmetic circuits, such as filters in digital signal processor (DSP) units, and they are prevalent in modern VLSI designs. This study presents an efficient algorithm and fast hardware implementation for performing multiply-by-(1+2^k) operation with additions. No multiplications are needed. The value of (1+2^k)N can be computed by adding N to its k-bit left-shifted value 2^kN. The additions can be performed by the full-adder-based (FA-based) ripple carry adder (RCA) for simple architecture. This paper introduces the unit cells for additions (UCAs) to construct the UCA-based RCA which achieves 35% faster than the FA-based RCA in speed performance. Further, in order to improve the speed performance, a simple and modular hybrid adder is presented with the proposed UCA concept, where the carry lookahead adder (CLA) as a module and many of the CLA modules are serially connected in a fashion similar to the RCA. Results show that the hybrid adder significantly improves the speed performance.