The Implementation of Fast Radix 2 Transforms on Array Processors

DOI10.1109/TC.1980.1675452MaRDI QIDQ3867184zbMATH OpenOpenAlexFDO

Authors 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

arithmetic complexityarray processorsdata organizationdata routing operationsfast Fourier transformparallel computation

Mathematics Subject Classification ID

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

Cited in

(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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3867184)