We review briefly computational methods for Discrete Fourier Transforms (DFT) and present new techniques which are especially efficient for 2-and 3-dimensional DFT implemented on a Cray X-MP. Comparative timings are given.
Derivation and implementation of an efficient fast fourier transform algorithm (EFFT)
β Scribed by Robert Skarjune
- Publisher
- Elsevier Science
- Year
- 1986
- Tongue
- English
- Weight
- 1005 KB
- Volume
- 10
- Category
- Article
- ISSN
- 0097-8485
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract Designing proteins with novel protein/protein binding properties can be achieved by combining the tools that have been developed independently for protein docking and protein design. We describe here the sequenceβindependent generation of protein dimer orientations by protein docking fo
## Abstract A novel method based on a combination of genetic algorithm (GA) and fast Fourier transform (FFT) is developed to synthesize antenna arrays. Compared with the synthesis method using GA in an angle domain, it can calculate more quickly while maintaining the same precision. Simulation resu
The focus of this study is how we can efficiently implement the neural network backpropagation algorithm on a network of computers (NOC) for concurrent execution. We assume a distributed system with heterogeneous computers and that the neural network is replicated on each computer. We propose an arc