7393 search results - page 199 / 1479 » Synthesis-for-testability using transformations |
122
Voted
ECBS
2010
IEEE
15 years 9 months ago
2010
IEEE
Abstract—Many design steps during system development like functional partitioning, refactoring of the architecture, or the mapping to the platform - can be understood as an explo...
126
Voted
DAC
1995
ACM
15 years 7 months ago
1995
ACM
- We introduce a transformation, named rephasing, that manipulates the timing parameters in control-dataflow graphs. Traditionally high-level synthesis systems for DSP have either ...
129
click to vote
EURODAC
1995
IEEE
15 years 7 months ago
1995
IEEE
This paper describes a method to optimize the performance of data paths. It is based on bit-level arithmetic transformations, and is especially suited to optimize large adder stru...
111
Voted
TABLEAUX
1995
Springer
15 years 7 months ago
1995
Springer
We present a procedure transforming intuitionistic matrix proofs into proofs within the intuitionistic standard sequent calculus. The transformation is based on L. Wallen’s proof...
129
Voted
DATESO
2007
15 years 5 months ago
2007
The Burrows-Wheeler Transform (BWT) is a compression method which reorders an input string into the form, which is preferable to another compression. Usually Move-To-Front transfor...