ACM Home Page
Please provide us with feedback. Feedback
Designing Efficient Input Interconnect Blocks for LUT Clusters Using Counting and Entropy
Full text PdfPdf (697 KB)
Source
ACM Transactions on Reconfigurable Technology and Systems (TRETS) archive
Volume 1 ,  Issue 1  (March 2008) table of contents
Special edition on the 15th international symposium on FPGAs
Article No. 6  
Year of Publication: 2008
ISSN:1936-7406
Authors
Wenyi Feng  Actel Corporation
Sinan Kaptanoglu  Actel Corporation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 66,   Citation Count: 0
Additional Information:

abstract   references   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/1331897.1331902
What is a DOI?

ABSTRACT

In a cluster-based FPGA, the interconnect from external routing tracks and cluster feedbacks to the LUT inputs consumes significant area, and no consensus has emerged among different implementations (e.g., 1-level or 2-level). In this paper, we model this interconnect as a unified input interconnect block (IIB). We identify three types of IIBs and develop general combinatorial techniques to count the number of distinct functional configurations for them. We use entropy, defined as the logarithm of this count, to estimate an IIB's routing flexibility. This enables us to analytically evaluate different IIBs without the customary time-consuming place and route experiments. We show that both depopulated 1-level IIBs and VPR-style 2-level IIBs achieve high routing flexibility but lack area efficiency. We propose a novel class of highly efficient, yet still simple, IIBs that use substantially fewer switches with only a small degradation in routing flexibility. Experimental results verify the routability of these IIBs, and confirm that entropy is a good predictor of routability.


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
Ahmed, E. and Rose, J. 2004. The effect of LUT and cluster size on deep-submicron FPGA performance and density. IEEE Trans. on VLSI, 12, 288--298.
 
2
 
3
Brualdi, R. A. 1998. Introductory Combinatorics. Prentice Hall, Englewood Cliffs, NJ.
4
 
5
6
7
8
 
9
Lemieux, G., Lee, E., Tom, M., and Yu, A. 2004. Directional and single-driver wires in FPGA interconnect. In Proceedings of the International Conference on Field-Programmable Technology (FPT 2004), 41--48.
 
10
 
11
Leventis, P., Chan, M., Lewis, D., Nouban, B., Powell, G., Vest, B., Wong, M., Xia, R., and Costello, J. 2003. Cyclone: A low-cost, high-performance FPGA. In Proceedings of the IEEE 2003 Custom Integrated Circuits Conference (CICC 2003). 49--52.
12
 
13
Shannon, C. E. 1950. Memory requirements in a telephone exchange. In Bell Syst. Techn. J. 29, 343--349.
 
14
Xilinx Inc. 2001. Virtex-II Field-Programmable Gate Arrays. San Jose, CA. Web site: http://www.xilinx.com.

Collaborative Colleagues:
Wenyi Feng: colleagues
Sinan Kaptanoglu: colleagues