Results 271 to 280 of about 73,593 (306)
Some of the next articles are maybe not open access.
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
FFTs in external of hierarchical memory
Proceedings of the 1989 ACM/IEEE conference on Supercomputing - Supercomputing '89, 1989Conventional algorithms for computing large one-dimensional fast Fourier transforms (FFTs), even those algorithms recently developed for vector and parallel computers, are largely unsuitable for systems with external or hierarchical memory. The principal reason for this is the fact that most FFT algorithms require at least m complete passes through the
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 +1 more source
Proceedings of the 1993 ACM/IEEE conference on Supercomputing - Supercomputing '93, 1993
This paper describes how high compute intensity programming techniques combined with algorithms in the literature can result in efficient single- and multi-dimensional FFTs on large numbers of processors on the CRAY APP. The CRAY APP is a shared-memory parallel computer based on the Intel i860 microprocessor.
openaire +1 more source
This paper describes how high compute intensity programming techniques combined with algorithms in the literature can result in efficient single- and multi-dimensional FFTs on large numbers of processors on the CRAY APP. The CRAY APP is a shared-memory parallel computer based on the Intel i860 microprocessor.
openaire +1 more source
FFT Length in Digital Filtering
IEEE Transactions on Computers, 1979When the FFT is employed for nonrecursive digital filtering, the time required to process one block of input data, N samples long, is often approximately of the form N(logr (N) + Q), where Q ≥ 0. Earlier results on determining optimum N have assued Q ≥0, becauese it has long been informally observed that typically little is to be gained by taking the ...
openaire +1 more source
Proceedings of the IEEE, 1970
This letter contains a graph paper summarizing many properties of Fourier transforms and fast Fourier transform (FFT) devices. It shows the interrelationships among data block length, frequency resolution sampling rate, FFT stages, and other related variables.
openaire +1 more source
This letter contains a graph paper summarizing many properties of Fourier transforms and fast Fourier transform (FFT) devices. It shows the interrelationships among data block length, frequency resolution sampling rate, FFT stages, and other related variables.
openaire +1 more source
The FFT as a Multigrid Algorithm
SIAM Review, 1990William L. Briggs, Van Emden Henson
openaire +1 more source
FPGA Implementation of an Efficient FFT Processor for FMCW Radar Signal Processing
Sensors, 2021Jinmoo Heo, Yunho Jung, Seongjoo Lee
exaly
2018
This note gives a formula for the exact number of non-trival multipliers required in the basic N-point FFT algorithms, where N is an integral power of 2.
openaire +1 more source
This note gives a formula for the exact number of non-trival multipliers required in the basic N-point FFT algorithms, where N is an integral power of 2.
openaire +1 more source