Greedy Segmented Channel Router

An efficient solution to the generalized detailed routing problem in segmented channels forrow-based FPGAs is presented. A generalized detailed routing allows routing of each connectionusing an arbitrary number of tracks, i.e., doglegs are allowed. This approach isdifferent from the normally followed method where each connection is routed on a singlestraight track. We present a router that performs generalized segmented channel routingusing a greedy approach to route channels. The router also renders itself to limited toleranceagainst faults in the routing architecture