By Topic

Quasi-universal switch matrices for FPD design

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Guang-Ming Wu ; Dept. of Comput. & Inf. Sci., Nat. Chiao Tung Univ., Hsinchu, Taiwan ; Yao-Wen Chang

An FPD switch module M with ω 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 ω) 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 ω has a total of only 14ω-20 (14ω-21) switches if ω is even (odd), ω>1, compared to a fully populated one which has 3ω2 -2ω switches. We prove that no switch matrix with less than 14ω-20 (14ω-21) switches can be quasi-universal. Experimental results demonstrate that the quasi-universal switch matrices improve routability at the chip level

Published in:

IEEE Transactions on Computers  (Volume:48 ,  Issue: 10 )