Results 261 to 270 of about 129,078 (307)
Some of the next articles are maybe not open access.
The Partial Fast Fourier Transform
Journal of Scientific Computing, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
John C. Bowman, Zayd Ghoggali
openaire +2 more sources
The fast Fourier transform for experimentalists
Computing in Science & Engineering, 2005In part one of this series, we discussed several basic properties of the fast Fourier transform (FFT). In addition to fundamental elements, we treated zero padding, aliasing, the relationship to a Fourier series, and ended with an introduction to windowing.
Denis Donnelly, Bert W. Rust
openaire +1 more source
Fast and precise Fourier transforms
IEEE Transactions on Information Theory, 2000Summary: Many applications of fast Fourier transforms (FFT's) such as computer tomography, geophysical signal processing, and high-resolution imaging radars and prediction filters, require high-precision output. An error analysis reveals that the usual method of fixed-point computation of FFT's of vectors of length \(2^\ell\) bits of precision.
Joe Buhler +2 more
openaire +1 more source
A PARALLEL FAST FOURIER TRANSFORM
International Journal of Modern Physics C, 1999In this paper we discuss the general problem of implementing the multidimensional Fast Fourier Transform algorithm on parallel computers. We show that, on a machine with P processors and fully parallel node communications, the optimal asymptotic scaling behavior of the total computational time with the number of data points, N, given in d dimensions ...
Morante, Silvia +2 more
openaire +1 more source
The hexagonal fast fourier transform
2016 IEEE International Conference on Image Processing (ICIP), 2016The discrete Fourier transform is an important tool for processing digital images. Efficient algorithms for computing the Fourier transform are known as fast Fourier transforms (FFTs). One of the most common of these is the Cooley-Tukey radix-2 decimation algorithm that efficiently transforms one-dimensional data into its frequency domain ...
James B. Birdsong, Nicholas I. Rummelt
openaire +1 more source
Proceedings of the November 7-10, 1966, fall joint computer conference on XX - AFIPS '66 (Fall), 1966
The "Fast Fourier Transform" has now been widely known for about a year. During that time it has had a major effect on several areas of computing, the most striking example being techniques of numerical convolution, which have been completely revolutionized. What exactly is the "Fast Fourier Transform"?
W. Morven Gentleman, G. Sande
openaire +1 more source
The "Fast Fourier Transform" has now been widely known for about a year. During that time it has had a major effect on several areas of computing, the most striking example being techniques of numerical convolution, which have been completely revolutionized. What exactly is the "Fast Fourier Transform"?
W. Morven Gentleman, G. Sande
openaire +1 more source
A Pipeline Fast Fourier Transform
IEEE Transactions on Computers, 1970This paper describes a novel structure for a hardwired fast Fourier transform (FFT) signal processor that promises to permit digital spectrum analysis to achieve throughput rates consistent with extremely wide-band radars. The technique is based on the use of serial storage for data and intermediate results and multiple arithmetic units each of which ...
Herbert L. Groginsky, George A. Works
openaire +1 more source
Integer fast Fourier transform
IEEE Transactions on Signal Processing, 2002A concept of integer fast Fourier transform (IntFFT) for approximating the discrete Fourier transform is introduced. Unlike the fixed-point fast Fourier transform (FxpFFT), the new transform has the properties that it is an integer-to-integer mapping, is power adaptable and is reversible.
Soontorn Oraintara +2 more
openaire +1 more source
2004
Abstract This chapter demonstrates the use of different data distributions in different phases of a parallel fast Fourier transform (FFT), which is a regular computation with a predictable but challenging data access pattern. Both the block and cyclic distributions are used and also intermediates between them.
openaire +1 more source
Abstract This chapter demonstrates the use of different data distributions in different phases of a parallel fast Fourier transform (FFT), which is a regular computation with a predictable but challenging data access pattern. Both the block and cyclic distributions are used and also intermediates between them.
openaire +1 more source
Fast Fourier Transform for Hexagonal Aggregates
Journal of Mathematical Imaging and Vision, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jaime L. Zapata, Gerhard X. Ritter
openaire +1 more source