3 search results - page 1 / 1 » Towards an Optimal Bit-Reversal Permutation Program |
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...
ISCAS
2006
IEEE
13 years 10 months ago
2006
IEEE
The efficient design of multiplierless implementa- The goal is to find the optimal sub-expressions across all N dot tions of constant matrix multipliers is challenged by the huge p...
SODA
2000
ACM
13 years 6 months ago
2000
ACM
We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameter...