Sciweavers

50 search results - page 1 / 10
» Deriving the Fast Fourier Algorithm by Calculation
Sort
View
FP
1989
124views Formal Methods» more  FP 1989»
13 years 8 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
CAIP
1999
Springer
145views Image Analysis» more  CAIP 1999»
13 years 9 months ago
Optimized Fast Algorithms for the Quaternionic Fourier Transform
Abstract. In this article, we deal with fast algorithms for the quaternionic Fourier transform (QFT). Our aim is to give a guideline for choosing algorithms in practical cases. Hen...
Michael Felsberg, Gerald Sommer
APCCAS
2006
IEEE
261views Hardware» more  APCCAS 2006»
13 years 6 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
JCC
2008
125views more  JCC 2008»
13 years 4 months ago
Efficient electronic integrals and their generalized derivatives for object oriented implementations of electronic structure cal
: For the new parallel implementation of electronic structure methods in ACES III (Lotrich et al., in preparation) the present state-of-the-art algorithms for the evaluation of ele...
Norbert Flocke, Victor Lotrich
RAS
2006
105views more  RAS 2006»
13 years 4 months ago
Efficient visual homing based on Fourier transformed panoramic images
We present a fast and efficient homing algorithm based on Fourier transformed panoramic images. By continuously comparing Fourier coefficients calculated from the current view wit...
Wolfgang Stürzl, Hanspeter A. Mallot