Combinatorial routing analysis and design of universal switch blocks

Author

Fan, Hongbing ; Liu, Jiping ; Wu, Yu-Liang

Author_Institution

Dept. of Comput. Sci., Victoria Univ., BC, Canada

fYear

2001

fDate

2001

Firstpage

641

Lastpage

644

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 (USE) 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 Ws, k=7,8 with even Ws; and nearly optimum (k,W)-UBSs for k=7,8 with odd Ws, which is a revised result on the previously published

Keywords

combinational circuits; field programmable gate arrays; logic design; network routing; FPGA architecture; combinatorial routing analysis; decomposition theorem; logic design; mathematical model; universal switch block; Failure analysis; Field programmable gate arrays; Graph theory; Logic; Mathematical model; Pins; Routing; Switches; Universal Serial Bus; Wire;

fLanguage

English

Publisher

ieee

Conference_Titel

Design Automation Conference, 2001. Proceedings of the ASP-DAC 2001. Asia and South Pacific

Conference_Location

Yokohama

Print_ISBN

0-7803-6633-6

Type

conf

DOI

10.1109/ASPDAC.2001.913381

Filename

913381