Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
41
0

Year Published

1999
1999
2023
2023

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 56 publications
(41 citation statements)
references
References 17 publications
0
41
0
Order By: Relevance
“…However, as the datapath becomes wider, the overhead for completion detection becomes significant. Yun et al [77] observed that one way to tackle this problem is to parallelize the computation and completion detection as much as possible. Their techniques resulted in 2.8ns average-case delay for a 32-bit carry bypass adder fabricated in 0.6µm CMOS process, with only 20% completion sensing overhead on average.…”
Section: Addersmentioning
confidence: 99%
See 2 more Smart Citations
“…However, as the datapath becomes wider, the overhead for completion detection becomes significant. Yun et al [77] observed that one way to tackle this problem is to parallelize the computation and completion detection as much as possible. Their techniques resulted in 2.8ns average-case delay for a 32-bit carry bypass adder fabricated in 0.6µm CMOS process, with only 20% completion sensing overhead on average.…”
Section: Addersmentioning
confidence: 99%
“…Thus the average-case latency for asynchronous datapaths, determined roughly by the sum of the average-case delay of individual elements, is in general much lower than synchronous counterparts. Some examples of non-pipelined datapaths are Williams's divider ring [75], van Berkel et al's DCC error corrector [4], Yun et al's differential equation solver [77], and Benes et al's Huffman decoder [3].…”
Section: Datapathmentioning
confidence: 99%
See 1 more Smart Citation
“…Thus, it is better to have lots of short asynchronous states. The design generating the DIFFEQ(2) results in Tables I and II is taken from [50]. It solves a fixed equation with a fixed method (forward Euler) and so is intrinsically much smaller and simpler than DIFFEQ(1), which supports solution via Euler, modified Euler and Runge-Kutta [51].…”
Section: A Optimization: Schedulingmentioning
confidence: 99%
“…One potential advantage of asynchronous systems over their clocked counterparts, in certain applications, is better average-case performance [1,19,25]. However, the performance analysis of asynchronous systems remains a challenge.…”
Section: Introductionmentioning
confidence: 99%