A timing analysis algorithm for circuits with level-sensitive latches

For a logic design with level-sensitive latches, we need to validate timing signal paths which may flush through several latches. We developed efficient algorithms based on the modified shortest and longest path method. The computational complexity of our algorithm is generally better than that of known algorithms in the literature. The implementation (CYCLOPSS) has been applied to an industrial chip to verify the clock schedules.

• Type: Conference
• Year: 1994
• Where: ICCAD
• Authors: Jin-fuw Lee, Donald T. Tang, C. K. Wong
• Keywords: Hardware, ICCAD 1994, Level-sensitive Latches, Longest Path Method, Timing Signal Paths