FAN algorithm is an algorithm for automatic test pattern generation (ATPG). It was invented in 1983 by Hideo Fujiwara and Takeshi Shimono at the Department of Electronic Engineering, Osaka University, Japan.[1] It was the fastest ATPG algorithm at that time and was subsequently adopted by industry. The FAN algorithm succeeded in reducing the number of backtracks by adopting new heuristics such as unique sensitization and multiple back tracing.[1] Unique sensitization is to determine as many signal values as possible that can be uniquely implied. Multiple backtracing is concurrent backtracing of more than one path, which is more efficient than backtracing along a single path. In order to reduce the number of backtracks, it is important to find the nonexistence of the solution as soon as possible. When we find that there exists no solution we should backtrack immediately to avoid the subsequent unnecessary search. These heuristics can lead to the early detection of inconsistency and decrease the number of backtracks. FAN algorithm has been introduced in several books[2][3][4] and many conference papers such as ACM/IEEE Design Automation Conference, et al.[5]
Implementations
editReferences
edit- ^ a b Fujiwara, Hideo; Shimono, Takeshi (December 1983). "On the acceleration of test generation algorithm". IEEE Transactions on Computers. C-32 (12): 1137–1144. doi:10.1109/TC.1983.1676174. S2CID 9547677.
- ^ Fujiwara, Hideo (September 1985). Logic Testing and Design for Testability. MIT Press. ISBN 9780262561990.
- ^ Abramovici, Miron; Breuer, Melvin A.; Friedman, Arthur D. (1990). Digital Systems Testing and Testable Design. IEEE Press. ISBN 9780780310629.
- ^ Niraj, Jha; Gupta, Sandeep (2003). Testing of Digital Systems. Cambridge University Press. ISBN 0521773563.
- ^ Kirkland, Tom; Mercer, M. Ray (1987). "A topological search algorithm for ATPG". 24th ACM/IEEE conference proceedings on Design automation conference - DAC '87. pp. 502–508. doi:10.1145/37888.37963. ISBN 0818607815.