Sciweavers

14 search results - page 3 / 3
» Twiddle factor transformation for pipelined FFT processing
Sort
View
LCPC
2004
Springer
13 years 10 months ago
HiLO: High Level Optimization of FFTs
As computing platforms become more and more complex, the task of optimizing performance critical codes becomes more challenging. Recently, more attention has been focused on automa...
Nick Rizzolo, David A. Padua
ISAAC
2003
Springer
141views Algorithms» more  ISAAC 2003»
13 years 10 months ago
Quasi-optimal Arithmetic for Quaternion Polynomials
Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fas...
Martin Ziegler
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
13 years 10 months ago
Rewriting Variables: The Complexity of Fast Algebraic Attacks on Stream Ciphers
Recently proposed algebraic attacks [2, 6] and fast algebraic attacks [1, 5] have provided the best analyses against some deployed LFSR-based ciphers. The process complexity is exp...
Philip Hawkes, Gregory G. Rose
SI3D
2003
ACM
13 years 10 months ago
Shear-image order ray casting volume rendering
This paper describes shear-image order ray casting, a new method for volume rendering. This method renders sampled data in three dimensions with image quality equivalent to the be...
Yin Wu, Vishal Bhatia, Hugh C. Lauer, Larry Seiler