254 search results - page 17 / 51 » Efficient Implementation of the Generalized Tunstall Code Ge... |
ICFP
2008
ACM
14 years 6 months ago
2008
ACM
The Revised6 Report on Scheme requires its generic equivalence predicate, equal?, to terminate even on cyclic inputs. While the terminating equal? can be implemented via a DFA-equ...
FPGA
2007
ACM
14 years 27 days ago
2007
ACM
Shrinking time-to-market and high demand for productivity has driven traditional hardware designers to use design methodologies that start from high-level languages. However, meet...
FPL
2008
Springer
13 years 8 months ago
2008
Springer
This paper examines the opportunity of using compression for accelerating the (re)configuration of FPGA devices, focusing on the choice of compression algorithms, and their hardwa...
CORR
2010
Springer
13 years 1 months ago
2010
Springer
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
An effort to formalize the process of software pipelining loops with conditions is presented in this paper. A formal framework for scheduling such loops, based on representing set...