FFTs with Near-Optimal Memory Access Through Block Data Layouts

Fast Fourier transform algorithms on large data sets achieve poor performance on various platforms because of the inefficient strided memory access patterns. These inefficient access patterns need ...