The Implementation of Fast Radix 2 Transforms on Array Processors

DOI10.1109/TC.1980.1675452zbMath0429.68048OpenAlexW2044720504MaRDI QIDQ3867184

C. R. Jesshope

Publication date: 1980

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1980.1675452

zbMATH Keywords

fast Fourier transformparallel computationarithmetic complexityarray processorsdata organizationdata routing operations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical methods for trigonometric approximation and interpolation (65T40) Data structures (68P05) Theory of operating systems (68N25)

Related Items (2)

Tridiagonal factorizations of Fourier matrices and applications to parallel computations of discrete Fourier transforms ⋮ PERFORMANCE ANALYSIS OF A PARALLEL FFT ALGORITHM ON A TRANSPUTER NETWORK

This page was built for publication: The Implementation of Fast Radix 2 Transforms on Array Processors