• DocumentCode
    3042481
  • Title

    Reducing the complexity of path classification by reconvergence analysis

  • Author

    Tafertshofer, Paul ; Ganz, Andreas ; Henftling, M.

  • Author_Institution
    Inst. of Electron. Design Autom., Tech. Univ. of Munich, Germany
  • fYear
    1997
  • fDate
    28-31 Jan 1997
  • Firstpage
    401
  • Lastpage
    404
  • Abstract
    We present a new and efficient method for path classification, i.e. for determining the set of functional unsensitizable or robust dependent paths, in combinational circuits. In a pre-processing step, the new method computes a minimal set of reconvergence regions that need to be considered for path classification. Functional sensitization is only performed for path segments contained in these regions. Thus, the complexity for path classification can be reduced from the total number of paths in the circuit to the number of paths contained in the minimal set of reconvergence regions
  • Keywords
    combinational circuits; computational complexity; directed graphs; logic testing; combinational circuits; complexity; functional unsensitizable paths; path classification; path segments; reconvergence analysis; robust dependent paths; Circuit faults; Circuit testing; Delay; Dictionaries; Electronic design automation and methodology; Electronic mail; Logic testing; Partitioning algorithms; Robustness; System testing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Design Automation Conference, 1997. Proceedings of the ASP-DAC '97 Asia and South Pacific
  • Conference_Location
    Chiba
  • Print_ISBN
    0-7803-3662-3
  • Type

    conf

  • DOI
    10.1109/ASPDAC.1997.600269
  • Filename
    600269