Sciweavers

1246 search results - page 175 / 250
» Recursive Timed Automata
Sort
View
98
Voted
DAC
1999
ACM
16 years 3 months ago
Equivalent Elmore Delay for RLC Trees
- Closed form solutions for the 50% delay, rise time, overshoots, and settling time of signals in an RLC tree are presented. These solutions have the same accuracy characteristics ...
Eby G. Friedman, José Luis Neves, Yehea I. ...
96
Voted
ISBI
2008
IEEE
16 years 3 months ago
RLS-grappa: Reconstructing parallel MRI data with adaptive filters
GRAPPA is one of the predominant methods used to reconstruct accelerated parallel MRI data. In has been shown previously that spatially varying the GRAPPA reconstruction coefficie...
William Scott Hoge, Fernando Gallego, Zhikui Xiao,...
WORDS
2003
IEEE
15 years 7 months ago
A Tool for Automatic Flow Analysis of C-programs for WCET Calculation
Bounding the Worst Case Execution Time (WCET) of programs is essential for real-time systems. To be able to do WCET calculations, the iteration bounds for loops and recursion must...
Jan Gustafsson, Björn Lisper, Christer Sandbe...
ISCAS
1999
IEEE
88views Hardware» more  ISCAS 1999»
15 years 6 months ago
Signal waveform characterization in RLC trees
- Closed form solutions for the 50% delay, rise time, overshoot characteristics, and settling time of signals in an RLC tree are presented. These solutions have the same accuracy c...
Yehea I. Ismail, Eby G. Friedman, José Luis...
ICCD
1996
IEEE
170views Hardware» more  ICCD 1996»
15 years 6 months ago
Boolean Function Representation Based on Disjoint-Support Decompositions
The Multi-Level Decomposition Diagrams (MLDDs) of this paper are a canonical representation of Boolean functions expliciting disjoint-support decompositions. MLDDs allow the reduc...
Valeria Bertacco, Maurizio Damiani