{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T05:25:15Z","timestamp":1648531515808},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1988,12,1]],"date-time":"1988-12-01T00:00:00Z","timestamp":596937600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[1988,12]]},"DOI":"10.1007\/bf00156677","type":"journal-article","created":{"date-parts":[[2004,11,1]],"date-time":"2004-11-01T09:03:10Z","timestamp":1099299790000},"page":"415-433","source":"Crossref","is-referenced-by-count":3,"title":["A multi-algorithm approach to very high performance one-dimensional FFTs"],"prefix":"10.1007","volume":"2","author":[{"given":"Jim","family":"Armstrong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"An efficient formulation of the mixed-radix FFT algorithm","author":"R. Agarwal","year":"1987","unstructured":"Agarwal, R. 1987. An efficient formulation of the mixed-radix FFT algorithm. IBM T.J. Watson Research Center, Yorktown Heights, N.Y."},{"issue":"1","key":"CR2","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF00138605","volume":"1","author":"D. Bailey","year":"1987","unstructured":"Bailey, D. 1987. A high-performance fast Fourier transform algorithm for the CRAY-2. The Journal of Supercomputing, 1, 1: 43?60.","journal-title":"The Journal of Supercomputing"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"Bailey, D. 1988. A high-performance FFT algorithm for vector supercomputers. To appear in Journal of Supercomputing Applications.","DOI":"10.1177\/109434208800200106"},{"key":"CR4","volume-title":"The Fast Fourier Transform","author":"E. Brigham","year":"1974","unstructured":"Brigham, E. 1974. The Fast Fourier Transform. Prentice-Hall, Englewood Cliffs, N.J."},{"key":"CR5","first-page":"272","volume-title":"Digital Signal Processing","author":"G. Dougherty","year":"1984","unstructured":"Dougherty, G., Dougherty, R., and Stanley, W. 1984. Digital Signal Processing, 2nd ed. Reston Pub. Co., Reston, Va., pg. 272.","edition":"2nd ed."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1090\/S0025-5718-81-99783-0","volume":"36","author":"B. Fornberg","year":"1981","unstructured":"Fornberg, B. 1981. A vector implementation of the fast Fourier transform algorithm. Math. Comp., 36: 189?191.","journal-title":"Math. Comp."},{"issue":"2","key":"CR7","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1109\/T-C.1970.222875","volume":"C-19","author":"J. Glassman","year":"1970","unstructured":"Glassman, J. 1970. A generalization of the fast Fourier transform. IEEE Trans. Computers, C-19, 2: 106?166.","journal-title":"IEEE Trans. Computers"},{"key":"CR8","volume-title":"Theory and Application of Digital Signal Processing","author":"L.R. Rabiner","year":"1975","unstructured":"Rabiner, L.R., and Gold, B. 1975. Theory and Application of Digital Signal Processing. Prentice-Hall, Englewood Cliffs, N.J."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1145\/321450.321457","volume":"15","author":"M.C. Pease","year":"1968","unstructured":"Pease, M.C. 1968. An adaptation of the fast Fourier transform for parallel processing. Journal of the ACM, 15: 252?264.","journal-title":"Journal of the ACM"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0167-8191(84)90413-7","volume":"1","author":"P.N. Swartztrauber","year":"1984","unstructured":"Swartztrauber, P.N. 1984. FFT algorithms for vector computers. Parallel Computing, 1: 45?63.","journal-title":"Parallel Computing"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0167-8191(87)90018-4","volume":"5","author":"P.N. Swartztrauber","year":"1987","unstructured":"Swartztrauber, P.N. 1987. Multiprocessor FFTs. Parallel Computing, 5: 197?210.","journal-title":"Parallel Computing"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00156677.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00156677\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00156677","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T17:31:15Z","timestamp":1585935075000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00156677"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,12]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1988,12]]}},"alternative-id":["BF00156677"],"URL":"https:\/\/doi.org\/10.1007\/bf00156677","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,12]]}}}