ACM Home Page
Please provide us with feedback. Feedback
Automated synthesis for asynchronous FPGAs
Full text PdfPdf (196 KB)
Source International Symposium on Field Programmable Gate Arrays archive
Proceedings of the 2005 ACM/SIGDA 13th international symposium on Field-programmable gate arrays table of contents
Monterey, California, USA
SESSION: Synthesis and timing analysis for FPGAs table of contents
Pages: 163 - 173  
Year of Publication: 2005
ISBN:1-59593-029-9
Authors
Song Peng  Cornell University, Ithaca, NY
David Fang  Cornell University, Ithaca, NY
John Teifel  Cornell University, Ithaca, NY
Rajit Manohar  Cornell University, Ithaca, NY
Sponsors
ACM: Association for Computing Machinery
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 34,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1046192.1046214
What is a DOI?

ABSTRACT

We present an automatic logic synthesis method targeted for high-performance asynchronous FPGA (AFPGA) architectures. Our method transforms sequential programs as well as high-level descriptions of asynchronous circuits into fine-grain asynchronous process netlists suitable for an AFPGA. The resulting circuits are inherently pipelined, and can be physically mapped onto our AFPGA with standard partitioning and place-and-route algorithms. For a wide variety of benchmarks, our automatic synthesis method not only yields comparable logic densities and performance to those achieved by hand placement, but also attains a throughput close to the peak performance of the FPGA.


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
C. S. Ananian. The static single information form. Master's thesis, Massachusetts Institute of Technology, 1999.
 
2
 
3
 
4
J. Teifel and R. Manohar. Static tokens: using dataflow to automate concurrent pipeline synthesis. In Proceedings of International Symposium on Asynchronous Circuits and Systems, 2004.
 
5
J. Teifel and R. Manohar. Programmable Asynchronous Pipeline Arrays. In Proceedings of International Conference on Field Programmable Logic and Applications, 2003.
6
 
7
C. Wong, A. J. Martin and P. Thomas. An Architecture for Asynchronous FPGAs. In Proceedings of International Conference on Field Programmable Technology, 2003.
 
8
 
9
 
10
R. Payne. Asynchronous FPGA architectures. IEEE Computers and Digital Techniques, 143(5):282--286, 1996.
 
11
 
12
D. L. How. A Self Clocked FPGA for General Purpose Logic Emulation. In Proceedings of of the IEEE Custom Integrated Circuits Conference, 1996.
 
13
 
14
C. Traver, R. B. Reese and M. A. Thornton. Cell Designs for Self-timed FPGAs. In Proceedings of of ASIC/SOC Conference, 2001.
 
15
K. Maheswaran. Implementing Self-Timed Circuits in Field Programmable Gate Arrays. Master's thesis, University of California at Davis, 1995.
 
16
J. B. Dennis. The Evolution of `Static' Data-Flow Architecture. Prentice Hall, 1991.
17
 
18
 
19
 
20
D. Fang and R. Manohar. Non-Uniform Access Asynchronous Register Files. In Proceedings of International Symposium on Asynchronous Circuits and Systems, 2004.
 
21
 
22
Xilinx Inc. Virtex™ 2.5V Field Programmable Gate Arrays. Xilinx Data Sheet, 2002.
 
23
24
25
26


Collaborative Colleagues:
Song Peng: colleagues
David Fang: colleagues
John Teifel: colleagues
Rajit Manohar: colleagues