Wong, D. F.D. F.WongWong, C. K.C. K.WongYAO-WEN CHANG2020-06-162020-06-161995https://scholars.lib.ntu.edu.tw/handle/123456789/501943https://www.scopus.com/inward/record.uri?eid=2-s2.0-0029500695&partnerID=40&md5=cf413ee7f085fea2f0f52381b9679141Switch modules are the most important component of the routing resources in FPGA's and FPIC's. The quality of switch modules greatly affects FPGA/FPIC routing solutions. The switch-module design problem was studied in [23]. In order to analyze the routability of designed switch modules, a heuristic algorithm based on network-flow techniques was proposed. In this paper, we mathematically show that the network-flow based algorithm has provably good performance with the bounds 5 and 5/4 away from the optima for two types of switch modules, respectively. Based on the analyses, we developed a new method for designing switch modules. Experimental results show that our designed switch modules significantly improve routability, compared with those in [23]. Extensive experiments also show that the network-flow based algorithm is highly accurate and runs very efficiently.Algorithms; Application specific integrated circuits; Boolean functions; Computer architecture; Computer networks; Heuristic programming; Logic circuits; Logic design; Mathematical models; Field-programmable gate arrays; Field-programmable interconnect chip; Network flow; Routability; Switch modules; Switching circuitsconference paper10.1109/ICCD.1995.5288392-s2.0-0029500695