ACM Home Page
Please provide us with feedback. Feedback
The SFRA: a corner-turn FPGA architecture
Full text PdfPdf (234 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: Architectures table of contents
Pages: 3 - 12  
Year of Publication: 2004
ISBN:1-58113-829-6
Authors
Nicholas Weaver  University of California at Berkeley, Berkeley, CA
John Hauser  University of California at Berkeley, Berkeley, CA
John Wawrzynek  University of California at Berkeley, Berkeley, CA
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 37,   Citation Count: 4
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.968283
What is a DOI?

ABSTRACT

FPGAs normally operate at whatever clock rate is appropriate for the loaded configuration. When FPGAs are used as computational devices in a larger system, however, it is better to employ fixed-frequency FPGAs operating at a high clock frequency. Such fixed-frequency arrays require pipelined interconnect structures, which are difficult to support in a traditional FPGA architecture. We have developed a novel approach, called a "corner-turn" interconnect, based on a Manhattan array of logically depopulated S-boxes with full connectivity but limited routability. This interconnect supports new polynomial-time routing techniques while maintaining conventional placement and other upstream toolflow. We have used the corner-turn interconnect to define a fixed-frequency FPGA architecture, the SFRA, that is largely compatible with the Xilinx Virtex while providing higher speed, pipelined operation. Our tools automatically repipeline designs to operate at the SFRA's intrinsic clock frequency. Since the arrays are largely compatible, we directly compare the SFRA with the Virtex on four benchmark designs. On these benchmarks, the SFRA offers higher throughput and competitive throughput per area. The SFRA routing and retiming tools also run one to two orders of magnitude faster than their Xilinx counterparts.


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
V. Betz and J. Rose. Effect of the prefabricated routing track distribution on fpga area-efficiency, 1998.
 
2
Chameleon systems, http://www.chameleonsystems.com/.
 
3
J. Gaisler. LEON SPARC-compatable processor, http://www.gaisler.com/leonmain.html.
4
 
5
6
 
7
 
8
C. Leiserson, F. Rose, and J. Saxe. Optimizing synchronous circuitry by retiming. In Third Caltech Conference On VLSI, March 1993.
9
 
10
E. Mirsky and A. DeHon. Matrix: A reconfigurable computing architecture with configurable instruction distribution and deployable resources. In Proceedings of the IEEE Symposium on Field-Programmable Gate Arrays for Custom Computing Machines. IEEE, April 1996.
 
11
NIST. Federal information processing standards (FIPS) publication 197: Advanced encryption standard, 2001. http://csrc.nist.gov/publications/fips/fips197/fips-197.pdf.
 
12
T. Smith and M. Waterman. Identification of common molecular subsecquences, 1981.
13
 
14
15
 
16
Xilinx, Inc., 2100 Logic Drive, San Jose, CA 95124. Virtex Series FPGAs, 1999.


Collaborative Colleagues:
Nicholas Weaver: colleagues
John Hauser: colleagues
John Wawrzynek: colleagues