After quick look at the manuscript: It is applicable to sparse signals (i.e. number of non-zero elements is not whole space). It would be applicable to inverse FFT after density modification and gain would not be that much. k-sparse approximation would loose signal (strictly speaking it does not produce exact FFT but an approximation, i.e. very weak signals (electron density, fourier coefficients) may be ignored)
At the moment I am a bit sceptical about its use in crystallography. Although with careful implementation twice speed up crystallographic FFT could be possible. Garib On 20 Jan 2012, at 17:37, Jim Fairman wrote: > New Fourier transform algorithm supposedly improves the speed of Fourier > transforms get up to "a tenfold increase in speed" depending upon > circumstances. Hopefully this will get incorporated into our refinement > programs. > > http://web.mit.edu/newsoffice/2012/faster-fourier-transforms-0118.html > > -- > Jim Fairman, Ph D. > Crystal Core Leader I/Project Leader I > Emerald BioStructures > Tel: 206-780-8914 > Cell: 240-479-6575 > E-mail: fairman....@gmail.com jfair...@embios.com > Garib N Murshudov Structural Studies Division MRC Laboratory of Molecular Biology Hills Road Cambridge CB2 0QH UK Email: ga...@mrc-lmb.cam.ac.uk Web http://www.mrc-lmb.cam.ac.uk
