• DocumentCode
    39211
  • Title

    Latency Analysis for Sequential Circuits

  • Author

    Finder, Alexander ; Sulflow, Andre ; Fey, Gorschwin

  • Author_Institution
    MATIS Germany GmbH, Stuttgart, Germany
  • Volume
    33
  • Issue
    4
  • fYear
    2014
  • fDate
    Apr-14
  • Firstpage
    643
  • Lastpage
    647
  • Abstract
    Verifying correctness is a major bottleneck in today´s circuit and system design. Verification includes the tasks of error detection, error localization, and error correction in an implemented design, as well as the analysis and avoidance of transient faults. For all those tasks, knowing when an assignment to signals becomes observable at the outputs and for how long it influences the system is important. In this letter, we propose a minimal and maximal latency measure for sequential circuits. This measure explains how long a circuit´s state and outputs depend on input stimuli. Exact and heuristic algorithms are discussed to determine the measure. We evaluate the algorithms on state-of-the-art designs. Experimental results show how the measure provides insight into the behavior of circuit designs.
  • Keywords
    finite state machines; network synthesis; sequential circuits; bounded model checking; circuit designs; exact algorithms; finite state machine; heuristic algorithms; latency analysis; sequential circuits; sequential equivalence checking; verification; Circuit faults; Computational modeling; Debugging; Integrated circuit modeling; Model checking; Sequential circuits; Transient analysis; Bounded model checking (BMC); debugging; latency; sequential equivalence checking (SEC); simulation; verification;
  • 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/TCAD.2013.2292501
  • Filename
    6774558