devtools/eigen
1
0
Fork 0
mirror of https://gitlab.com/libeigen/eigen.git synced 2026-04-10 11:34:33 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fix FFT when destination does not have unit stride.

Browse Source
This commit is contained in:
Antonio Sánchez
2024-05-07 17:18:29 +00:00
committed by Rasmus Munk Larsen
parent 99c18bce6e
commit e16d70bd4e
2 changed files with 67 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

32
unsupported/test/fft_test_shared.h
View File

@@ -163,10 +163,42 @@ void test_complex_generic(int nfft) {
VERIFY(T(dif_rmse(inbuf, buf3)) < test_precision<T>()); // gross check
}
template <typename T>
void test_complex_strided(int nfft) {
typedef typename FFT<T>::Complex Complex;
typedef typename Eigen::Vector<Complex, Dynamic> ComplexVector;
constexpr int kInputStride = 3;
constexpr int kOutputStride = 7;
constexpr int kInvOutputStride = 13;
FFT<T> fft;
ComplexVector inbuf(nfft * kInputStride);
inbuf.setRandom();
ComplexVector outbuf(nfft * kOutputStride);
outbuf.setRandom();
ComplexVector invoutbuf(nfft * kInvOutputStride);
invoutbuf.setRandom();
using StridedComplexVector = Map<ComplexVector, /*MapOptions=*/0, InnerStride<Dynamic>>;
StridedComplexVector input(inbuf.data(), nfft, InnerStride<Dynamic>(kInputStride));
StridedComplexVector output(outbuf.data(), nfft, InnerStride<Dynamic>(kOutputStride));
StridedComplexVector inv_output(invoutbuf.data(), nfft, InnerStride<Dynamic>(kInvOutputStride));
for (int k = 0; k < nfft; ++k)
input[k] = Complex((T)(rand() / (double)RAND_MAX - .5), (T)(rand() / (double)RAND_MAX - .5));
fft.fwd(output, input);
VERIFY(T(fft_rmse(output, input)) < test_precision<T>()); // gross check
fft.inv(inv_output, output);
VERIFY(T(dif_rmse(inv_output, input)) < test_precision<T>()); // gross check
}
template <typename T>
void test_complex(int nfft) {
test_complex_generic<StdVectorContainer, T>(nfft);
test_complex_generic<EigenVectorContainer, T>(nfft);
test_complex_strided<T>(nfft);
}
template <typename T, int nrows, int ncols>