ACM Home Page
Please provide us with feedback. Feedback
Highly pipelined asynchronous FPGAs
Full text PdfPdf (453 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
SESSION: Novel devices and approaches to programmable devices table of contents
Pages: 133 - 142  
Year of Publication: 2004
ISBN:1-58113-829-6
Authors
John Teifel  Cornell University, Ithaca, NY
Rajit Manohar  Cornell University, Ithaca, NY
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 70,   Citation Count: 6
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/968280.968300
What is a DOI?

ABSTRACT

We present the design of a high-performance, highly pipelined asynchronous FPGA. We describe a very fine-grain pipelined logic block and routing interconnect architecture, and show how asynchronous logic can efficiently take advantage of this large amount of pipelining. Our FPGA, which does not use a clock to sequence computations, automatically self-pipelines" its logic without the designer needing to be explicitly aware of all pipelining details. This property makes our FPGA ideal for throughput-intensive applications and we require minimal place and route support to achieve good performance. Benchmark circuits taken from both the asynchronous and clocked design communities yield throughputs in the neighborhood of 300--400 MHz in a TSMC 0.25m process and 500--700 MHz in a TSMC 0.18m process.


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
U. V. Cummings, A. M. Lines, and A. J. Martin. An asynchronous pipeline lattice-structure filter. In Proc. International Symposium on Asynchronous Circuits and Systems, 1994.
 
3
J. B. Dennis. The evolution of 'static' data-flow architecture. In J.-L. Gaudiot and L. Bic, editors, Advanced Topics in Data-Flow Computing. Prentice-Hall, 1991.
 
4
G. Goslin. A guide to using FPGAs for application-specific digital signal processing performance. Xilinx Application Notes, 1995.
 
5
6
 
7
 
8
D. L. How. A self clocked FPGA for general purpose logic emulation. In Proc. of the IEEE Custom Integrated Circuits Conference, 1996.
 
9
 
10
 
11
A. Lines. Pipelined asynchronous circuits. Master's thesis, California Institute of Technology, 1995.
 
12
K. Maheswaran. Implementing self-timed circuits in field programmable gate arrays. Master's thesis, U.C. Davis, 1995.
 
13
R. Manohar. A case for asynchronous computer architecture. In Proc. of the ISCA Workshop on Complexity-Effective Design, 2000.
 
14
 
15
 
16
 
17
 
18
R. Payne. Asynchronous FPGA architectures. IEE Computers and Digital Techniques, 143(5), 1996.
19
 
20
J. Teifel and R. Manohar. Concurrent dataflow decomposition. Cornell Computer Systems Laboratory Technical Report CSL-TR-2003-1036, Cornell University, Sept. 2003.
 
21
J. Teifel and R. Manohar. Programmable asynchronous pipeline arrays. In Proc. International Conference on Field Programmable Logic and Applications, 2003.
 
22
C. Traver, R. B. Reese, and M. A. Thornton. Cell designs for self-timed FPGAs. In Proc. of ASIC/SOC Conference, 2001.
23
 
24
Xilinx. Virtex 2.5V field programmable gate arrays. Xilinx Data Sheet, 2002.


Collaborative Colleagues:
John Teifel: colleagues
Rajit Manohar: colleagues