scientific article; zbMATH DE number 800360

MaRDI QIDQ4849076zbMATH OpenFDO

Authors Plamenka Borovska

Publication date 4 February 1996

zbMATH Keywords

fast Fourier transformsfast Hartley transformshypercubic connectionparallel implementation

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Parallel numerical computation (65Y05)

Recommendations

• Two-dimensional FFT algorithms on hypercube and mesh machines
• scientific article; zbMATH DE number 1131691
• Parallel FFT algorithms for mimd computers
• Implementation of Efficient FFT Algorithms on Fused Multiply- Add Architectures

Cited in

(6)

• Gray codes, fast Fourier transforms and hypercubes
• Scalable FFT processors and pipelined butterfly units
• scientific article; zbMATH DE number 4129958 (Why is no real title available?)
• scientific article; zbMATH DE number 147703 (Why is no real title available?)
• Efficient DFT Architectures Based Upon Symmetries
• World’s Fastest FFT Architectures: Breaking the Barrier of 100 GS/s

This page was built for publication:

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