𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Performance of a pipelined ring algorithm for Fast Fourier Transform on transputer arrays

✍ Scribed by J. Purushotham; A. Basu; D. Kulkarni; L.M. Patnaik

Book ID
113212066
Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
499 KB
Volume
20
Category
Article
ISSN
0045-7906

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A high-performance fast Fourier transfor
A high-performance fast Fourier transform algorithm for the Cray-2
✍ David H. Bailey πŸ“‚ Article πŸ“… 1987 πŸ› Springer US 🌐 English βš– 660 KB

Most implementations of a radix-2 fast Fourier transform on large scientific computers use algorithms that involve memory accesses whose strides are powers of two. (The term stride means the memory increment between successive elements stored or fetched.) Such strides are unacceptable for recently d

Combination of genetic algorithm (GA) an
Combination of genetic algorithm (GA) and fast fourier transform (FFT) for synthesis of arrays
✍ L. L. Wang; D. G. Fang; W. X. Sheng πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 451 KB

## 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

Performance modelling of three parallel
Performance modelling of three parallel sorting algorithms on a pipelined transputer network
✍ Narasimhan, V. Lakshmi; Armstrong, J. πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 961 KB

The implementation of three parallel sorting algorithms, namely binary sort, odd-even transposition sort and bitonic sort, on a network of transputers is analysedin the paper. The variation in the performance of these algorithms as the number of processors and sort size are changed is investigated.