Field-programmable gate arrays have the potential to provide reconfigurability in the presence of faults. In this paper, we have investigated the problem of partially reconfiguring FPGA mapped designs. We present a maximum matching based algorithm to reconfigure the placement on an FPGA with little or no impact on circuit performance. Experimental results indicate the algorithm works well for both fault tolerance and reconfigurable computing applications. We also present the motivation and feasibility of using a similar approach for dynamic circuit reconfigurability.
CITATION STYLE
Emmert, J. M., & Bhatia, D. (1997). Partial reconfiguration of FPGA mapped designs with applications to fault tolerance and yield enhancement. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1304, pp. 141–150). Springer Verlag. https://doi.org/10.1007/3-540-63465-7_219
Mendeley helps you to discover research relevant for your work.