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

Chin-Long Wey, Ping-Chang Jui, Muh Tian Shiue

Research output: Contribution to journalArticle

Abstract

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(k)N. 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.
Original languageEnglish
Pages (from-to)966-974
Number of pages9
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE98A
Issue number4
DOIs
StatePublished - Apr 2015

Keywords

  • constant multiplier; ripple carry adder (RCA); carry-lookahead adder (CLA); hybrid adder (HyA); booth algorithm

Fingerprint Dive into the research topics of 'Efficient Algorithm and Fast Hardware Implementation for Multiply-by-(1+2(k))'. Together they form a unique fingerprint.

  • Cite this