The Design and Implementation of FFTW3

Proceedings of the IEEE - Tập 93 Số 2 - Trang 216-231 - 2005
Matteo Frigo1, Steven G. Johnson2
1IBM Austin Research Lab, TX, USA
2Massachusetts Institute of Technology; ,; Cambridge MA USA

Tóm tắt

Từ khóa


Tài liệu tham khảo

10.1109/29.1522

gentleman, 1966, fast fourier transforms—for fun and profit, Proc AFIPS Fall Joint Computer Conf, 29, 563

10.1109/TASSP.1986.1164804

10.1109/TAU.1969.1162042

press, 1992, Numerical Recipes in C The Art of Scientific Computing

10.2307/2006266

10.1145/355719.355729

10.1016/0167-8191(95)00050-X

10.1109/SFFCS.1999.814600

10.1007/3-540-48228-8_58

10.1109/ICASSP.2001.941115

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

10.1109/TAU.1970.1162132

10.1145/301618.301661

frigo, 2004, FFTW Web page

10.1137/1038001

10.1016/S0167-8191(84)90413-7

10.1145/1464182.1464209

10.1137/0912043

10.1109/ICASSP.1984.1172660

10.1007/s002110050074

10.1109/78.324749

10.1109/78.869030

10.1109/TASSP.1984.1164399

10.1137/S1064827593247023

10.1109/82.127302

10.1109/TASSP.1985.1164710

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

10.1109/TASSP.1980.1163351

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&#x00A0 A-2

10.1109/78.295213

10.1109/JPROC.2004.840306

gatlin, 2000, Portable high performance programming via architecture-cognizant divide-and-conquer algorithms

10.1109/ICASSP.1994.389992

cormen, 1990, Introduction to Algorithms

singer, 2002, learning to construct fast signal processing implementations, J Mach Learn Res, 3, 887

10.1090/S0025-5718-1965-0178586-1

10.1109/MASSP.1984.1162257

10.1016/0165-1684(90)90158-U

10.1137/1.9781611970999

10.1007/BF00162341

10.1145/363717.363771

jayasumana, 1987, searching for the best cooley–tukey fft algorithms, Proc IEEE Int Conf Acoustics Speech and Signal Processing, 4, 2408

10.1109/ICASSP.1998.681704

10.1145/263580.263662

10.1145/36177.36194

10.1006/jpdc.1996.0051

whaley, 1997, Automatically Tuned Linear Algebra Software

nussbaumer, 1982, Fast Fourier Transform and Convolution Algorithms, 10.1007/978-3-642-81897-4

10.1177/1094342004041291

10.1016/0021-9991(83)90034-7

10.1109/TASSP.1987.1165220

bracewell, 1986, The Hartley Transform

10.1145/364096.364118

10.1007/978-0-387-35407-1_14

10.17487/rfc1321

10.1109/JPROC.2004.840491

10.1145/378795.378860