This Article 
 Bibliographic References 
 Add to: 
General Models and a Reduction Design Technique for FPGA Switch Box Designs
January 2003 (vol. 52 no. 1)
pp. 21-30

Abstract—An FPGA switch box is said to be hyper-universal if it is detailed-routable for any set of multipin nets specifying a routing requirement over the switch box. Comparing with the known “universal switch modules,” where only 2-pin nets are considered, the hyper-universal switch box model is more general and powerful. This paper studies the generic problem and proposes a systematic designing methodology for hyper-universal (k, W){\hbox{-}}{\rm switch} boxes, where k is the number of sides and W is the number of terminals on each side. We formulate this hyper-universal (k, W){\hbox{-}}{\rm switch} box design problem as a k{\hbox{-}}{\rm partite} graph design problem and propose an efficient reduction design technique. Applying this technique, we can design hyper-universal (k, W){\hbox{-}}{\rm switch} boxes with low O(W) switches for any fixed k. For illustration, we provide optimum hyper-universal (2, W) and (3, W){\hbox{-}}{\rm switch} boxes and a hyper-universal (4, W){\hbox{-}}{\rm switch} box with switch number quite close to the lower bound 6W, which is used in a well-known commercial design without hyper-universal routability. We also conclude that the proposed reduction method can yield an efficient detailed routing algorithm for any given routing requirement as well.

[1] M.J. Alexander and G. Robins, “New Performance FPGA Routing Algorithms,” Proc. Design Automation Conf., pp. 562-567, 1995.
[2] V. Betz, J. Rose, and A. Morquardt, Architecure and CAD for Deep-Submicron FPGAs. Boston: Kluwer Academic, 1999.
[3] J.A. Bondy and U.S.R. Murty, Graph Theory with Applications. London: Macmillan Press, 1976.
[4] S. Brown, R.J. Francise, J. Rose, and Z.G. Vranesic, Field-Programmable Gate Arrays, Boston: Kluwer Academic, 1992.
[5] S. Brown, J. Rose, and Z.G. Vranesic, “A Detailed Router for Field-Programmable Gate Arrays,” IEEE Trans. Computer-Aided Design, vol. 11, pp. 620-628, May 1992.
[6] Y.-W. Chang, D.F. Wong, and C.K. Wong, “Universal Switch Modules for FPGA Design,” ACM Trans. Design Automation of Electronic Systems, vol. 1, no. 1, pp. 80-101, Jan. 1996.
[7] A. Corp, The Maximalist Handbook, 1990.
[8] H. Fan, P. Haxell, and J. Liu, “The Global Routing—A Combinatorial Design Problem,” submitted.
[9] Y.S. Lee and C.H. Wu, “A Performance and Routability Driven Router for FPGAs Considering Path Delays,” Proc. Design Automation Conf., pp. 557-561, 1995.
[10] J.F. Pan, Y.L. Wu, G. Yan, and C.K. Wong, “On the Optimal Four-Way Switch Box Routing Structures of FPGA Greedy Routing Architectures,” Integration, the VLSI J., vol. 25, pp. 137-159, 1998.
[11] J.S. Rose and S. Brown, "Flexibility of Interconnection Structures for Field-Programmable Gate Arrays," IEEE J. Solid-State Circuits, Vol. 26, No. 3, Mar. 1991, pp. 277-282.
[12] M. Shyu, G.M. Wu, Y.D. Chang, and Y.W. Chang, “Generic Universal Switch Blocks,” IEEE Trans. Computers, vol. 49, no. 4, pp. 348-359, Apr. 2000.
[13] Y.L. Wu and D. Chang, “On NP-Completeness of 2-D FPGA Routing Architectures and a Novel Solution,” Proc. Int'l Conf. Computer-Aided-Design, pp. 362-366, 1994.
[14] Y.L. Wu and M. Marek-Sadowska, “Routing for Array Type FPGAs,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 16, no. 5, pp. 506-518, May 1997.
[15] E. Vicario, Image Description and Retrieval. Plenum Press, 1998.
[16] Y.L. Wu, S. Tsukiyama, and M. Marek-Sadowska, “Graph Based Analysis of 2-D FPGA Routing,” IEEE Trans. Computer-Aided Design, vol. 15, no. 1, pp. 33-44, 1996.
[17] Xilinx, Inc., The Programmable Logic Data Book, 1994.

Index Terms:
FPGA, switch box, global routing, detailed routing, hyper-universal, optimum design, reduction technique.
Hongbing Fan, Jiping Liu, Yu-Liang Wu, "General Models and a Reduction Design Technique for FPGA Switch Box Designs," IEEE Transactions on Computers, vol. 52, no. 1, pp. 21-30, Jan. 2003, doi:10.1109/TC.2003.1159751
Usage of this product signifies your acceptance of the Terms of Use.