|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| M. H. Konijnenburg, J.Th. van der Linden, A. J. van de Goor, "Sequential Test Generation with Advanced Illegal State Search," 2012 IEEE International Test Conference, pp. 733, International Test Conference 1997 (ITC'97), 1997. | |||
| BibTex | x | ||
| @article{ 10.1109/TEST.1997.639686, author = {M. H. Konijnenburg and J.Th. van der Linden and A. J. van de Goor}, title = {Sequential Test Generation with Advanced Illegal State Search}, journal ={2012 IEEE International Test Conference}, volume = {0}, year = {1997}, issn = {1089-3539}, pages = {733}, doi = {http://doi.ieeecomputersociety.org/10.1109/TEST.1997.639686}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - 2012 IEEE International Test Conference TI - Sequential Test Generation with Advanced Illegal State Search SN - 1089-3539 SP EP A1 - M. H. Konijnenburg, A1 - J.Th. van der Linden, A1 - A. J. van de Goor, PY - 1997 KW - null VL - 0 JA - 2012 IEEE International Test Conference ER - | |||
TPG for synchronous sequential circuits has received wide attention over the last two decades, yet unlike for (full-scan) combinational circuits, for many sequential benchmark circuits 100% fault efficiency still cannot be reached. This illustrates the complexity of sequential circuit ATPG.
The huge search space, which exists during sequential circuit TPG, is the main reason for this complexity. Powerful techniques and heuristics are required to cope with this search space. One way to reduce the search space is the detection of illegal states. These states cannot be justified with an initialization sequence.
In this paper, we propose new techniques to find illegal states and to remove the over-specification of these states by searching common fractions in the list of illegal states. Experimental results demonstrate the importance of an as complete as possible illegal state list: Higher fault efficiencies are reached for the sequential ISCAS '89 circuits [1] and industrial circuits, together with a large reduction of CPU time.