Wong, D.F.D.F.WongWong, C.K.C.K.WongYAO-WEN CHANG2018-09-102018-09-101996http://www.scopus.com/inward/record.url?eid=2-s2.0-0029723621&partnerID=MN8TOARShttp://scholars.lib.ntu.edu.tw/handle/123456789/324068A switch module M with W terminals on each side is said to be universal if every set of nets satisfying the dimensional constraint (the number of nets on each side of M is at most W) is simultaneously routable through M. In this paper, we present a class of universal switch modules. Each of our switch modules has 6W switches and switch-module flexibility three (FS = 3). We prove that no switch module with less than 6W switches can be universal. We also compare our switch modules with those used in the Xilinx XC4000 family FPGA's and the anti-symmetric switch modules (with FS = 31) suggested by [15]. Although these two kinds of switch modules also have FS = 3 and 6W switches, we show that they are not universal. Based on combinatorial counting techniques, we show that each of our universal switch modules can accommodate up to 25% more routing instances, compared with XC4000-type one of the same size. Experimental results demonstrate that our universal switch modules improve routability at the chip level. Finally, our work also provides a theoretical insight into the important observation by Rose and Brown [15] that FS = 3 is often sufficient to provide high routability.[SDGs]SDG7Combinatorial mathematics; Logic circuits; Logic design; Logic gates; Switches; Connection modules; Dimensional constraint; Field programmable gate arrays; Flexibility; Logic module architecture; Reprogrammable switches; Routability; Routing; Universal switch modules; Switching theoryconference paper10.1145/228370.2283822-s2.0-0029723621