Segmented channel routing with pin rearrangements via satisfiability

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.