{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2021,5,11]],"date-time":"2021-05-11T19:13:22Z","timestamp":1620760402662},"reference-count":10,"publisher":"Association for Computing Machinery (ACM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. ACM"],"published-print":{"date-parts":[[1968,4]]},"abstract":"A modified version of the Fast Fourier Transform is developed and described. This version is well adapted for use in a special-purpose computer designed for the purpose. It is shown that only three operators are needed. One operator replaces successive pairs of data points by their sums and differences. The second operator performs a fixed permutation which is an ideal shuffle of the data. The third operator permits the multiplication of a selected subset of the data by a common complex multiplier.<\/jats:p>\n If, as seems reasonable, the slowest operation is the complex multiplications required, then, for reasonably sized date sets\u2014e.g. 512 complex numbers\u2014parallelization by the method developed should allow an increase of speed over the serial use of the Fast Fourier Transform by about two orders of magnitude.<\/jats:p>\n It is suggested that a machine to realize the speed improvement indicated is quite feasible.<\/jats:p>\n The analysis is based on the use of the Kronecker product of matrices. It is suggested that this form is of general use in the development and classification of various modifications and extensions of the algorithm.<\/jats:p>","DOI":"10.1145\/321450.321457","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T11:26:10Z","timestamp":1027769170000},"page":"252-264","source":"Crossref","is-referenced-by-count":251,"title":["An Adaptation of the Fast Fourier Transform for Parallel Processing"],"prefix":"10.1145","volume":"15","author":[{"given":"Marshall C.","family":"Pease","sequence":"first","affiliation":[{"name":"Computer Techniques Laboratory, Stanford Research Institute, Menlo Park, California"}]}],"member":"320","reference":[{"key":"e_1_2_1_1_2","doi-asserted-by":"crossref","unstructured":"COOLEY J. W. LEWIS P. A. W. AND WELCH P. D. Historical notes on the Fast Fourier Transform. IEEE Trans. A U-15 (June 1967) 76-79. COOLEY J. W. LEWIS P. A. W. AND WELCH P. D. Historical notes on the Fast Fourier Transform. IEEE Trans. A U-15 (June 1967) 76-79.","DOI":"10.1109\/TAU.1967.1161903"},{"key":"e_1_2_1_2_2","doi-asserted-by":"crossref","unstructured":".. AND TUKEY J .W . An algorithm for the machine calculation of colnplex Fourier series. Math. Comput. 19 90 (April 1965) 297-301. .. AND TUKEY J .W . An algorithm for the machine calculation of colnplex Fourier series. Math. Comput. 19 90 (April 1965) 297-301.","DOI":"10.1090\/S0025-5718-1965-0178586-1"},{"key":"e_1_2_1_3_2","first-page":"229","volume-title":"Conf.","volume":"28","author":"ST M, T"},{"key":"e_1_2_1_4_2","unstructured":"BINGHAM C. GODFREY M. D. AND TUKEY J.W. Modern techniques of Power spectruin estimation. (Unpublished.) BINGHAM C. GODFREY M. D. AND TUKEY J.W. Modern techniques of Power spectruin estimation. (Unpublished.)"},{"key":"e_1_2_1_5_2","first-page":"563","volume-title":"Proe. AFIPS 1966 Fall Joint Comput. Conf.","volume":"29","author":"GENTLEMAN W. M."},{"key":"e_1_2_1_6_2","doi-asserted-by":"crossref","unstructured":"SINGLETON R. C; A method for computing the Fast Forelet Transform with auxiliary memory and limited high-speed storage. IEEE Trans. A U-15 (June 1967) 91-97. SINGLETON R. C; A method for computing the Fast Forelet Transform with auxiliary memory and limited high-speed storage. IEEE Trans. A U-15 (June 1967) 91-97.","DOI":"10.1109\/TAU.1967.1161906"},{"key":"e_1_2_1_7_2","doi-asserted-by":"crossref","unstructured":"COOLEY J. W. LEWIS P. A.\n W. AND \n WELCH P.D.\n \n \n \n Application of the Fast Fourier Transform to computation of Fourier integrals Fourier series and convolution integrals. IEEE' Trans. \n A U-\n 15 (June \n 1967\n ) 79-84. COOLEY J. W. LEWIS P. A. W. AND WELCH P.D. Application of the Fast Fourier Transform to computation of Fourier integrals Fourier series and convolution integrals. IEEE' Trans. A U-15 (June 1967) 79-84.","DOI":"10.1109\/TAU.1967.1161904"},{"key":"e_1_2_1_8_2","doi-asserted-by":"crossref","unstructured":"HELMS H. D. Fast Fourier Transform method of computing difference equAtions and simulating filters. IEEE .Trans. A U-i5 (June 1967) 85-90. HELMS H. D. Fast Fourier Transform method of computing difference equAtions and simulating filters. IEEE .Trans. A U-i5 (June 1967) 85-90.","DOI":"10.1109\/TAU.1967.1161905"},{"key":"e_1_2_1_9_2","unstructured":"G-AE SUHUICMMUTEE ON MEASUREMENT CONCEPTS. What is the Fast Fourier Transforms IEEE Trans. A U-I5 (June 1967) 45-55. G-AE SUHUICMMUTEE ON MEASUREMENT CONCEPTS. What is the Fast Fourier Transforms IEEE Trans. A U-I5 (June 1967) 45-55."},{"key":"e_1_2_1_10_2","volume-title":"Academic Press","author":"PEASE M.C.","year":"1965"}],"container-title":["Journal of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/321450.321457","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,2]],"date-time":"2021-03-02T23:09:49Z","timestamp":1614726589000},"score":1,"subtitle":[],"short-title":[],"issued":{"date-parts":[[1968,4]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1968,4]]}},"alternative-id":["10.1145\/321450.321457"],"URL":"http:\/\/dx.doi.org\/10.1145\/321450.321457","relation":{},"ISSN":["0004-5411","1557-735X"],"issn-type":[{"value":"0004-5411","type":"print"},{"value":"1557-735X","type":"electronic"}],"subject":["Artificial Intelligence","Hardware and Architecture","Information Systems","Control and Systems Engineering","Software"],"published":{"date-parts":[[1968,4]]}}}