Sciweavers

ICCAD
1996
IEEE
95views Hardware» more  ICCAD 1996»
13 years 8 months ago
Semi-analytical techniques for substrate characterization in the design of mixed-signal ICs
A number of methods are presentedfor highly efficient calculation of substratecurrenttransport. A three-dimensionalGreen'sFunction based substrate representation, in combinat...
Edoardo Charbon, Ranjit Gharpurey, Alberto L. Sang...
FOCS
1998
IEEE
13 years 8 months ago
Towards an Optimal Bit-Reversal Permutation Program
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...
Larry Carter, Kang Su Gatlin
IPPS
2002
IEEE
13 years 9 months ago
A Prototypical Self-Optimizing Package for Parallel Implementation of Fast Signal Transforms
This paper presents a self-adapting parallel package for computing the Walsh-Hadamard transform (WHT), a prototypical fast signal transform, similar to the fast Fourier transform....
Kang Chen, Jeremy R. Johnson
ISAAC
2003
Springer
141views Algorithms» more  ISAAC 2003»
13 years 9 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
PDP
2003
IEEE
13 years 9 months ago
On Using ZENTURIO for Performance and Parameter Studies on Cluster and Grid Architectures
Over the last decade, a dramatic increase has been observed in the need for generating and organising data in the course of large parameter studies, performance analysis, and soft...
Radu Prodan, Thomas Fahringer, Michael Geissler, G...
ISSAC
2004
Springer
135views Mathematics» more  ISSAC 2004»
13 years 10 months ago
The truncated fourier transform and applications
In this paper, we present a truncated version of the classical Fast Fourier Transform. When applied to polynomial multiplication, this algorithm has the nice property of eliminati...
Joris van der Hoeven
ICESS
2004
Springer
13 years 10 months ago
Relating FFTW and Split-Radix
Recent work showed that staging and abstract interpretation can be used to derive correct families of combinatorial circuits, and illustrated this technique with an in-depth analys...
Oleg Kiselyov, Walid Taha
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
ISCAS
2005
IEEE
124views Hardware» more  ISCAS 2005»
13 years 10 months ago
Parallel FFT computation with a CDMA-based network-on-chip
— Fast Fourier transform (FFT) algorithms are used in a wide variety of digital signal processing applications and many of these require high-performance parallel implementations...
Daewook Kim, Manho Kim, Gerald E. Sobelman
IV
2006
IEEE
210views Visualization» more  IV 2006»
13 years 10 months ago
FFT and Convolution Performance in Image Filtering on GPU
Many contemporary visualization tools comprise some image filtering approach. Since image filtering approaches are very computationally demanding, the acceleration using graphic...
Ondirej Fialka, Martin Cadík