• DocumentCode
    1886945
  • Title

    On a New Graph Theory Approach to Designing Zero-Aliasing Space Compressors for Built-In Self-Testing

  • Author

    Das, Sunil R. ; Hossain, Altaf ; Petriu, Emil M. ; Assaf, M.H. ; Sahinoglu, Mehmet ; Jone, Wen-Ben

  • Author_Institution
    Sch. of Inf. Technol. & Eng., Ottawa Univ., Ont.
  • fYear
    2006
  • fDate
    24-27 April 2006
  • Firstpage
    1890
  • Lastpage
    1895
  • Abstract
    The design of space-efficient support hardware for built-in self-testing (BIST) is of great significance in the synthesis of present day very large scale integration (VLSI) circuits and systems, particularly in the context of design paradigm shift from system-onboard to system-on-chip (SOC). An approach to designing zero-aliasing space compaction hardware in relation to embedded cores-based SOC is proposed in this paper for single stuck-line faults, extending the well-known concepts of conventional switching theory, and of incompatibility relation to generate maximal compatibility classes (MCCs) using new graph theory concepts, based on optimal generalized sequence mergeability, as developed by the authors in earlier works. The paper briefly presents the mathematical basis of selection criteria for merger of an optimal number of outputs of the module under test (MUT) for realizing maximum compaction ratio in the design, along with some partial simulation results on ISCAS 85 combinational benchmark circuits, with programs ATALANTA and FSIM
  • Keywords
    VLSI; built-in self test; compressors; graph theory; ATALANTA; FSIM; ISCAS 85; built in self testing; combinational benchmark circuits; graph theory; maximum compaction ratio; module under test; space efficient support hardware; very large scale integration; zero aliasing space compressors; Built-in self-test; Circuit synthesis; Circuit testing; Circuits and systems; Compaction; Compressors; Graph theory; Hardware; System-on-a-chip; Very large scale integration; Aliasing-free space compactor; cores-based system-on-chip (SOC); maximal compatibility classes (MCCs); maximal minimally strongly connected (MMSC) subgraphs; nonminimally strongly connected (NMSC) pairs of vertices;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Instrumentation and Measurement Technology Conference, 2006. IMTC 2006. Proceedings of the IEEE
  • Conference_Location
    Sorrento
  • ISSN
    1091-5281
  • Print_ISBN
    0-7803-9359-7
  • Electronic_ISBN
    1091-5281
  • Type

    conf

  • DOI
    10.1109/IMTC.2006.328306
  • Filename
    4124681