Efficient hierarchical clustering method for the multiple constant multiplication problem

Akihiro Matsuura, Mitsuteru Yukishita, Akira Nagoya

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

In this paper, we propose an efficient solution for the Multiple Constant Multiplication (MCM) problem. The method exploits common subexpressions among constants based on hierarchical clustering and reduce the number of shifts, additions, and subtractions. The algorithm defines appropriate weights which indicate the operation priorities and selects the common subexpressions which results in the least number of local operations. It can also be extended to various high-level synthesis tasks such as arbitrary linear transforms. Experimental results show the effectiveness of our method.

Original languageEnglish
Title of host publicationProceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC
PublisherIEEE
Pages83-88
Number of pages6
Publication statusPublished - 1997
Externally publishedYes
EventProceedings of the 1997 Asia and South Pacific Design Automation Conference, ASP-DAC - Chiba, Jpn
Duration: Jan 28 1997Jan 31 1997

Other

OtherProceedings of the 1997 Asia and South Pacific Design Automation Conference, ASP-DAC
CityChiba, Jpn
Period1/28/971/31/97

Fingerprint

High level synthesis

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Matsuura, A., Yukishita, M., & Nagoya, A. (1997). Efficient hierarchical clustering method for the multiple constant multiplication problem. In Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC (pp. 83-88). IEEE.

Efficient hierarchical clustering method for the multiple constant multiplication problem. / Matsuura, Akihiro; Yukishita, Mitsuteru; Nagoya, Akira.

Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC. IEEE, 1997. p. 83-88.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Matsuura, A, Yukishita, M & Nagoya, A 1997, Efficient hierarchical clustering method for the multiple constant multiplication problem. in Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC. IEEE, pp. 83-88, Proceedings of the 1997 Asia and South Pacific Design Automation Conference, ASP-DAC, Chiba, Jpn, 1/28/97.
Matsuura A, Yukishita M, Nagoya A. Efficient hierarchical clustering method for the multiple constant multiplication problem. In Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC. IEEE. 1997. p. 83-88
Matsuura, Akihiro ; Yukishita, Mitsuteru ; Nagoya, Akira. / Efficient hierarchical clustering method for the multiple constant multiplication problem. Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC. IEEE, 1997. pp. 83-88
@inproceedings{b27dc2987c86459aadb55cb2f961a6cf,
title = "Efficient hierarchical clustering method for the multiple constant multiplication problem",
abstract = "In this paper, we propose an efficient solution for the Multiple Constant Multiplication (MCM) problem. The method exploits common subexpressions among constants based on hierarchical clustering and reduce the number of shifts, additions, and subtractions. The algorithm defines appropriate weights which indicate the operation priorities and selects the common subexpressions which results in the least number of local operations. It can also be extended to various high-level synthesis tasks such as arbitrary linear transforms. Experimental results show the effectiveness of our method.",
author = "Akihiro Matsuura and Mitsuteru Yukishita and Akira Nagoya",
year = "1997",
language = "English",
pages = "83--88",
booktitle = "Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC",
publisher = "IEEE",

}

TY - GEN

T1 - Efficient hierarchical clustering method for the multiple constant multiplication problem

AU - Matsuura, Akihiro

AU - Yukishita, Mitsuteru

AU - Nagoya, Akira

PY - 1997

Y1 - 1997

N2 - In this paper, we propose an efficient solution for the Multiple Constant Multiplication (MCM) problem. The method exploits common subexpressions among constants based on hierarchical clustering and reduce the number of shifts, additions, and subtractions. The algorithm defines appropriate weights which indicate the operation priorities and selects the common subexpressions which results in the least number of local operations. It can also be extended to various high-level synthesis tasks such as arbitrary linear transforms. Experimental results show the effectiveness of our method.

AB - In this paper, we propose an efficient solution for the Multiple Constant Multiplication (MCM) problem. The method exploits common subexpressions among constants based on hierarchical clustering and reduce the number of shifts, additions, and subtractions. The algorithm defines appropriate weights which indicate the operation priorities and selects the common subexpressions which results in the least number of local operations. It can also be extended to various high-level synthesis tasks such as arbitrary linear transforms. Experimental results show the effectiveness of our method.

UR - http://www.scopus.com/inward/record.url?scp=0030679072&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030679072&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0030679072

SP - 83

EP - 88

BT - Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

PB - IEEE

ER -