Incremental routing in FPGAs

In this paper we present algorithms for incrementally routing circuits mapped to field-programmable gate arrays (FPGAs). The algorithms work well for ripping up and rerouting nets connected to small numbers of displaced logic blocks. Additionally the algorithms are sequential and compact, therefore making them ideal for embedding in hardware. Given an FPGA with a readable as well as writable configuration memory, these algorithms require no prior knowledge of the mapped circuit's netlist. Experimental results indicate our router works well for fault tolerance and other applications.

[1]  Dinesh Bhatia,et al.  A Multi-Terminal Net Router for Field-Programmable Gate Arrays , 1996 .

[2]  Dinesh Bhatia,et al.  REACT: Reactive Environment for Runtime Reconfiguration , 1998, FPL.

[3]  Shantanu Dutt,et al.  Node-covering based defect and fault tolerance methods for increased yield in FPGAs , 1996, Proceedings of 9th International Conference on VLSI Design.

[4]  Anmol Mathur,et al.  Re-engineering of timing constrained placements for regular architectures , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[5]  Jonathan Rose,et al.  A detailed router for field-programmable gate arrays , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[6]  Dinesh Bhatia,et al.  Partial reconfiguration of FPGA mapped designs with applications to fault tolerance and yield enhancement , 1997, FPL.