Hi,
I am trying to compute the 1D fft along the second axis of a row-major array indexed as A[n*NK*NJ*NI+k*NJ*NI + j*NI + i].
Given the explanations here: https://software.intel.com/en-us/forums/intel-math-kernel-library/topic/..., my understanding would be that i could do a 1D fft with the strides according to the first axis, and then loop over both n and k. is this indeed the correct approach?
Many thanks and with best regards
TCE Level:
TCE Open Date:
Monday, March 23, 2020 - 00:45