Preciseness of discrete time verification

Shinji Kimura, Shunsuke Tsubota, Hiromasa Haneda

研究成果: Article

抜粋

The discrete time analysis of logic circuits is usually more efficient than the continuous time analysis, but the preciseness of the discrete time analysis is not guaranteed. The paper shows a method to decide a unit time for a logic circuit under which the analysis result is the same as the result based on the continuous time. The delay time of an element is specified with an interval between the minimum and maximum delay times, and we assume an analysis method which enumerates all possible delay cases under the discrete time. Our main theorem is as follows: refine the unit time by a factor of 1/2, and if the analysis result with a unit time u and that with a unit time u/2 are the same, then us is the expected unit time.

元の言語English
ページ(範囲)1755-1756
ページ数2
ジャーナルIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
E76-A
発行部数10
出版物ステータスPublished - 1993 10 1
外部発表Yes

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics

フィンガープリント Preciseness of discrete time verification' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用