Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
This lecture covers timing verification and optimization in digital circuits, focusing on checking speed, I/O delay constraints, and cycle-time constraints. It explains gate and network delay modeling, virtual gates, and signal propagation computation. Examples illustrate delay calculations, required data-ready times, and sensitizable paths. The concept of topological critical paths, static co-sensitization, false path detection tests, and important problems in circuit timing are also discussed.
This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.
Watch on Mediaspace