• DocumentCode
    1196933
  • Title

    The pseudoexhaustive test of sequential circuits

  • Author

    Wunderlich, Hans-Joachim ; Hellebrand, Sybille

  • Author_Institution
    Inst. of Comput. Design & Fault Tolerance, Karlsruhe Univ., Germany
  • Volume
    11
  • Issue
    1
  • fYear
    1992
  • fDate
    1/1/1992 12:00:00 AM
  • Firstpage
    26
  • Lastpage
    33
  • Abstract
    The concept of a pseudoexhaustive test for sequential circuits is introduced in a way similar to that which is used for combinational networks. Using partial scan all cycles in the data flow of a sequential circuit are removed, such that a compact combinational model can be constructed. Pseudoexhaustive test sequences for the original circuit are constructed from a pseudoexhaustive test set for this model. To make this concept feasible for arbitrary circuits a technique for circuit segmentation is presented which provides special segmentation cells as well as the corresponding algorithms for the automatic placement of the cells. Example circuits show that the test strategy requires less additional silicon area than a complete scan path. Thus the advantages of a partial scan path are combined with the well-known benefits of a pseudoexhaustive test, such as high fault coverage and simplified test generation
  • Keywords
    graph theory; logic testing; sequential circuits; automatic placement; circuit segmentation; partial scan; pseudoexhaustive test; segmentation cells; sequential circuits; Associate members; Automatic testing; Circuit faults; Circuit testing; Costs; Fault detection; Sequential analysis; Sequential circuits; Silicon; Test pattern generators;
  • fLanguage
    English
  • Journal_Title
    Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0278-0070
  • Type

    jour

  • DOI
    10.1109/43.108616
  • Filename
    108616