منابع مشابه
Time Interval Analyzers & Universal Counters
■ STANDARD OF TIME AND MEASURING INSTRUMENTS ● Definition of One Second Frequency f is expressed as shown below if the number of times a phenomenon repeats per second is represented by N. f = N/1 [1/s] = 1/T [Hz] T is the time for which the phenomenon occurs once and is called a period. The frequency and the period (time) are related as inverses of each other and represent essentially the same ...
متن کاملSEU-Tolerant QDI Circuits
This paper addresses the issue of Single-Event Upset (SEU) in quasi delay-insensitive (QDI) asynchronous circuits. We show that an SEU can cause abnormal computations in QDI circuits beside deadlock, and we propose a general method to make QDI circuits SEU-tolerant. We present a simplified SEUtolerant buffer implementations for CMOS technology. Finally, we present a case study of a one-bit comp...
متن کاملA Time Compensator for Large Scintillation Counters*
A circuit is described which develops time-invariant pulses for large scintillation trigger counters. For a 8.56 ft long counter, a unit capable of f 22 nsec range is described; the constancy of delay of output for this unit over the full delay range is typically & 400 psec. * Work supported by the U. S. Atomic Energy Commission. (Submitted to Nucl. Instr . & Methods. ) 1 D Introduction One of ...
متن کاملQDI Implementations of Boolean Graphs
Implementing combinational logic efficiently in QDI designs is hard, due to the need to acknowledge every transition, and naive approaches are often used. The paper demonstrates the problem of using Delay-Insensitive Minterm Synthesis on anything but the smallest designs.These problems can be overcome by employing techniques from MultiLevel Logic synthesis. An initial method using Roth-Karp dec...
متن کاملPolynomial Time Image Computation With Interval-de nable Counters Systems
The model checking of counters systems often reduces to the e ective computation of the set of predecessors Pre (X ) of a Presburgerde nable set X . Because there often exists an integer k 0 such that Pre (X ) = Pre (X ) we will rst look for an eÆcient algorithm to compute the set Pre(X) in function of X. In general, such a computation is exponential in the size of X. In [BB03], the computation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Very Large Scale Integration (VLSI) Systems
سال: 2019
ISSN: 1063-8210,1557-9999
DOI: 10.1109/tvlsi.2018.2867289