Topic
Discrete-time Fourier transform
About: Discrete-time Fourier transform is a research topic. Over the lifetime, 5072 publications have been published within this topic receiving 144643 citations. The topic is also known as: DTFT.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: A separable fast discrete Fourier transform (DFT) algorithm for hexagonally sampled data that directly computes output points on a rectangular lattice is reported.
Abstract: Hexagonal sampling is the most efficient sampling pattern for a two-dimensional circularly bandlimited function. A separable fast discrete Fourier transform (DFT) algorithm for hexagonally sampled data that directly computes output points on a rectangular lattice is reported. No interpolation is required. The algorithm has computational complexity comparable to that of standard two-dimensional fast Fourier transforms. >
40 citations
•
30 Jul 1973TL;DR: In this paper, a coherent beam of light is modulated by signals from an array of hydrophones, which are processed in a sequence that includes optical Fourier transform and re-mapping operations that conserve phase and amplitude.
Abstract: A coherent beam of light is modulated by signals from an array of hydrophones. Multi-dimensional optical Fourier transform processing is accomplished in a sequence that includes optical Fourier transform and re-mapping operations that conserve phase and amplitude. In such optical processing of signals from the array the first or temporal Fourier plane of multichannel frequency analysis is scanned to perform a sequence of one or two-dimensional spatial transforms. The spatial transforms, each of which corresponds to a discrete acoustic frequency, are performed after re-mapping the frequency analyzed data into an optical space model of the acoustic array. The means for remapping the data is a set of dielectric wave guides. Alternatively, optical signals are physically measured and then re-mapped.
40 citations
••
TL;DR: An efficient realization of discrete Legendre function transforms based on a modified and stabilized version of the Driscoll-Healy algorithm for the stable and efficient computation of Fourier expansions of square integrable functions on the unit sphere S ⊂ R 3.
40 citations
••
TL;DR: In this article, the Fast Fourier Transform (FFT) was used to calculate time-displaced correlation functions from molecular dynamics data much more rapidly (less expansively) than by using the standard integration technique.
40 citations
••
01 May 1999TL;DR: It is shown that the distribution sampled after a Fourier transform over Zp can be efficiently approximated by transforming over Z, for any q in a large range, which places no restrictions on the superposition to be transformed.
Abstract: We isolate and generalize a technique implicit in many quantum algorithms, including Shor’s algorithms for factoring and discrete log. In particular, we show that the distribution sampled after a Fourier transform over Zp can be efficiently approximated by transforming over Z, for any q in a large range. Our result places no restrictions on the superposition to be transformed, generalizing previous applications. In addition, our proof easily generalizes to multi-dimensional transforms for any constant number of dimensions.
40 citations