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 language | English |
|---|---|
| Pages | 83-88 |
| Number of pages | 6 |
| Publication status | Published - Jan 1 1997 |
| Externally published | Yes |
| Event | Proceedings of the 1997 Asia and South Pacific Design Automation Conference, ASP-DAC - Chiba, Jpn Duration: Jan 28 1997 → Jan 31 1997 |
Other
| Other | Proceedings of the 1997 Asia and South Pacific Design Automation Conference, ASP-DAC |
|---|---|
| City | Chiba, Jpn |
| Period | 1/28/97 → 1/31/97 |
ASJC Scopus subject areas
- Computer Science Applications
- Computer Graphics and Computer-Aided Design
- Electrical and Electronic Engineering