Results 251 to 260 of about 84,950 (295)
Some of the next articles are maybe not open access.
SIAM Journal on Scientific Computing, 1993
Fast Fourier transform (FFT) algorithms based on the Cooley-Tukey approach [cf. \textit{J. W. Cooley} and \textit{J. W. Tukey}, Math. Comput. 19, 297-301 (1965; Zbl 0127.090)] are developed for single instruction multiple data (SIMD) machines. Any combination of FFT with powers of two as the periods and some alignment requirements for the initial data ...
openaire +2 more sources
Fast Fourier transform (FFT) algorithms based on the Cooley-Tukey approach [cf. \textit{J. W. Cooley} and \textit{J. W. Tukey}, Math. Comput. 19, 297-301 (1965; Zbl 0127.090)] are developed for single instruction multiple data (SIMD) machines. Any combination of FFT with powers of two as the periods and some alignment requirements for the initial data ...
openaire +2 more sources
Parallel Computing, 1987
Several vector component fast Fourier transforms (FFT) are developed for both shared and non-shared multiprocessors. The focus is mainly on the efficiency of the movement of data. First eight FFTs algorithms are reviewed and then they are used to develop two FFTs for vector multiprocessors with shared memory.
openaire +2 more sources
Several vector component fast Fourier transforms (FFT) are developed for both shared and non-shared multiprocessors. The focus is mainly on the efficiency of the movement of data. First eight FFTs algorithms are reviewed and then they are used to develop two FFTs for vector multiprocessors with shared memory.
openaire +2 more sources
2013 IEEE High Performance Extreme Computing Conference (HPEC), 2013
The 3D FFT is critical in electrostatics computations such as those used in Molecular Dynamics simulations. On FPGAs, however, the 3D FFT was thought to be inefficient relative to other methods such as convolution-based implementations of multigrid. We find the opposite: a simple design using less than half the chip resources, and operating at a very ...
Ben Humphries, Martin C. Herbordt
openaire +2 more sources
The 3D FFT is critical in electrostatics computations such as those used in Molecular Dynamics simulations. On FPGAs, however, the 3D FFT was thought to be inefficient relative to other methods such as convolution-based implementations of multigrid. We find the opposite: a simple design using less than half the chip resources, and operating at a very ...
Ben Humphries, Martin C. Herbordt
openaire +2 more sources
2010 East-West Design & Test Symposium (EWDTS), 2010
We consider FPGA design flow with C/C++ to Verilog translation and verification and report on FPGA implementation of fast Fourier transform and Wiener filter for noise reduction of speech signals on Xilinx Virtex-4.
S. O. Churayev, B. T. Matkarimov
openaire +1 more source
We consider FPGA design flow with C/C++ to Verilog translation and verification and report on FPGA implementation of fast Fourier transform and Wiener filter for noise reduction of speech signals on Xilinx Virtex-4.
S. O. Churayev, B. T. Matkarimov
openaire +1 more source
Proceedings of the 3rd Workshop on Irregular Applications: Architectures and Algorithms, 2013
The Fast Fourier Transform (FFT) is a widely used numerical algorithm.
Cheng Wang 0001 +5 more
openaire +2 more sources
The Fast Fourier Transform (FFT) is a widely used numerical algorithm.
Cheng Wang 0001 +5 more
openaire +2 more sources
Journal of Fourier Analysis and Applications, 2008
An implementation is given of an algorithm for the numerical computation of Fourier transforms of band limited functions defined on the rotation group \(\text{SO}(3)\). The algorithm described herein uses \(\text{O}(B)\) operations to compute the Fourier coefficients of a function whose Fourier expansion uses only (the \(\text{O}(B^3)\)) spherical ...
Kostelec, Peter J., Rockmore, Daniel N.
openaire +2 more sources
An implementation is given of an algorithm for the numerical computation of Fourier transforms of band limited functions defined on the rotation group \(\text{SO}(3)\). The algorithm described herein uses \(\text{O}(B)\) operations to compute the Fourier coefficients of a function whose Fourier expansion uses only (the \(\text{O}(B^3)\)) spherical ...
Kostelec, Peter J., Rockmore, Daniel N.
openaire +2 more sources
2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2010
Registration is a ubiquitous task for image analysis applications. Generally, the requirements of registration algorithms include fast computation and large capture range. For these purposes, registration in the Fourier domain using normalized cross correlation is well suited and has been extensively studied in the literature.
openaire +1 more source
Registration is a ubiquitous task for image analysis applications. Generally, the requirements of registration algorithms include fast computation and large capture range. For these purposes, registration in the Fourier domain using normalized cross correlation is well suited and has been extensively studied in the literature.
openaire +1 more source
2007 IEEE International Conference on Image Processing, 2007
Radial blurring (sometimes called zoom blurring) of an image is a challenging problem because it is a shift-variant blur. As one travels outward from the center of an image, the blur length increases linearly with distance from the center. This shift-variant characteristic precludes the use of other traditional FFT-based deblurring techniques.
Chistopher B. Webster, Stanley J. Reeves
openaire +1 more source
Radial blurring (sometimes called zoom blurring) of an image is a challenging problem because it is a shift-variant blur. As one travels outward from the center of an image, the blur length increases linearly with distance from the center. This shift-variant characteristic precludes the use of other traditional FFT-based deblurring techniques.
Chistopher B. Webster, Stanley J. Reeves
openaire +1 more source
FFT implementation on the TMS320C30
ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing, 2003The implementation of several FFT (fast Fourier transform) algorithms on the TMS320C30, the third-generation device in the Texas Instruments family of digital signal processors is reported. The algorithms considered are the complex radix-2 and radix-4, and real-valued radix-2 FFT.
openaire +2 more sources
A Scalable Crystallographic FFT
2003Computational X-ray crystallography is the most accurate method for determining the atomic structure of crystals. Some large scale problems of current interest, such as the determination of macromolecular configurations at atomic level, demand a reiterated computation of large three-dimensional discrete Fourier transforms (DFT).
Jaime Seguel, Daniel Burbano
openaire +1 more source