• DocumentCode
    2191548
  • Title

    On selecting testable paths in scan designs

  • Author

    Shao, Yun ; Reddy, Sudhakar M. ; Pomeranz, Irith ; Kajihara, Seiji

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Iowa Univ., Iowa City, IA, USA
  • fYear
    2002
  • fDate
    2002
  • Firstpage
    53
  • Lastpage
    58
  • Abstract
    We propose an efficient method to select a minimal set of testable paths in scan designs, such that every line in the circuit is covered by at least one of the longest testable paths that contain it (if there are any). The proposed path selection approach is based on a stepwise path expansion procedure that uses delay information and compact information about untestable paths to select longest paths while avoiding untestable paths. Techniques called delay analysis and delay-constrained path expansion are used to speedup the selection of paths to test. Compared to earlier approaches, the proposed approach is fast and it is guaranteed to find testable paths. Experimental results for ISCAS89 benchmark circuits using standard scan and broadside testing are presented to demonstrate the effectiveness of the proposed method.
  • Keywords
    automatic test pattern generation; delays; integrated circuit testing; logic testing; compact information; delay analysis; delay information; delay-constrained path expansion; longest testable path delays; minimal set; path delay faults; path selection approach; scan designs; stepwise path expansion procedure; testable paths; Benchmark testing; Circuit faults; Circuit testing; Cities and towns; Clocks; Computer science; Design engineering; Electronic equipment testing; Manufacturing; Propagation delay;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Test Workshop, 2002. Proceedings. The Seventh IEEE European
  • ISSN
    1530-1877
  • Print_ISBN
    0-7695-1715-3
  • Type

    conf

  • DOI
    10.1109/ETW.2002.1029639
  • Filename
    1029639