An algorithm for distributed computation of FFTs

DOI10.1016/0045-7906(87)90002-4MaRDI QIDQ1097679zbMATH OpenOpenAlexFDO

Authors Donald E. Kirk, Jacques G. Verly

Publication date 1987

Published in Computers and Electrical Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0045-7906(87)90002-4

zbMATH Keywords

fast Fourier transformfault toleranceparallel processingdistributed processingbutterfly interconnection network

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Numerical methods for trigonometric approximation and interpolation (65T40) Trigonometric interpolation (42A15)

Recommendations

• scientific article; zbMATH DE number 3997125
• scientific article; zbMATH DE number 1131691
• Parallel FFT algorithms for mimd computers
• FFT algorithms and their adaptation to parallel processing
• Two and three dimensional FFTs on highly parallel computers

Cited in

(6)

• An efficient algorithm-based concurrent error detection for FFT networks
• A decentralized algorithm for spectral analysis
• A parallel FFT algorithm for transputer networks
• Fault tolerance in computing, compressing, and transmitting FFT data
• On the realization of discrete cosine transform using the distributed arithmetic
• Fast Distributed Algorithms for Computing Separable Functions

This page was built for publication: An algorithm for distributed computation of FFTs

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