A fast Fourier transform compiler
Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation
A novel algorithm for computing the 2D split-vector-radix FFT
Signal Processing
A fast Fourier transform compiler
ACM SIGPLAN Notices - Best of PLDI 1979-1999
A methodology for generating verified combinatorial circuits
Proceedings of the 4th ACM international conference on Embedded software
Automatic Performance Tuning for Fast Fourier Transforms
International Journal of High Performance Computing Applications
ICESS'04 Proceedings of the First international conference on Embedded Software and Systems
| Hi-index | 35.68 |
Describes a set of programs for circular convolution and prime length fast Fourier transforms (FFTs) that are relatively short, possess great structure, share many computational procedures, and cover a large variety of lengths. The programs make clear the structure of the algorithms and clearly enumerate independent computational branches that can be performed in parallel. Moreover, each of these independent operations is made up of a sequence of suboperations that can be implemented as vector/parallel operations. This is in contrast with previously existing programs for prime length FFTs: They consist of straight line code, no code is shared between them, and they cannot be easily adapted for vector/parallel implementations. The authors have also developed a program that automatically generates these programs for prime length FTTs. This code-generating program requires information only about a set of modules for computing cyclotomic convolutions