Skip to main navigation Skip to search Skip to main content

Constant multiplier design using specialized bit pattern adders

  • Kyung Ju Cho*
  • , Suhyun Jo
  • , Yong Eun Kim
  • , Yi Nan Xu
  • , Jin Gyun Chung
  • *Corresponding author for this work
  • Jeonbuk National University

Research output: Contribution to conferenceConference paperpeer-review

Abstract

The problem of efficient hardware implementation of multiple constant multiplication (MCM) is encountered in many digital signal processing applications such as FIR filter and linear transform (e.g., DCT and FFT). It is known that efficient solutions based on common subexpression elimination (CSE) algorithm can yield significant improvements in area and power consumption. In this paper, we present efficient implementation method of two common subexpressions (101, 101) in canonic signed digit (CSD) representation. By Synopsys simulations of a radix-24 FFT example, it is shown that the area, speed and power consumption can be reduced up to 21%, 11% and 12%, respectively, by the proposed algorithm.

Original languageEnglish
Title of host publicationProceedings of the 15th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2008
Pages41-44
Number of pages4
DOIs
StatePublished - 2008
Event15th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2008 - St. Julian's, Malta
Duration: 2008.08.312008.09.3

Publication series

NameProceedings of the 15th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2008

Conference

Conference15th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2008
Country/TerritoryMalta
CitySt. Julian's
Period08.08.3108.09.3

Quacquarelli Symonds(QS) Subject Topics

  • Engineering - Electrical & Electronic
  • Engineering - Petroleum

Fingerprint

Dive into the research topics of 'Constant multiplier design using specialized bit pattern adders'. Together they form a unique fingerprint.

Cite this