HW Implementation of the Backtrace Algorithm with Conflict-Driven Dynamic Reconfiguration
M. Stava, Ondřej Novák · 2006
Recently, a method for transformation of combinational circuits into a corresponding backward-determining structure was proposed in order to implement the backtrace algorithm into hardware. This structure is designed to find all possible assignments of values to primary inputs for achieving selected objectives. It differs from the known backtrace algorithms used in ATPG tools, where only the first valid assignment is found. A new proposed method, presented in this paper, extends the backward-determining structure by conflict-driven dynamic reconfiguration. The experimental data obtained for the ISCAS'85 benchmarks show that the area overhead is polynomial for implementation of transformed circuits without reconfiguration as well as of transformed circuits with reconfiguration. A conclusion of the experiments is that the average speed up is about 12% and the average growth of an area overhead is about 112%.