| A synthesis oriented omniscient manual editor |
| Full text |
Pdf
(355 KB)
|
| Source
|
International Symposium on Field Programmable Gate Arrays
archive
Proceedings of the 2004 ACM/SIGDA 12th international symposium on Field programmable gate arrays
table of contents
Monterey, California, USA
Pages: 89 - 98
Year of Publication: 2004
ISBN:1-58113-829-6
|
|
Authors
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 0, Downloads (12 Months): 8, Citation Count: 0
|
|
|
ABSTRACT
The cost functions used to evaluate logic synthesis transformations for FPGAs are far removed from the final speed and routability determined after placement, routing and timing analysis. This distance has given rise to the field of physical synthesis, which attempts to improve logic synthesis by employing cost functions that contain placement, routing and/or timing analysis information.In this work we take this notion to an extreme that we call omniscience, in which post-routing timing analysis is provided in the context of a manual editor in which the user selects logical and physical transformations. After each incremental circuit modification, the user is informed of the circuit performance after routing and timing analysis. Since the computations involved in providing this level of information are large, we restrict the application to relatively small circuits, no larger than 1000 logic elements.Using this approach on a commercial FPGA, we propose a set of logic transformations specific to the logic and routing architecture of the Xilinx Virtex-E device. On a set of 10 circuits we have achieved an average performance improvement of 10% when both logical and physical changes are used. Another value of the editor is that it reveals new types of automatable physical-synthesis transformations and optimization strategies that arise from architectural properties of the target device.
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
|
Jinan Lou , Wei Chen , Massoud Pedram, Concurrent logic restructuring and placement for timing closure, Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design, p.31-36, November 07-11, 1999, San Jose, California, United States
|
 |
2
|
|
 |
3
|
|
| |
4
|
J. Cong and Y. Ding, "FlowMap: an optimal technology mapping algorithm for delay optimization in lookup-table based FPGA designs," IEEE Trans. on CAD of Integrated Circuits and Systems, vol. 13, issue 1, 1994, pp. 1--12.
|
| |
5
|
|
 |
6
|
|
| |
7
|
Xilinx Inc., "Virtex-E Production Product Specification", Online: http://direct.xilinx.com/bvdocs/publications/ds022.pdf, accessed on July 7, 2003.
|
| |
8
|
A. Roopchansingh and J. Rose, "Nearest Neighbour Interconnect in Deep Submicron FPGAs", Proc. of IEEE CICC, May 2002, pp. 59--62.
|
| |
9
|
|
| |
10
|
|
 |
11
|
Robert Francis , Jonathan Rose , Zvonko Vranesic, Chortle-crf: Fast technology mapping for lookup table-based FPGAs, Proceedings of the 28th conference on ACM/IEEE design automation, p.227-233, June 17-22, 1991, San Francisco, California, United States
[doi> 10.1145/127601.127670]
|
| |
12
|
Xilinx XC4000 device data sheet, Online: http://direct.xilinx.com/bvdocs/publications/4000.pdf. Accessed September 22, 2003.
|
 |
13
|
|
 |
14
|
Scott Hauck , Matthew M. Hosler , Thomas W. Fry, High-performance carry chains for FPGAs, Proceedings of the 1998 ACM/SIGDA sixth international symposium on Field programmable gate arrays, p.223-233, February 22-25, 1998, Monterey, California, United States
[doi> 10.1145/275107.275142]
|
| |
15
|
J. Cong and Y. Hwang, "Boolean Matching for LUT-Based Logic Blocks With Applications to Architecture Evaluation and Technology Mapping," IEEE Trans. on CAD of Integrated Circuits and Systems, Vol. 20, No. 9, September 2001, pp. 1077--1090.
|
| |
16
|
T. Czajkowski, "A Synthesis Oriented Omniscient Manual Editor for FPGA Circuit Design," Master of Applied Science thesis, University of Toronto, 2004.
|
|