The Design and Implementation of FFTW3
Tóm tắt
Từ khóa
Tài liệu tham khảo
gentleman, 1966, fast fourier transforms—for fun and profit, Proc AFIPS Fall Joint Computer Conf, 29, 563
press, 1992, Numerical Recipes in C The Art of Scientific Computing
rader, 1968, discrete fourier transforms when the number of data samples is prime, Proceedings of the IEEE, 56, 1107, 10.1109/PROC.1968.6477
oppenheim, 1999, Discrete-Time Signal Processing
frigo, 2004, FFTW Web page
chan, 1990, direct methods for computing discrete sinusoidal transforms, Radar and Signal Processing IEE Proceedings F, 137, 433, 10.1049/ip-f-2.1990.0063
vuduc, 2000, code generators for automatic tuning of numerical kernels: experiences with fftw, Semantics Application and Implementation of Code Generators Workshop, 10.1007/3-540-45350-4_14
rao, 1990, Discrete Cosine Transform Algorithms Advantages Applications Appendix  A-2
gatlin, 2000, Portable high performance programming via architecture-cognizant divide-and-conquer algorithms
cormen, 1990, Introduction to Algorithms
singer, 2002, learning to construct fast signal processing implementations, J Mach Learn Res, 3, 887
jayasumana, 1987, searching for the best cooley–tukey fft algorithms, Proc IEEE Int Conf Acoustics Speech and Signal Processing, 4, 2408
whaley, 1997, Automatically Tuned Linear Algebra Software
bracewell, 1986, The Hartley Transform