{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T06:55:21Z","timestamp":1747810521084},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540757542"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75755-9_135","type":"book-chapter","created":{"date-parts":[[2007,9,22]],"date-time":"2007-09-22T02:44:54Z","timestamp":1190429094000},"page":"1178-1187","source":"Crossref","is-referenced-by-count":8,"title":["An Implementation of Parallel 1-D FFT Using SSE3 Instructions on Dual-Core Processors"],"prefix":"10.1007","author":[{"given":"Daisuke","family":"Takahashi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"135_CR1","doi-asserted-by":"publisher","first-page":"297","DOI":"10.2307\/2003354","volume":"19","author":"J.W. Cooley","year":"1965","unstructured":"Cooley, J.W., Tukey, J.W.: An algorithm for the machine calculation of complex Fourier series. Math. Comput.\u00a019, 297\u2013301 (1965)","journal-title":"Math. Comput."},{"key":"135_CR2","doi-asserted-by":"crossref","unstructured":"Nadehara, K., Miyazaki, T., Kuroda, I.: Radix-4 FFT implementation using SIMD multimedia instructions. In: Proc. 1999 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 1999), vol. 4, pp. 2131\u20132134 (1999)","DOI":"10.1109\/ICASSP.1999.758355"},{"key":"135_CR3","doi-asserted-by":"crossref","unstructured":"Franchetti, F., Karner, H., Kral, S., Ueberhuber, C.W.: Architecture independent short vector FFTs. In: Proc. 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2001), vol. 2, pp. 1109\u20131112 (2001)","DOI":"10.1109\/ICASSP.2001.941115"},{"key":"135_CR4","doi-asserted-by":"crossref","unstructured":"Rodriguez, V.P.: A radix-2 FFT algorithm for modern single instruction multiple data (SIMD) architectures. In: Proc. 2002 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2002), vol.\u00a03, pp. 3220\u20133223 (2002)","DOI":"10.1109\/ICASSP.2002.5745335"},{"key":"135_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/978-3-540-45209-6_39","volume-title":"Euro-Par 2003 Parallel Processing","author":"S. Kral","year":"2003","unstructured":"Kral, S., Franchetti, F., Lorenz, J., Ueberhuber, C.W.: SIMD vectorization of straight line FFT code. In: Kosch, H., B\u00f6sz\u00f6rm\u00e9nyi, L., Hellwagner, H. (eds.) Euro-Par 2003. LNCS, vol.\u00a02790, pp. 251\u2013260. Springer, Heidelberg (2003)"},{"key":"135_CR6","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1109\/JPROC.2004.840301","volume":"93","author":"M. Frigo","year":"2005","unstructured":"Frigo, M., Johnson, S.G.: The design and implementation of FFTW3. Proc. IEEE\u00a093, 216\u2013231 (2005)","journal-title":"Proc. IEEE"},{"key":"135_CR7","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1109\/JPROC.2004.840491","volume":"93","author":"F. Franchetti","year":"2005","unstructured":"Franchetti, F., Kral, S., Lorenz, J., Ueberhuber, C.W.: Efficient utilization of SIMD extensions. Proc. IEEE\u00a093, 409\u2013425 (2005)","journal-title":"Proc. IEEE"},{"key":"135_CR8","unstructured":"Intel Corporation: IA-32 Intel Architecture Software Developer\u2019s Manual. Basic Architecture, vol. 1 (2006)"},{"key":"135_CR9","unstructured":"Intel Corporation: Intel C++ Compiler Documentation (2006)"},{"key":"135_CR10","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF00162341","volume":"4","author":"D.H. Bailey","year":"1990","unstructured":"Bailey, D.H.: FFTs in external or hierarchical memory. The Journal of Supercomputing\u00a04, 23\u201335 (1990)","journal-title":"The Journal of Supercomputing"},{"key":"135_CR11","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970999","volume-title":"Computational Frameworks for the Fast Fourier Transform","author":"C. Loan Van","year":"1992","unstructured":"Van Loan, C.: Computational Frameworks for the Fast Fourier Transform. SIAM Press, Philadelphia (1992)"},{"key":"135_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1007\/3-540-48228-8_58","volume-title":"High-Performance Computing and Networking","author":"D. Takahashi","year":"2001","unstructured":"Takahashi, D.: A blocking algorithm for FFT on cache-based processors. In: Hertzberger, B., Hoekstra, A.G., Williams, R. (eds.) High-Performance Computing and Networking. LNCS, vol.\u00a02110, pp. 551\u2013554. Springer, Heidelberg (2001)"},{"key":"135_CR13","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0167-8191(84)90413-7","volume":"1","author":"P.N. Swarztrauber","year":"1984","unstructured":"Swarztrauber, P.N.: FFT algorithms for vector computers. Parallel Computing\u00a01, 45\u201363 (1984)","journal-title":"Parallel Computing"},{"key":"135_CR14","unstructured":"Frigo, M., Johnson, S.G.: FFTW, \n                      \n                        http:\/\/www.fftw.org"},{"key":"135_CR15","unstructured":"Intel Corporation: Intel Math Kernel Library Reference Manual (2005)"}],"container-title":["Lecture Notes in Computer Science","Applied Parallel Computing. State of the Art in Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75755-9_135.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:31:00Z","timestamp":1619519460000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75755-9_135"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540757542"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75755-9_135","relation":{},"subject":[]}}