| Pre-synthesis optimization of multiplications to improve circuit performance |
| Full text |
Pdf
(287 KB)
|
| Source
|
Design, Automation, and Test in Europe
archive
Proceedings of the conference on Design, automation and test in Europe: Proceedings
table of contents
Munich, Germany
SESSION: Progress in logic and arithmetic circuit optimisation
table of contents
Pages: 1306 - 1311
Year of Publication: 2006
ISBN:3-9810801-0-6
|
|
Authors
|
|
| Sponsors |
|
| Publisher |
European Design and Automation Association
3001 Leuven, Belgium, Belgium
|
| Bibliometrics |
Downloads (6 Weeks): 1, Downloads (12 Months): 10, Citation Count: 2
|
|
|
ABSTRACT
Conventional high-level synthesis uses the worst case delay to relate all inputs to all outputs of an operation. This is a very conservative approximation of reality, especially in arithmetic operations (where some bits are required later than others and some bits are produced earlier than others). This paper proposes a pre-synthesis optimization algorithm that takes advantage of this feature for more efficient high-level synthesis of data-flow graphs formed by additions and multiplications. The presented pre-processor analyzes the critical path at bit-granularity and splits the arithmetic operations into sub-words fragments. In particular, some of the specification multiplications are broken up into several smaller multiplications, additions, and other operations of three new types specially defined to reduce the clock cycle duration. These fragments become the input to any regular high-level synthesis tool to speed up circuit execution times. The experimental results carried out show that implementations obtained from the optimized specification are on average 70% faster and in most cases substantial area reductions are also achieved.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
Zhan Yu , Kei-Yong Khoo , Alan N. Willson, Jr., The use of carry-save representation in joint module selection and retiming, Proceedings of the 37th conference on Design automation, p.768-773, June 05-09, 2000, Los Angeles, California, United States
[doi> 10.1145/337292.337773]
|
| |
2
|
V. Raghunathan, S. Ravi, and G. Lakshminarayana. "Integrating Variable-Latency Components into High-Level Synthesis". IEEE Transactions on Computer Aided Design, October 2000.
|
 |
3
|
|
| |
4
|
S. Park, and K. Choi. "Performance-Driven High-Level Synthesis with Bit-Level Chaining and Clock Selection". IEEE Transactions on Computer Aided Design, February 2001.
|
| |
5
|
P. Marwedel, B. Landwehr, and R. Dömer. "Built-in Chaining: Introducing Complex Components into Architectural Synthesis". In Proc. of Asia Pacific Design Automation Conference, ASPDAC 1997.
|
 |
6
|
|
| |
7
|
|
| |
8
|
N. Dutt, "High-level Synthesis Workshop Benchmarks". Univ. California, Irvine, CA, Technical Report, 1992.
|
CITED BY 2
|
|
M. C. Molina , R. Ruiz-Sautua , J. M. Mendías , R. Hermida, Area optimization of multi-cycle operators in high-level synthesis, Proceedings of the conference on Design, automation and test in Europe, April 16-20, 2007, Nice, France
|
|
|
|
|