Selection criteria for efficient implementation of FFT algorithms

DOI10.1109/TASSP.1982.1163858MaRDI QIDQ3677119zbMATH OpenOpenAlexFDO

Authors J. D. Blanken, P. L. Rustan

Publication date 1982

Published in IEEE Transactions on Acoustics, Speech, and Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tassp.1982.1163858

zbMATH Keywords

fast Fourier transformFortran algorithmsmixed radix discrete Fourier transform

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40)

Recommendations

• Very fast computation of the radix-2 discrete Fourier transform
• An in-order, partially in-place mixed radix FFT algorithm
• scientific article; zbMATH DE number 3926792
• scientific article; zbMATH DE number 3915602
• scientific article; zbMATH DE number 3926790

Cited in

(2)

• An in-order, partially in-place mixed radix FFT algorithm
• scientific article; zbMATH DE number 3976284 (Why is no real title available?)

This page was built for publication: Selection criteria for efficient implementation of FFT algorithms

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