- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content
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/536518, 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
Link Copied
1 Reply
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content
Hello Seifert, Urban,
Thank you for your question. Can you provide sample code that we can help figure our your problem?
BRs,
Ruqiu
Reply
Topic Options
- Subscribe to RSS Feed
- Mark Topic as New
- Mark Topic as Read
- Float this Topic for Current User
- Bookmark
- Subscribe
- Printer Friendly Page