[eigen] Re: Eigen::FFT using Matrix |

[ Thread Index | Date Index | More lists.tuxfamily.org/eigen Archives ]

*To*: Matt Flax <flatmax@xxxxxxxxxxx>, "eigen@xxxxxxxxxxxxxxxxxxx" <eigen@xxxxxxxxxxxxxxxxxxx>*Subject*: [eigen] Re: Eigen::FFT using Matrix*From*: Mark Borgerding <mark@xxxxxxxxxxxxxx>*Date*: Fri, 08 Mar 2013 09:46:22 -0500

Matt,
Thanks for your interest and questions. I hope you do not mind; I'm replying to your questions on the mailing list. There may be other interested parties. == Stability and Accuracy As far as the stability and accuracy of FFT goes. It's very solid. There are two backends: one based on kissfft and one that uses fftw. Both have been stable for years with thousands of users. Last year, Pavel Holoborodko reported that `FFT<mpreal>` (only possible with the kissfft backend) was giving him 300 digits of accuracy. http://listengine.tuxfamily.org/lists.tuxfamily.org/eigen/2012/04/msg00021.html (The issue he noted with non-powers of two was resolved shortly thereafter) FFTW, may not be specializable to arbitrary types, but it does have speed competitive with the best libs out there, at least on a general CPU. (hint: `configure` it to use simd) The IMKL backend *will* be even faster than FFTW on intel machines. (TODO) == Matrix Args Regarding the Matrix arguments to fwd. You are correct that it does not work with non-vector types. I hope to address that at some point in the future. Nit: In your example, I think maybe you meant to put something other than "1". Matrix<float,Dynamic,1> is VectorXf, which works fine. == Roadmap I hope to refactor the FFT interface -- to make it more like the DFT unitary linear transform: e.g. in Matlab,octave we can model the DFT as a linear operator == TODO:octave:1> DFT=fft(eye(16))/sqrt(16); <---- This is what I'd like the Eigen:FFT module to be more like - Scale the forward,inverse FFTs to be orthonormal. The forward,inverse FFTs will be scaled by 1/sqrt(nfft) , sqrt(nfft) with respect to matlab - use return value proxies, this necessitates making different function names for the real vs complex fft to disambiguate the inverse case. - e.g. crossSpec += _dft.fft(x).cwiseProduct( _dft.rfft(y) ); - allow FFTs of matrices to be accomplished 1 column vector at a time, like Matlab does. - add 2d FFTs - IMKL backend == Interface Changes The TODO list will obviously change the interface (compile-time errors) and behavior(latent errors). The class may be in `unsupported/Eigen`, but the polite thing to do is have *frozen* version of the current interface for existing users. This should allow existing users to get their existing code working with little or no effort. Later they can cycle back around and switch over to the newer class. - One option is to rename the current FFT -> FFTLegacy. When the interface changes cause code to not compile, users can make trivial changes. - Another option is use a new name for the new code e.g. `FastFourierTransform`. The old `FFT` would be deprecated and eventually removed. <-- I'm leaning this way I'd welcome your opinions (or coding help, for that matter) -- Mark On 03/07/2013 06:40 PM, Matt Flax wrote: Hi Mark, |

**Messages sorted by:**[ date | thread ]- Prev by Date:
**Re: [eigen] 3.2.0-beta1 released!** - Next by Date:
**[eigen] IBM XL compilers support** - Previous by thread:
**Re: [eigen] 3.2.0-beta1 released!** - Next by thread:
**[eigen] IBM XL compilers support**

Mail converted by MHonArc 2.6.19+ | http://listengine.tuxfamily.org/ |