Sciweavers

CORR
2007
Springer
194views Education» more  CORR 2007»
14 years 8 days ago
Algebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for DCTs and DSTs
Abstract—This paper presents a systematic methodology to derive and classify fast algorithms for linear transforms. The approach is based on the algebraic signal processing theor...
Markus Püschel, José M. F. Moura
CORR
2006
Springer
73views Education» more  CORR 2006»
14 years 10 days ago
A Fast and Accurate Nonlinear Spectral Method for Image Recognition and Registration
This article addresses the problem of two- and higher dimensional pattern matching, i.e. the identification of instances of a template within a larger signal space, which is a for...
Luciano da Fontoura Costa, Erik Bollt
VMV
2004
208views Visualization» more  VMV 2004»
14 years 1 months ago
Fourier Volume Rendering on the GPU Using a Split-Stream-FFT
The Fourier volume rendering technique operates in the frequency domain and creates line integral projections of a 3D scalar field. These projections can be efficiently generated ...
Thomas Jansen, Bartosz von Rymon-Lipinski, Nils Ha...
ERSA
2006
113views Hardware» more  ERSA 2006»
14 years 1 months ago
Efficient FPGA-based Implementations of the MIMO-OFDM Physical Layer
- In this paper, we present a prototype FPGA design for an efficient physical layer implementation of a MIMO-OFDM technique. We propose a pipelined architecture using a Fast Fourie...
Jeoong Sung Park, Hong-Jip Jung, Viktor K. Prasann...
ICISC
2007
120views Cryptology» more  ICISC 2007»
14 years 1 months ago
Improving the Time Complexity of Matsui's Linear Cryptanalysis
This paper reports on an improvement of Matsui’s linear cryptanalysis that reduces the complexity of an attack with algorithm 2, by taking advantage of the Fast Fourier Transform...
Baudoin Collard, François-Xavier Standaert,...
FSE
2008
Springer
91views Cryptology» more  FSE 2008»
14 years 1 months ago
SWIFFT: A Modest Proposal for FFT Hashing
We propose SWIFFT, a collection of compression functions that are highly parallelizable and admit very efficient implementations on modern microprocessors. The main technique under...
Vadim Lyubashevsky, Daniele Micciancio, Chris Peik...
APCCAS
2006
IEEE
261views Hardware» more  APCCAS 2006»
14 years 2 months ago
A Grouped Fast Fourier Transform Algorithm Design For Selective Transformed Outputs
- In this paper, the grouped scheme is specially applied to compute the fast Fourier transform (FFT) when the portions of transformed outputs are calculated selectively. The groupe...
Chih-Peng Fan, Guo-An Su
CC
2008
Springer
14 years 2 months ago
Generating SIMD Vectorized Permutations
Abstract. This paper introduces a method to generate efficient vectorized implementations of small stride permutations using only vector load and vector shuffle instructions. These...
Franz Franchetti, Markus Püschel
FP
1989
124views Formal Methods» more  FP 1989»
14 years 4 months ago
Deriving the Fast Fourier Algorithm by Calculation
This paper reports an explanation of an intricate algorithm in the terms of a potentially mechanisable rigorous-development method. It uses notations and techniques of Sheeran 1] ...
Geraint Jones
DAC
1996
ACM
14 years 4 months ago
A Parallel Precorrected FFT Based Capacitance Extraction Program for Signal Integrity Analysis
In order to optimize interconnect to avoid signal integrity problems, very fast and accurate 3-D capacitance extraction is essential. Fast algorithms, such as the multipole or prec...
Narayan R. Aluru, V. B. Nadkarni, James White