On the General False Path Problem in Timing Analysis

作者: D. H. Du , S. H. Yen , S. Ghanta

DOI: 10.1145/74382.74475

关键词:

摘要: The false path problem is often referred to as the of detecting longest sensitizable (A which not a path). term “false path” clearly defined. In this paper, we first give clear and precise definition path. Then general formulated. detect whether given (not necessarily one) We present an efficient algorithm for solving problem. also propose another generates all possible paths with delays greater than threshold T. efficiency effectiveness proposed are demonstrated by experimental results.Index Terms: Timing Verification, Logic Simulation, VLSI circuit, Analysis, False path, Graph Theory.

参考文章(7)
R. Reddi, C. Chen, Hierarchical timing verification system Computer-aided Design. ,vol. 18, pp. 467- 471 ,(1986) , 10.1016/0010-4485(86)90002-3
Toshinori Aoyama, Akihiko Yamada, Katsutoshi Hasegawa, Tohru Sasaki, Shunichi Kato, Shinichi Sato, Hierarchical Design Verification for Large Digital Systems design automation conference. pp. 105- 112 ,(1981) , 10.5555/800073.802287
J.K. Ousterhout, A Switch-Level Timing Verifier for Digital MOS VLSI IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. ,vol. 4, pp. 336- 349 ,(1985) , 10.1109/TCAD.1985.1270130
Robert. B. Hitchcock, Gordon L. Smith, David D. Cheng, Timing Analysis of Computer Hardware IBM Journal of Research and Development. ,vol. 26, pp. 100- 105 ,(1982) , 10.1147/RD.261.0100
HC Yen, Subbarao Ghanta, HC Du, None, A path selection algorithm for timing analysis design automation conference. pp. 720- 723 ,(1988) , 10.5555/285730.285855
Robert B. Hitchcock, Timing Verification and the Timing Analysis Program design automation conference. pp. 446- 456 ,(1982) , 10.5555/800263.809264