Switch-matrix architecture and routing for FPDs

Authors:
Guang-Min Wu;Yao-Wen Chang
Affiliations:
Department of Computer and Information Science, National Chiao Tung University, Hsinchu, Taiwan, ROC;Department of Computer and Information Science, National Chiao Tung University, Hsinchu, Taiwan, ROC
Venue:
ISPD '98 Proceedings of the 1998 international symposium on Physical design
Year:
1998

Citing 7
Cited 1

Combinatorics, complexity, and randomness

Communications of the ACM
Universal switch modules for FPGA design

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Switch module design with application to two-dimensional segmentation design

ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Routing for symmetric FPGAs and FPICs

ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Design and analysis of FPGA/FPIC switch modules

ICCD '95 Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors
Routable Technologie Mapping for LUT FPGAs

ICCD '92 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
Placement-Based Partitioning for Lookup-Table-Based FPGAs

ICCD '92 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors

Analysis of FPGA/FPIC switch modules

ACM Transactions on Design Automation of Electronic Systems (TODAES)

Quantified Score

Hi-index	0.00

Visualization

Abstract

An FPD switch module M with w terminals on each side is said to be universal if every set of nets satisfying the dimensional constraint (i.e., the number of nets on each side of M is at most w) is simultaneously routable through M [8]. Chang, Wong, and Wong have identified a class of universal switch blocks [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 3w2 - 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.