{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,3]],"date-time":"2024-01-03T16:47:48Z","timestamp":1704300468759},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,5,13]],"date-time":"2014-05-13T00:00:00Z","timestamp":1399939200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sign Process Syst"],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1007\/s11265-014-0889-9","type":"journal-article","created":{"date-parts":[[2014,5,12]],"date-time":"2014-05-12T05:14:49Z","timestamp":1399871689000},"page":"275-281","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Dynamically Generating FFT Code"],"prefix":"10.1007","volume":"76","author":[{"given":"Anthony","family":"Blake","sequence":"first","affiliation":[]},{"given":"Matt","family":"Hunter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,5,13]]},"reference":[{"key":"889_CR1","doi-asserted-by":"crossref","unstructured":"Bernstein, D. (2007). The tangent FFT. In Applied algebra, algebraic algorithms and error-correcting codes (pp. 291\u2013300).","DOI":"10.1007\/978-3-540-77224-8_34"},{"key":"889_CR2","unstructured":"Blake, A. (2012). Computing the fast Fourier transform on SIMD microprocessors. Ph.D. thesis, University of Waikato, New Zealand."},{"issue":"19","key":"889_CR3","doi-asserted-by":"crossref","first-page":"4707","DOI":"10.1109\/TSP.2013.2273199","volume":"61","author":"A Blake","year":"2013","unstructured":"Blake, A., Witten, I., Cree, M. (2013). The fastest Fourier transform in the south. IEEE Transactions on Signal Processing, 61(19), 4707\u20134716.","journal-title":"IEEE Transactions on Signal Processing"},{"key":"889_CR4","doi-asserted-by":"crossref","unstructured":"Blake, A.M. (2013). Dynamically generating FFT code on mobile devices. In Proceedings of the 2013 IEEE international conference on acoustics, speech and signal processing, 2013.","DOI":"10.1109\/ICASSP.2013.6638119"},{"issue":"6","key":"889_CR5","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1109\/MSP.2009.934155","volume":"26","author":"F Franchetti","year":"2009","unstructured":"Franchetti, F., P\u00fcschel, M., Voronenko, Y., Chellappa, S., Moura, J.M.F. (2009). Discrete Fourier transform on multicore. IEEE Signal Processing Magazine, special issue on \u201cSignal Processing on Platforms with Multiple Cores\u201d, 26(6), 90\u2013102.","journal-title":"IEEE Signal Processing Magazine, special issue on \u201cSignal Processing on Platforms with Multiple Cores\u201d"},{"key":"889_CR6","doi-asserted-by":"crossref","unstructured":"Frigo, M., & Johnson, S. (1998). FFTW: an adaptive software architecture for the FFT. In Proceedings of the 1998 IEEE international conference on acoustics, speech and signal processing, 1998 (Vol. 3, pp. 1381\u20131384).","DOI":"10.1109\/ICASSP.1998.681704"},{"issue":"2","key":"889_CR7","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1109\/JPROC.2004.840301","volume":"93","author":"M Frigo","year":"2005","unstructured":"Frigo, M., & Johnson, S. (2005). The design and implementation of FFTW3. Proceedings of the IEEE, 93(2), 216\u2013231.","journal-title":"Proceedings of the IEEE"},{"key":"889_CR8","doi-asserted-by":"crossref","unstructured":"Frigo, M., Leiserson, C., Prokop, H., Ramachandran, S. (1999). Cache-oblivious algorithms. In 40th annual symposium on foundations of computer science, 1999 (pp. 285\u2013297).","DOI":"10.1109\/SFFCS.1999.814600"},{"key":"889_CR9","doi-asserted-by":"crossref","first-page":"1084","DOI":"10.1049\/el:19890725","volume":"25","author":"RA Gopinath","year":"1989","unstructured":"Gopinath, R.A. (1989). Conjugate pair fast Fourier transform. Electronics Letters, 25, 1084.","journal-title":"Electronics Letters"},{"issue":"1","key":"889_CR10","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1109\/TSP.2006.882087","volume":"55","author":"S Johnson","year":"2006","unstructured":"Johnson, S., & Frigo, M. (2006). A modified split-radix FFT with fewer arithmetic operations. IEEE Transactions on Signal Processing, 55(1), 111\u2013119.","journal-title":"IEEE Transactions on Signal Processing"},{"key":"889_CR11","unstructured":"Johnson, S.G., & Frigo, M. (2008). Implementing FFTs in practice, Chapt 11. In C.S. Burrus (Ed.), Fast Fourier transforms, Connexions. Houston: Rice University."},{"key":"889_CR12","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1049\/el:19890225","volume":"25","author":"I Kamar","year":"1989","unstructured":"Kamar, I., & Elcherif, Y. (1989). Conjugate pair fast Fourier transform. Electronics Letters, 25, 324.","journal-title":"Electronics Letters"},{"key":"889_CR13","unstructured":"Kleene, S., de Bruijn, N., de Groot, J., Zaanen, A. (1952). Introduction to metamathematics."},{"key":"889_CR14","doi-asserted-by":"crossref","first-page":"1143","DOI":"10.1049\/el:19920721","volume":"28","author":"AM Krot","year":"1992","unstructured":"Krot, A.M., & Minervina, H.B. (1992). Conjugate pair fast Fourier transform. Electronics Letters, 28, 1143.","journal-title":"Electronics Letters"},{"key":"889_CR15","doi-asserted-by":"crossref","unstructured":"Mirkovic, D., & Johnsson, L. (2001). Automatic performance tuning in the UHFFT library. Lecture notes in computer science (pp. I\u201371).","DOI":"10.1007\/3-540-45545-0_17"},{"key":"889_CR16","unstructured":"P\u00fcschel, M., Franchetti, F., Voronenko, Y. (2011). Encyclopedia of parallel computing, Chapt. Spiral. Springer."},{"issue":"2","key":"889_CR17","first-page":"232","volume":"93","author":"M P\u00fcschel","year":"2005","unstructured":"P\u00fcschel, M., Moura, J.M.F., Johnson, J., Padua, D., Veloso, M., Singer, B., Xiong, J., Franchetti, F., Gacic, A., Voronenko, Y., Chen, K., Johnson, R.W., Rizzolo, N. (2005). SPIRAL: code generation for DSP transforms. Proceedings of the IEEE, special issue on \u201cProgram Generation, Optimization, and Adaptation, 93(2), 232\u2013275.","journal-title":"Proceedings of the IEEE, special issue on \u201cProgram Generation, Optimization, and Adaptation"},{"key":"889_CR18","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1049\/el:19900351","volume":"26","author":"H-S Qian","year":"1990","unstructured":"Qian, H.-S., & Zhao, Z.-J. (1990). Conjugate pair fast Fourier transform. Electronics Letters, 26, 541.","journal-title":"Electronics Letters"},{"key":"889_CR19","unstructured":"Rivest, R., & Leiserson, C. (1990). Introduction to algorithms."},{"key":"889_CR20","doi-asserted-by":"crossref","unstructured":"Sandberg, A., Ekl\u00f6v, D., Hagersten, E. (2010). Reducing cache pollution through detection and elimination of non-temporal memory accesses. In Proceedings of the 2010 ACM\/IEEE international conference for high performance computing, networking, storage and analysis (pp. 1\u201311).","DOI":"10.1109\/SC.2010.44"},{"key":"889_CR21","doi-asserted-by":"crossref","unstructured":"Yavne, R. (1968). An economical method for calculating the discrete Fourier transform. In Proceedings of the December 9\u201311, 1968, fall joint computer conference, part I (pp. 115\u2013125).","DOI":"10.1145\/1476589.1476610"}],"container-title":["Journal of Signal Processing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-014-0889-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11265-014-0889-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-014-0889-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,10]],"date-time":"2019-08-10T10:56:32Z","timestamp":1565434592000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11265-014-0889-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,13]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,9]]}},"alternative-id":["889"],"URL":"https:\/\/doi.org\/10.1007\/s11265-014-0889-9","relation":{},"ISSN":["1939-8018","1939-8115"],"issn-type":[{"value":"1939-8018","type":"print"},{"value":"1939-8115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,13]]}}}