10 search results - page 2 / 2 » Timing optimization by bit-level arithmetic transformations |
FOCS
1998
IEEE
13 years 9 months ago
1998
IEEE
The speed of many computations is limited not by the number of arithmetic operations but by the time it takes to move and rearrange data in the increasingly complicated memory hie...
FPL
2007
Springer
13 years 11 months ago
2007
Springer
In this paper we present Minibit+, an approach that optimizes the bit-widths of fixed-point and floating-point designs, while guaranteeing accuracy. Our approach adopts differen...
ICCS
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. Sparse matrix-vector multiplication is an important computational kernel that tends to perform poorly on modern processors, largely because of its high ratio of memory op...
ASAP
2008
IEEE
13 years 11 months ago
2008
IEEE
Many complex systems require the use of floating point arithmetic that is exceedingly time consuming to perform on personal computers. However, floating point operators are also h...
STACS
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...