A switch block 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 (Y.W. Chang et al., 1996). We present an algorithm to construct N-sided universal switch blocks with W terminals on each side. Each of our universal switch blocks has (₂ N)W switches and switch-block flexibility N-1 (i.e., F s=N-1). We prove that no switch block with less than (₂ N)W switches can be universal. Further, the decomposition property of a universal switch block provides a key insight into its layout implementation with a smaller silicon area. We also compare our universal switch blocks with others of the topology associated with Xilinx XC4000-type FPGAs. Experimental results demonstrate that our universal switch blocks improve routability at the chip level.
關聯:
Proceedings 1999 IEEE International Conference on Computer Design: VLSI in Computers and Processors ICCD '99 pp.311-314
