{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T20:26:24Z","timestamp":1765484784704,"version":"3.30.2"},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1988,1,1]],"date-time":"1988-01-01T00:00:00Z","timestamp":567993600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[1988,1]]},"DOI":"10.1016\/0167-8191(88)90008-7","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T17:52:02Z","timestamp":1062611522000},"page":"99-108","source":"Crossref","is-referenced-by-count":22,"title":["Implementation of a prime factor FFT algorithm on CRAY-1"],"prefix":"10.1016","volume":"6","author":[{"given":"Clive","family":"Temperton","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(88)90008-7_BIB1","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1109\/TASSP.1977.1162938","article-title":"Index mappings for multidimensional formulation of the DFT and convolution","volume":"25","author":"Burrus","year":"1977","journal-title":"IEEE Trans. Acoustic, Speech and Signal Processing"},{"key":"10.1016\/0167-8191(88)90008-7_BIB2","doi-asserted-by":"crossref","first-page":"806","DOI":"10.1109\/TASSP.1981.1163645","article-title":"An in-place in-order prime factor FFT algorith","volume":"29","author":"Burrus","year":"1981","journal-title":"IEEE Trans. Acoutics Speech and Signal Processing"},{"key":"10.1016\/0167-8191(88)90008-7_BIB3","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","article-title":"An algorithm for the machine calculation of complex Fourier series","volume":"19","author":"Cooley","year":"1965","journal-title":"Math\/ Comput."},{"key":"10.1016\/0167-8191(88)90008-7_BIB4","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1090\/S0025-5718-81-99783-0","article-title":"A vector implementaion of the Fast Fourier Transform algorithm","volume":"36","author":"Fornberg","year":"1981","journal-title":"Math. Comput."},{"key":"10.1016\/0167-8191(88)90008-7_BIB5","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1111\/j.2517-6161.1958.tb00300.x","article-title":"The interaction algorithm and practical Fourier analysis","volume":"20","author":"Good","year":"1958","journal-title":"J. Roy Statist. Soc. Ser. B"},{"key":"10.1016\/0167-8191(88)90008-7_BIB6","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1109\/TC.1983.1676137","article-title":"Characterizing computers and optimizing the FACT(l) Poisson-solver on parallel unicomputers","volume":"32","author":"Hockney","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(88)90008-7_BIB7","series-title":"PDE Software: Modules, Interfaces and Systems","first-page":"429","article-title":"The n12 method of algorithm analysis","author":"Hockey","year":"1984"},{"key":"10.1016\/0167-8191(88)90008-7_BIB8","doi-asserted-by":"crossref","first-page":"977","DOI":"10.1090\/S0025-5718-1979-0528051-4","article-title":"Computing the Fast Fourier Transform on a vector computer","volume":"33","author":"Korn","year":"1979","journal-title":"Math. Comput."},{"year":"1979","series-title":"Number Theory in Digital Signal Processing","author":"McClelland","key":"10.1016\/0167-8191(88)90008-7_BIB9"},{"year":"1982","series-title":"Fast Fourier Transform and Convolution Algorithms","author":"Nussbaumer","key":"10.1016\/0167-8191(88)90008-7_BIB10"},{"key":"10.1016\/0167-8191(88)90008-7_BIB11","series-title":"Technical Note 2240203","article-title":"Cray-1 Complex Fast Fourier Transform Binary Radix Subroutine (CFFT2)","author":"Petersen","year":"1978"},{"key":"10.1016\/0167-8191(88)90008-7_BIB12","series-title":"Parallel Computations","first-page":"490","article-title":"Vectorizing the FFT's","author":"Swarztrauber","year":"1982"},{"key":"10.1016\/0167-8191(88)90008-7_BIB13","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0167-8191(84)90413-7","article-title":"FFT algorithms for vector computers","volume":"1","author":"Swarztrabuer","year":"1984","journal-title":"Parallel Comput."},{"key":"10.1016\/0167-8191(88)90008-7_BIB14","first-page":"359","article-title":"Fast Fourier Transforms and Poisson solvers on Cray-1","volume":"Vol. 2","author":"Temperton","year":"1979"},{"key":"10.1016\/0167-8191(88)90008-7_BIB15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0021-9991(83)90013-X","article-title":"Self-sorting mixed-radix. Fast Fourier Transforms","volume":"52","author":"Temperton","year":"1983","journal-title":"J. Comput. Phys."},{"key":"10.1016\/0167-8191(88)90008-7_BIB16","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/0021-9991(83)90024-4","article-title":"A note on prime factor FFT algorithms","volume":"52","author":"Temperton","year":"1983","journal-title":"J. Comput. Phys."},{"key":"10.1016\/0167-8191(88)90008-7_BIB17","series-title":"High Speed Computation","first-page":"403","article-title":"Fast Fourier Trandforms on the Cyber 205","author":"Temperton","year":"1984"},{"key":"10.1016\/0167-8191(88)90008-7_BIB18","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0021-9991(85)90164-0","article-title":"Implementation of a self-sorting in place prime factor FFT algorithm","volume":"58","author":"Temperton","year":"1985","journal-title":"J. Comput. Phys."},{"key":"10.1016\/0167-8191(88)90008-7_BIB19","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF01933196","article-title":"On vestorizing the Fast Fourier Transform","volume":"20","author":"Wang","year":"1980","journal-title":"BIT"},{"key":"10.1016\/0167-8191(88)90008-7_BIB20","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1090\/S0025-5718-1978-0468306-4","article-title":"On computing the discrete Fourier transform","volume":"32","author":"Winograd","year":"1978","journal-title":"Math. Comput."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819188900087?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819188900087?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T17:17:12Z","timestamp":1734110232000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167819188900087"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,1]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,1]]}},"alternative-id":["0167819188900087"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(88)90008-7","relation":{},"ISSN":["0167-8191"],"issn-type":[{"type":"print","value":"0167-8191"}],"subject":[],"published":{"date-parts":[[1988,1]]}}}