• DocumentCode
    3102672
  • Title

    Built-in self-testable data path synthesis

  • Author

    Yang, Laurence Tianruo ; Muzio, J.

  • Author_Institution
    Dept. of Comput. Sci., St. Francis Xavier Univ., Antigonish, NS, Canada
  • fYear
    2001
  • fDate
    37012
  • Firstpage
    78
  • Lastpage
    84
  • Abstract
    In this paper, we describe a high-level data path allocation algorithm to facilitate built-in self test. It generates self-testable data path design while maximizing the sharing of modules and test registers. The sharing of modules and test registers enables only a small number of registers is modified for BIST, thereby decreasing the hardware area which is one of the major overheads for BIST technique. In our approach, both module allocation and register allocation are performed incrementally. In each iteration, module allocation is guided by a testability balance technique while register allocation aims at increasing the sharing degrees of registers. With a variety of benchmarks, we demonstrate the advantage of our approach compared with other conventional approaches
  • Keywords
    built-in self test; high level synthesis; integrated circuit testing; logic testing; BIST; benchmarks; built-in self-testable data path synthesis; hardware area; high-level data path allocation algorithm; module allocation; modules; register allocation; test registers; testability balance technique; Automatic testing; Built-in self-test; Circuit testing; Computer science; Digital circuits; Hardware; Logic testing; Manufacturing; Registers; Test pattern generators;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    VLSI, 2001. Proceedings. IEEE Computer Society Workshop on
  • Conference_Location
    Orlando, FL
  • Print_ISBN
    0-7695-1056-6
  • Type

    conf

  • DOI
    10.1109/IWV.2001.923143
  • Filename
    923143