{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,13]],"date-time":"2026-11-13T11:23:29Z","timestamp":1794569009984,"version":"4.9.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2000,2,1]],"date-time":"2000-02-01T00:00:00Z","timestamp":949363200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,2,1]],"date-time":"2000-02-01T00:00:00Z","timestamp":949363200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Supercomputing"],"published-print":{"date-parts":[[2000,2]]},"DOI":"10.1023\/a:1008160021085","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T08:17:47Z","timestamp":1040545067000},"page":"207-228","source":"Crossref","is-referenced-by-count":25,"title":["High-Performance Radix-2, 3 and 5 Parallel 1-D Complex FFT Algorithms for Distributed-Memory Parallel Computers"],"prefix":"10.1007","volume":"15","author":[{"given":"Daisuke","family":"Takahashi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yasumasa","family":"Kanada","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"250906_CR1","doi-asserted-by":"crossref","first-page":"1283","DOI":"10.1109\/PROC.1987.13880","volume":"75","author":"R. C. Agarwal","year":"1987","unstructured":"R. C. Agarwal and J. W. Cooley, Vectorized mixed radix discrete Fourier transform algorithms. Proc. IEEE, 75: 1283-1292, 1987.","journal-title":"Proc. IEEE"},{"key":"250906_CR2","doi-asserted-by":"crossref","unstructured":"R. C. Agarwal and F. G. Gustavson, and M. Zubair, M., A high performance parallel algorithm for 1-D FFT. '94, pp. 34-40, 1994.","DOI":"10.1109\/SUPERC.1994.344263"},{"key":"250906_CR3","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0167-8191(90)90031-4","volume":"15","author":"A. Averbuch","year":"1990","unstructured":"A. Averbuch, E. Gabber, and B. Gordissky, and Y. Medan, A parallel FFT on a MIMD machine. Parallel Computing, 15: 61-74, 1990.","journal-title":"Parallel Computing"},{"key":"250906_CR4","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF00162341","volume":"4","author":"D. H. Bailey","year":"1990","unstructured":"D. H. Bailey, FFTs in external or hierarchical memory. The Journal of Supercomputing, 4: 23-35, 1990.","journal-title":"The Journal of Supercomputing"},{"key":"250906_CR5","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1090\/S0025-5718-1968-0226899-X","volume":"22","author":"G. D. Bergland","year":"1968","unstructured":"G. D. Bergland, A fast Fourier transform algorithm using base 8 iterations. Math. Comp., 22: 275-279, 1968.","journal-title":"Math. Comp."},{"key":"250906_CR6","doi-asserted-by":"crossref","unstructured":"T. Boku, K. Itakura, H. Nakamura, and K. Nakazawa, CP-PACS: A massively parallel processor for large scale scientific calculations, Proceedings of the 1997 International Conference on Supercomputing, pp. 108-115, 1997.","DOI":"10.1145\/263580.263608"},{"key":"250906_CR7","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","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. Comp., 19: 297-301, 1965.","journal-title":"Math. Comp."},{"key":"250906_CR8","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/0167-8191(96)00015-4","volume":"22","author":"M. Hegland","year":"1996","unstructured":"M. Hegland, Real and complex fast Fourier transforms on the Fujitsu VPP 500. Parallel Computing, 22: 539-553, 1996.","journal-title":"Parallel Computing"},{"key":"250906_CR9","doi-asserted-by":"crossref","first-page":"1201","DOI":"10.1016\/0167-8191(92)90066-G","volume":"18","author":"S. L. Johnsson","year":"1992","unstructured":"S. L. Johnsson and R. L. Krawitz, Cooley-Tukey FFT on the connection machine. Parallel Computing, 18, 1201-1221, 1992.","journal-title":"Parallel Computing"},{"key":"250906_CR10","unstructured":"Message Passing Interface Forum, MPI: A Message-Passing Interface Standard, Version 1.1, 1995."},{"key":"250906_CR11","doi-asserted-by":"crossref","unstructured":"K. Nakazawa, H. Nakamura, H. Imori, and S. Kawabe, Pseudo vector processor based on registerwindowed superscalar pipeline, '92, pp. 642-651, 1992.","DOI":"10.1109\/SUPERC.1992.236638"},{"key":"250906_CR12","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1109\/PROC.1968.6477","volume":"56","author":"C. M. Rader","year":"1968","unstructured":"C. M. Rader, Discrete Fourier transforms when the number of data samples is prime. Proc. IEEE, 56: 1107-1108, 1968.","journal-title":"Proc. IEEE"},{"key":"250906_CR13","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/TAU.1969.1162042","volume":"17","author":"R. C. Singleton","year":"1969","unstructured":"R. C. Singleton, An algorithm for computing the mixed radix fast Fourier transform. IEEE Trans. Audio Electroacoust., 17: 93-103, 1969.","journal-title":"IEEE Trans. Audio Electroacoust."},{"key":"250906_CR14","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0167-8191(84)90413-7","volume":"1","author":"P. N. Swarztrauber","year":"1984","unstructured":"P. N. Swarztrauber, FFT algorithms for vector computers. Parallel Computing, 1: 45-63, 1984.","journal-title":"Parallel Computing"},{"key":"250906_CR15","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0167-8191(87)90018-4","volume":"5","author":"P. N. Swarztrauber","year":"1987","unstructured":"P. N. Swarztrauber, Multiprocessor FFTs, Parallel Computing, 5: 197-210, 1987.","journal-title":"Parallel Computing"},{"key":"250906_CR16","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/0021-9991(83)90024-4","volume":"52","author":"C. Temperton","year":"1983","unstructured":"C. Temperton, A note on prime factor FFT algorithms, J. Comput. Phys., 52: 198-204, 1983.","journal-title":"J. Comput. Phys."},{"key":"250906_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0021-9991(83)90013-X","volume":"52","author":"C. Temperton","year":"1983","unstructured":"C. Temperton, Self-sorting mixed-radix fast Fourier transforms, J. Comput. Phys., 52: 1-23, 1983.","journal-title":"J. Comput. Phys."},{"key":"250906_CR18","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1137\/0913039","volume":"13","author":"C. Temperton","year":"1992","unstructured":"C. Temperton, A generalized prime factor FFT algorithm for any N = 2p3q5r, SIAM J. Sci. Stat. Comput., 13: 676-686, 1992.","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"250906_CR19","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970999","volume-title":"Computational frameworks for the Fast Fourier Transform","author":"C. Van Loan","year":"1992","unstructured":"C. Van Loan, Computational frameworks for the Fast Fourier Transform, SIAM Press, Philadelphia, 1992."},{"key":"250906_CR20","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1090\/S0025-5718-1978-0468306-4","volume":"32","author":"S. Winograd","year":"1978","unstructured":"S. Winograd, On computing the discrete Fourier transform, Math. Comp., 32, 175-199, 1978.","journal-title":"Math. Comp."}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008160021085.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008160021085\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008160021085.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T05:19:10Z","timestamp":1754630350000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008160021085"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,2]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,2]]}},"alternative-id":["250906"],"URL":"https:\/\/doi.org\/10.1023\/a:1008160021085","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,2]]}}}