Multiplication of a Constant (2(k) +/- 1) and Its Fast Hardware Implementation

檔案

本條目沒有附加檔案。

至出版者網站查看(DOI) ›

日期

2016-01-01

類型

期刊名稱

JOURNAL OF SIGNAL PROCESSING SYSTEMS FOR SIGNAL IMAGE AND VIDEO TECHNOLOGY

卷期與頁次

第 82 卷,頁 41–53

ISSN

1939-8018

語言

英文

摘要

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 efficient algorithms and their fast hardware implementation for performing multiplying-by-(2(k) +/- 1), or (2(k) +/- 1)N, operation with additions. No multiplications are needed. The value of (2(k) +/- 1)N can be computed by adding (+/- N) to its k-bits 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 presents the unit cells for additions (UCAs). Results show that the UCA-based RCA achieves 34 % faster than the FA-based RCA. Further, in order to improve the speed performance with lower hardware cost, this paper also presents a simple and modular hybrid adder with the proposed UCA concept, where the hybrid adder takes the lower-bit 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 proposed hybrid adder achieved speed performance improvement while maintaining its modular and regular structure.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Jui, P.-C., Wey, C.-L., & Shiue, M.-T. (2016). Multiplication of a Constant (2(k) +/- 1) and Its Fast Hardware Implementation. JOURNAL OF SIGNAL PROCESSING SYSTEMS FOR SIGNAL IMAGE AND VIDEO TECHNOLOGY, 82, 41–53. https://doi.org/10.1007/s11265-015-0978-4

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/129501