DocumentCode
3547919
Title
Segmented channel routing with pin rearrangements via satisfiability
Author
He, Fei ; Hung, William N N ; Song, Xiaoyu ; Gu, Ming ; Sun, Jiaguang
Author_Institution
Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing, China
fYear
2005
fDate
23-26 May 2005
Firstpage
6248
Abstract
We address a new segmented channel routing problem with pin rearrangements in FPGA technology. In our routing model, the pins in each module have a certain degree of freedom to be rearranged. With this flexibility, the wire routability can be improved in segmented channel routing. We present an efficient SAT-based approach to solve the problem. We use one of the best SAT-solvers, zChaff, to perform our experiments. Experimental results show the promising performance of the method.
Keywords
computability; field programmable gate arrays; integrated circuit layout; logic design; network routing; FPGA technology; pin rearrangements; satisfiability; segmented channel routing; wire routability; Routing;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 2005. ISCAS 2005. IEEE International Symposium on
Print_ISBN
0-7803-8834-8
Type
conf
DOI
10.1109/ISCAS.2005.1466068
Filename
1466068
Link To Document