| Complexity-constrainted partitioning of sequential programs for efficient behavioral synthesis |
| Full text |
Pdf
(267 KB)
|
| Source
|
Great Lakes Symposium on VLSI
archive
Proceedings of the 17th ACM Great Lakes symposium on VLSI
table of contents
Stresa-Lago Maggiore, Italy
SESSION: System level design
table of contents
Pages: 365 - 370
Year of Publication: 2007
ISBN:978-1-59593-605-9
|
|
Authors
|
|
Yuko Hara
|
Nagoya University, Nagoya, Japan
|
|
Hiroyuki Tomiyama
|
Nagoya University, Nagoya, Japan
|
|
Shinya Honda
|
Nagoya University, Nagoya, Japan
|
|
Hiroaki Takada
|
Nagoya University, Nagoya, Japan
|
|
Katsuya Ishii
|
Nagoya University, Nagoya, Japan
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 0, Downloads (12 Months): 15, Citation Count: 0
|
|
|
ABSTRACT
This paper proposes a behavioral level partitioning method for efficient behavioral synthesis from a large sequential program consisting of a set of functions. Our method optimally determines functions to be inlined into the main module and ones to be synthesized into sub modules in such a way that the overall datapath is minimized while the complexity of individual modules is lower than a certain level. The partitioning problem is formulated as an integer programming problem. Experimental results show the effectiveness of the proposed method.
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
|
|
 |
2
|
|
 |
3
|
|
| |
4
|
M. Nishimura, K. Nishiguchi, N. Ishiura, H. Kanbara, H. Tomiyama, Y. Takatsukasa, and M. Kotani, "High-Level Synthesis of Variable Accesses and Function Calls in Software Compatible Hardware Synthesizer CCAP," SASIMI, 2006.
|
| |
5
|
|
 |
6
|
|
| |
7
|
F. Vahid, "Techniques for Minimizing and Balancing I/O during Functional Partitioning," IEEE Trans. CAD, vol. 18, no. 1, Jan. 1999.
|
 |
8
|
|
| |
9
|
Y Explorations, Inc., http://www.yxi.com/.
|
| |
10
|
Xilinx, http://www.xilinx.com/.
|
|