• DocumentCode
    2774376
  • Title

    Test application time reduction for scan circuits using limited scan operations

  • Author

    Cho, Yonsang ; Pomeranz, Irith ; Reddy, Sudhakar M.

  • Author_Institution
    Sch. of Electr. & Comput. Eng., Purdue Univ., West Lafayette, IN, USA
  • fYear
    2004
  • fDate
    2004
  • Firstpage
    211
  • Lastpage
    216
  • Abstract
    We describe a static compaction procedure for full-scan circuits. The procedure accepts a (compact) test set generated for the combinational logic of the circuit and produces a test set with reduced test application time and tester memory, requirements. The reductions are achieved by combining pairs of tests. When a pair of tests is combined, the scan operation required between the two tests is replaced with a limited scan operation. Under a limited scan operation a scan chain of length L is shifted a number of positions S ≤ L. As a special case, S = 0 implies that the scan operation between two tests is eliminated altogether. We introduce several techniques to ensure that consideration of test pairs can be done efficiently and results in very high levels of test compaction for benchmark circuits.
  • Keywords
    automatic test pattern generation; boundary scan testing; combinational circuits; flip-flops; logic testing; benchmark circuits; combinational logic; compact test set; essential Hamming distance; flip-flops ordering; full-scan circuits; limited scan operations; static compaction procedure; test application time reduction; Benchmark testing; Circuit faults; Circuit testing; Cities and towns; Combinational circuits; Compaction; Costs; Flip-flops; Logic testing; Sequential analysis;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Quality Electronic Design, 2004. Proceedings. 5th International Symposium on
  • Print_ISBN
    0-7695-2093-6
  • Type

    conf

  • DOI
    10.1109/ISQED.2004.1283675
  • Filename
    1283675