Combinatorial routing analysis and design of universal switch blocks

  • Authors:
  • Hongbing Fan;Jiping Liu;Yu-Liang Wu

  • Affiliations:
  • Dept. of Comp. Sci., University of Victoria, Victoria BC., Canada V8W 3P6;Dept. of Math. & Comp. Sci., The University of Lethbridge Lethbridge, AB. Canada T1K 3M4;Dept. of Comp. Sci. & Engg, The Chinese University of HK, N.T., Hong Kong

  • Venue:
  • Proceedings of the 2001 Asia and South Pacific Design Automation Conference
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

A switch block with k sides and W terminals per side ((k; W)-SB) is said to be universal if every set of 2-pin nets satisfying the dimension constraint is simultaneously routable through the switch block. It has been shown that the universal switch blocks (USB) outperform the XC4000-typed switch blocks in routability. In this paper, we present a new combinatorial model and routing requirement decomposition theory for analyzing and designing generalized USB models. As a result, we obtain optimum (k,W)-USBs for k≤6 with all W's, k = 7,8 with even W's; and nearly optimum (k,W)-UBSs for k = 7; 8 with odd W's, which is a revised result on the previously published.