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.
- 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. Google Scholar
Digital Library
- Betz, V., Rose, J., and Marquardt, A. 1999. Architecture and CAD for Deep-Submicron FPGAs. Kluwer Academic, Norwell, MA. Google Scholar
Digital Library
- Brualdi, R. A. 1998. Introductory Combinatorics. Prentice Hall, Englewood Cliffs, NJ.Google Scholar
- Chang, Y., Wong, D. F., and Wong, C. K. 1996. Universal switch modules for FPGA design. ACM Trans. Des. Automat. Electron. Syst. 1, 80--101. Google Scholar
Digital Library
- Cover, T. and Thomas, J. 1991. Elements of Information Theory, Wiley, Hoboken, NJ. Google Scholar
Digital Library
- DeHon, A. 1996. Entropy, counting, and programmable interconnect. In Proceedings of the International Symposium on Field Programmable Gate Arrays (FPGA 1996), 73--79. Google Scholar
Digital Library
- Feng, W. and Greene, J. 2006. Post-placement interconnect entropy: How many configuration bits does a programmable logic device need? In Proceedings of the System-Level Interconnect Prediction (SLIP 2006), 41--48. Google Scholar
Digital Library
- Hutton, M. 2001. Interconnect prediction for PLDs. In Proceedings of the System-Level Interconnect Prediction (SLIP 2001), 125--131. Google Scholar
Digital Library
- 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.Google Scholar
- Lemieux, G. and Lewis, D. 2004. Design of Interconnection Networks for Programmable Logic. Kluwer Academic Publishers, Norwell, MA. Google Scholar
Digital Library
- 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.Google Scholar
- Lewis, D., Ahmed, E., Baeckler G., Betz, V., Bourgeault, M., Cashman, D., Galloway, D., Hutton, M., Lane, C., Lee, A., Leventis, P., Marquardt, S.,
McClintock, C., Padalia, K., Pedersen, B., Powell, G., Ratchev, B., Reddy, S., Schleicher, J., Stevens, K., Yuan, R., Cliff, R., and Rose, J. 2003. The Stratix logic and routing architecture. In Proceedings of the International Symposium on Field Programmable Gate Arrays (FPGA 2003), 12--20. Google Scholar
Digital Library
- Shannon, C. E. 1950. Memory requirements in a telephone exchange. In Bell Syst. Techn. J. 29, 343--349.Google Scholar
Cross Ref
- Xilinx Inc. 2001. Virtex-II Field-Programmable Gate Arrays. San Jose, CA. Web site: http://www.xilinx.com.Google Scholar
Index Terms
Designing Efficient Input Interconnect Blocks for LUT Clusters Using Counting and Entropy
Recommendations
Designing efficient input interconnect blocks for LUT clusters using counting and entropy
FPGA '07: Proceedings of the 2007 ACM/SIGDA 15th international symposium on Field programmable gate arraysIn 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 ...
Post-placement interconnect entropy: how many configuration bits does a programmable logic device need?
SLIP '06: Proceedings of the 2006 international workshop on System-level interconnect predictionWe introduce the concept of post-placement interconnect entropy: the minimal number of bits required to describe a well-placed netlist, which has connection lengths distributed according to Rent's rule. The entropy is a function of the number N of cells ...
Improved placement for hierarchical FPGAs exploiting local interconnect resources
SBCCI '09: Proceedings of the 22nd Annual Symposium on Integrated Circuits and System Design: Chip on the DunesThe majority of networks subject to routing in almost every FPGA design consist of networks with only 2 to 4 terminals. These usually connect to directly adjacent logic cells. In order to make best use of this circumstance commercial FPGA architecture ...






Comments