User loginNavigation 
Relating FFTW and SplitRadix
Relating FFTW and SplitRadix. Proc. of ICESS'04, the First International Conference on Embedded Software and System, December 910 2004, Hangzhou (Zhejiang), China.
This ongoing attempt to reproduce an efficient implementation of FFT using staging and abstract interpretation attempts to answer the question "How can we get the raw performance of hardware without giving up the expressivity and clarity of software?" Here's how Oleg describes the contribution of this paper,
One may think that generating truly optimal poweroftwo FFT is straightforward: we generate the naive radix2 FFT code, and then optimize it, removing trivial multiplications (x*1), trivial additions (x+0), etc. That was the approach demonstrated previously. Oleg points out that the point isn't that they managed to reproduced the FFTW results. The crucial point is that we know exactly which identities (i.e., axioms) contributed to the optimum. The search was principled rather heuristic, and the code is generated in only one pass. There are no manipulations on the code: it is generated just right. By Ehud Lamm at 20050419 08:13  MetaProgramming  Software Engineering  other blogs  9071 reads

Browse archivesActive forum topics 
Recent comments
1 day 16 hours ago
1 day 17 hours ago
1 day 18 hours ago
1 day 18 hours ago
1 day 19 hours ago
1 day 20 hours ago
2 days 2 hours ago
2 days 3 hours ago
2 days 3 hours ago
2 days 19 hours ago