Quasi-universal switch matrices for FPD design
Resource
IEEE Transactions on Computers 48 (10): 1107-1122
Journal
IEEE Transactions on Computers
Journal Volume
48
Journal Issue
10
Pages
1107-1122
Date Issued
1999
Author(s)
Wu, G.-M.
Abstract
An FPD switch module M with /spl omega/ 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 EA is at most /spl omega/) is simultaneously routable through M. Chang et al. (1996) have identified a class of universal switch blocks. 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 /spl omega/ has a total of only 14/spl omega/-20 (14/spl omega/-21) switches if /spl omega/ is even (odd), /spl omega/>1, compared to a fully populated one which has 3/spl omega//sup 2/-2/spl omega/ switches. We prove that no switch matrix with less than 14/spl omega/-20 (14/spl omega/-21) switches can be quasi-universal. Experimental results demonstrate that the quasi-universal switch matrices improve routability at the chip level.
Type
journal article