DMCA
On Optimum Designs of Universal Switch Blocks
BibTeX
@MISC{Fan_onoptimum,
author = {Hongbing Fan and Jiping Liu and Yu-liang Wu and Chak-chung Cheung},
title = {On Optimum Designs of Universal Switch Blocks},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. This paper presents a breakthrough decomposition theorem on routing topology and its applications in the designing of universal switch blocks. A switch block of k sides and W terminals on each side is said to be universal (a (k,W)-USB) if it is routable for every set of 2-pin nets with channel density at most W. The optimum USB design prob-lem is to design a (k,W)-USB with the minimum number of switches for every pair of (k, W). The problem was originated from designing bet-ter k sides switch modules for 2D-FPGAs, such as Xilinx XC4000-type FPGAs, where k ≤ 4. The interests in the generic USBs come from their potential usages in multi-dimensional and some non-conventional 2D-FPGA architectures, and as an individual switch components. The optimum (k,W)-USB was solved previously for even W, but left open for odd W. Our new decomposition theorem states that when W (> k+3−i 3
Keyphrases
universal switch block optimum design 2-pin net new decomposition theorem state switch block minimum number channel density breakthrough decomposition theorem individual switch component optimum usb design prob-lem generic usbs potential usage xilinx xc4000-type fpgas bet-ter side non-conventional 2d-fpga architecture
