This Article 
 Bibliographic References 
 Add to: 
Quasi-Universal Switch Matrices for FPD Design
October 1999 (vol. 48 no. 10)
pp. 1107-1122

Abstract—An FPD switch module $M$ with $w$ terminals on each side is said to be universal if every set of nets satisfying the dimension constraint (i.e., the number of nets on each side of $M$ is at most $w$) is simultaneously routable through $M$ [8]. Chang et al. have identified a class of universal switch blocks in [8]. In this paper, we consider the design and routing problems for another popular model of switch modules called switch matrices. Unlike switch blocks, we prove that there exist no universal switch matrices. Nevertheless, we present quasi-universal switch matrices which have the maximum possible routing capacities among all switch matrices of the same size and show that their routing capacities converge to those of universal switch blocks. Each of the quasi-universal switch matrices of size $w$ has a total of only $14w-20$ ($14w-21$) switches if $w$ is even (odd), $w>1$, compared to a fully populated one which has $3w^2-2w$ switches. We prove that no switch matrix with less than $14w-20$ ($14w-21$) switches can be quasi-universal. Experimental results demonstrate that the quasi-universal switch matrices improve routabilty at the chip level.

[1] Actel Corp., FPGA Data Book and Design Guide, 1996.
[2] Altera Corp., FLEX 10K Handbook, 1996.
[3] Aptix Inc., FPIC AX1024D, Preliminary Data Sheet, Aug. 1992.
[4] AT&T Microelectronics, AT&T Field-Programmable Gate Arrays Data Book, Apr. 1995.
[5] N. Bhat and D. Hill, “Routable Technology Mapping for LUT FPGAs,” Proc. IEEE Int'l Conf. Computer Design, pp. 95-98, 1992.
[6] S.D. Brown, J. Rose, and Z.G. Vranesic, “A Stochastic Model to Predict the Routability of Field-Programmable Gate Arrays,” IEEE Trans. Computer-Aided Design, vol. 12, no. 12, pp. 1,827-1,838, Dec. 1993.
[7] Y.-W. Chang, D.F. Wong, and C.K. Wong, “Design and Analysis of FPGA/FPIC Switch Modules,” Proc. IEEE Int'l Conf. Computer Design, pp. 394-401, Austin, Tex., Oct. 1995.
[8] 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.
[9] A.E. Gammal,J. Green,J. Reyneri,E. Rogoyski,, and A. Mohsen,“An architecture for electrically configurable gate array,” IEEE J. Solid State Circuits, vol. 24, no. 2, pp. 394-398, Apr. 1989.
[10] J. Hennessy and D. Patterson, Computer Architecture: A Quantitative Approach. Morgan Kaufmann, 1995.
[11] H. Hsieh et al., "Third-Generation Architecture Boosts Speed and Density of Field-Programmable Gate Arrays," Proc. 1990 Custom Integrated Circuits Conf., IEEE, Piscataway, N.J., 1990, pp. 31.2.1-31.2.7.
[12] R.M. Karp, “Combinatorics, Complexity, andRandomness,” Comm. ACM, vol. 29, no. 2, pp. 98-109, 1986.
[13] C.Y. Lee, “An Algorithm for Path Connections and Its Applications,” IRE Trans. Electronic Computers, vol. 10, pp. 346-365, Sept. 1961.
[14] G.G. Lemienx and S.D. Brown, “A Detailed Routing Algorithm for Allocating Wire Segments in Field-Programmable Gate Arrays,” Proc. ACM/SIGDA Physical Design Workshop, pp. 215-216, Lake Arrowhead, Calif., 1993.
[15] 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.
[16] Y. Sun, T.-C. Wang, C.K. Wong, and C.L. Liu, “Routing for Symmetric FPGAs and FPICs,” Proc. IEEE/ACM Int'l Conf. Computer-Aided Design, pp. 486-490, Santa Clara, Calif., Nov. 1993.
[17] S. Trimberger and M. Chene, “Placement-Based Partitioning for Lookup-Table-Based FPGA,” Proc. IEEE Int'l Conf. Computer Design, pp. 91-94, 1992.
[18] Xilinx Inc., The Programmable Logic Data Book, 1996.
[19] K. Zhu, D.F. Wong, and Y.-W. Chang, “Switch Module Design with Application to Two-Dimensional Segmentation Design,” Proc. IEEE/ACM Int'l Conf. Computer-Aided Design, pp. 481-486, Santa Clara, Calif., Nov. 1993.

Index Terms:
Analysis, architecture, design, digital, gate array, programmable logic array.
Guang-Ming Wu, Yao-Wen Chang, "Quasi-Universal Switch Matrices for FPD Design," IEEE Transactions on Computers, vol. 48, no. 10, pp. 1107-1122, Oct. 1999, doi:10.1109/12.805159
Usage of this product signifies your acceptance of the Terms of Use.