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