Bit and word-level common subexpression elimination for the synthesis of linear computations

Akihiro Matsuura, Akira Nagoya

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

In this paper, we propose a transformation technique for the multiplications of one variable with multiple constants, which are frequently seen in the various applications of signal processing, image processing, and so forth. The method is based on the exploration of common subexpressions among constants and reduces the number of shifts, additions, and subtractions to implement linear computations with hardware. Our method searches for regularity among elements of a linear transform using matrix decomposition and generates a reduced data-flow graph which preserves the full regularity. We show experimental results obtained using Discrete Cosine Transform (DCT) and Fast Fourier Transform (FFT) and illustrate the effectiveness of the method.

Original languageEnglish
Pages (from-to)455-461
Number of pages7
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE81-A
Issue number3
Publication statusPublished - Jan 1 1998
Externally publishedYes

Keywords

  • Common subexpression elimination
  • High-level synthesis
  • Linear transforms
  • Matrix decomposition

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Bit and word-level common subexpression elimination for the synthesis of linear computations'. Together they form a unique fingerprint.

  • Cite this