{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:58:30Z","timestamp":1725487110284},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540428626"},{"type":"electronic","value":"9783540455745"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45574-4_8","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T11:48:41Z","timestamp":1184586521000},"page":"112-126","source":"Crossref","is-referenced-by-count":5,"title":["searching for the Best FFT Formulas with the SPL Compiler"],"prefix":"10.1007","author":[{"given":"Jeremy","family":"Johnson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert W.","family":"Johnson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David A.","family":"Padua","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianxin","family":"Xiong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,12,4]]},"reference":[{"key":"8_CR1","volume-title":"Technical Report","author":"L. Auslander","year":"1996","unstructured":"L. Auslander, J. R. Johnson, and R. W. Johnson. Automatic implementation of FFT algorithms. Technical Report 96-01, Dept. of Math. and Computer Science, Drexel University, Philadelphia, PA, June 1996. Presented at the DARPA ACMP PI meeting."},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"297","DOI":"10.2307\/2003354","volume":"19","author":"J. W. Cooley","year":"1965","unstructured":"J. W. Cooley and J. W. Tukey. An Algorithm for the Machine Calculation of Complex Fourier Series.Math. of Computation, 19:297\u2013301, 1965.","journal-title":"Math. of Computation"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"M. Frigo. A fast fourier transform compiler. In PLDI\u2019 99, pages 169\u2013180, 1999.","DOI":"10.1145\/301618.301661"},{"key":"8_CR4","first-page":"1381","volume":"3","author":"M. Frigo","year":"1998","unstructured":"M. Frigo and S. G. Johnson. FFTW: An adaptive software architecture for the FFT. In ICASSP\u2019 98, volume 3, pages 1381\u20131384, 1998. http:\/\/www.fftw.org .","journal-title":"ICASSP\u2019 98"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Johnson J., Johnson R., D Rodriguez, and R. Tolimieri. A Methodology for Designing, Modifying, and Implementing Fourier Transform Algorithms on Various Architectures. IEEE Trans. Circuits Sys., 9, 1990.","DOI":"10.1007\/BF01189337"},{"key":"8_CR6","unstructured":"J. Johnson, R. Johnson, D. Padua, and J. Xiong. SPL: Signal Processing Language, 1999. http:\/\/www.ece.cmu.edu\/~spiral\/SPL.html ."},{"key":"8_CR7","unstructured":"J. R. Johnson and R. W. Johnson. Automatic generation and implementation of FFT algorithms. In SIAM Conference on Parallel Processing for Scientific Computing, March 1999."},{"key":"8_CR8","unstructured":"J. R. Johnson and M. P\u00fcschel. In search of the optimal Walsh-Hadamard transform. In Proc. ICASSP 2000, 2000."},{"key":"8_CR9","unstructured":"T. Kisuki, P.M.W. Knijnenberg, M.F.P. O\u2019Boyle, and H.A.G. Wijshoff. Iterative compilation in program optimization. In Proc. CPC2000, pages 35\u201344, 2000."},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"H. Massalin. Superoptimizer-a look at the smallest program. In Proc. ASPLOS II, pages 122\u2013126, 1987.","DOI":"10.1145\/36177.36194"},{"key":"8_CR11","unstructured":"J. M. F. Moura, J. Johnson, R. Johnson, D. Padua, V. Prasanna, and M. M. Veloso. SPIRAL: Portable Library of Optimized SP Algorithms, 1998. http:\/\/www.ece.cmu.edu\/~spiral\/ ."},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"K. R. Rao and P. Yip. Discrete Cosine Transform. Academic Press, 1990.","DOI":"10.1016\/B978-0-08-092534-9.50007-2"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"R. Tolimieri, M. An, and C. Lu. Algorithms for Discrete Fourier Transforms and Convolution. Springer, 2nd edition, 1997.","DOI":"10.1007\/978-1-4757-2767-8"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"C. Van Loan. Computational Framework of the Fast Fourier Transform. Siam, 1992.","DOI":"10.1137\/1.9781611970999"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"R. Clint Whaley and Jack Dongarra. Automatically tuned linear algebra software (ATLAS), 1998. http:\/\/www.netlib.org\/atlas\/ .","DOI":"10.1109\/SC.1998.10004"}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for Parallel Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45574-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:05:46Z","timestamp":1556665546000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45574-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428626","9783540455745"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45574-4_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}