Constant geometry fast Fourier transforms on array processors
- 1 March 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 42 (3) , 371-375
- https://doi.org/10.1109/12.210180
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- The systolic phase rotation FFT-a new algorithm and parallel processor architecturePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Fourier Transforms in VLSIIEEE Transactions on Computers, 1983
- A Combinatorial Limit to the Computing Power of VLSI CircuitsIEEE Transactions on Computers, 1983
- The cube-connected cycles: a versatile network for parallel computationCommunications of the ACM, 1981
- The Universality of the Shuffle-Exchange NetworkIEEE Transactions on Computers, 1981
- New layouts for the shuffle-exchange graph(Extended Abstract)Published by Association for Computing Machinery (ACM) ,1981
- The Theory Underlying the Partitioning of Permutation NetworksIEEE Transactions on Computers, 1980
- The Indirect Binary n-Cube Microprocessor ArrayIEEE Transactions on Computers, 1977
- Parallel Processing with the Perfect ShuffleIEEE Transactions on Computers, 1971
- On computing the fast Fourier transformCommunications of the ACM, 1967