Mercurial > hg > sv-dependency-builds
comparison src/fftw-3.3.8/TODO @ 82:d0c2a83c1364
Add FFTW 3.3.8 source, and a Linux build
author | Chris Cannam |
---|---|
date | Tue, 19 Nov 2019 14:52:55 +0000 |
parents | |
children |
comparison
equal
deleted
inserted
replaced
81:7029a4916348 | 82:d0c2a83c1364 |
---|---|
1 TODO before FFTW-$2\pi$: | |
2 | |
3 * figure out how to autodetect NEON at runtime | |
4 | |
5 * figure out the arm cycle counter business | |
6 | |
7 * Wisdom: make it clear that it is specific to the exact fftw version | |
8 and configuration. Report error codes when reading wisdom. Maybe | |
9 have multiple system wisdom files, one per version? | |
10 | |
11 * DCT/DST codelets? which kinds? | |
12 | |
13 * investigate the addition-chain trig computation | |
14 | |
15 * I can't believe that there isn't a closed form for the omega | |
16 array in Rader. | |
17 | |
18 * convolution problem type(s) | |
19 | |
20 * Explore the idea of having n < 0 in tensors, possibly to mean | |
21 inverse DFT. | |
22 | |
23 * better estimator: possibly, let "other" cost be coef * n, where | |
24 coef is a per-solver constant determined via some big numerical | |
25 optimization/fit. | |
26 | |
27 * vector radix, multidimensional codelets | |
28 | |
29 * it may be a good idea to unify all those little loops that do | |
30 copying, (X[i], X[n-i]) <- (X[i] + X[n-i], X[i] - X[n-i]), | |
31 and multiplication of vectors by twiddle factors. | |
32 | |
33 * Pruned FFTs (basically, a vecloop that skips zeros). | |
34 | |
35 * Try FFTPACK-style back-and-forth (Stockham) FFT. (We tried this a | |
36 few years ago and it was slower, but perhaps matters have changed.) | |
37 | |
38 * Generate assembly directly for more processors, or maybe fork gcc. =) | |
39 | |
40 * ensure that threaded solvers generate (block_size % 4 == 0) | |
41 to allow SIMD to be used. | |
42 | |
43 * memoize triggen. |