5 search results - page 1 / 1 » Lower Bounds on Test Resources for Scheduled Data Flow Graph... |
DAC
1996
ACM
14 years 3 months ago
1996
ACM
GLVLSI
2000
IEEE
14 years 3 months ago
2000
IEEE
In this paper we present a novel and fast estimation technique that produces tight latency lower bounds for Data Flow Graphs representing time critical segments of the application...
ISSS
2000
IEEE
14 years 3 months ago
2000
IEEE
This paper addresses the problem of estimating lower bounds on the power consumption in scheduled data flow graphs with a fixed number of allocated resources prior to binding. T...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
This paper presents a methodology to efficiently explore the design space of communication adapters. In most digital signal processing (DSP) applications, the overall performance ...
ASPDAC
2005
ACM
14 years 4 months ago
2005
ACM
– Reducing power consumption through high-level synthesis has attracted a growing interest from researchers due to its large potential for power reduction. In this work we study ...