Title :
Algorithms for timing requirement analysis and generation
Author :
Sherman, Steven K.
Author_Institution :
Digital Equipment Corp., Maynard, MA, USA
Abstract :
The author introduces timing requirement analysis and two algorithms for its implementation. The first uses a prioritization scheme to generate an approximate solution, which may result in violation. The second uses a depth-first search to find a solution that does not result in violation. Together, these algorithms are useful for timing-requirement analysis and generation and in pattern-timing generation
Keywords :
graph theory; logic design; logic testing; depth-first search; logic design verification; optimised graph; pattern-timing generation; prioritization scheme; timing requirement analysis; Algorithm design and analysis; Analytical models; Constraint optimization; Digital systems; Hardware; Logic design; Pattern analysis; Prototypes; Signal design; Timing;
Conference_Titel :
Design Automation Conference, 1988. Proceedings., 25th ACM/IEEE
Conference_Location :
Anaheim, CA
Print_ISBN :
0-8186-0864-1
DOI :
10.1109/DAC.1988.14851
