A Methodology for Speeding Up Fast Fourier Transform Focusing on Memory Architecture Utilization

DOI10.1109/TSP.2011.2168525zbMATH Open1396.65174MaRDI QIDQ4573389FDOQ4573389

Authors: Vasilios Kelefouras, George Athanasiou, Nikolaos Alachiotis, Harris E. Michail, Angeliki Kritikakou, Costas Goutis 

Publication date: 18 July 2018

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

Mathematics Subject Classification ID

Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Theory of compilers and interpreters (68N20) Numerical methods for discrete and fast Fourier transforms (65T50) Mathematical problems of computer architecture (68M07) Numerical algorithms for computer arithmetic, etc. (65Y04)

Cited In (3)

• A low-memory-access length-adaptive architecture for \(2^n\)-point FFT
• Improved Twiddle Access for Fast Fourier Transforms
• A methodology for speeding up loop kernels by exploiting the software information and the memory architecture

This page was built for publication: A Methodology for Speeding Up Fast Fourier Transform Focusing on Memory Architecture Utilization

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