{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T00:10:07Z","timestamp":1736640607910,"version":"3.32.0"},"reference-count":11,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,25]],"date-time":"2006-10-25T00:00:00Z","timestamp":1161734400000},"content-version":"vor","delay-in-days":4284,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Concurrency: Pract. Exper."],"published-print":{"date-parts":[[1995,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The prime factor algorithm (PFA) is an efficient discrete Fourier transform (DFT) computation algorithm used when the sequence length can be decomposed into mutually prime factors. Following our previous results on PFA decomposition carried out at Caltech on hypercube machines, we present in the paper a pipeline PFA implementation suitable for multiprocessor systems with distributed memory. This implementation achieves high values of efficiency and speed\u2010up when processing multiple sequences of data. The paper shows how an optimized structure can be obtained when the concurrency among computation and communications is exploited at each node of the pipe. Experimental results obtained on transputer\u2010based structures and on the Intel<jats:italic>Touchstone<\/jats:italic>Delta system are also reported.<\/jats:p>","DOI":"10.1002\/cpe.4330070104","type":"journal-article","created":{"date-parts":[[2006,11,17]],"date-time":"2006-11-17T15:07:32Z","timestamp":1163776052000},"page":"29-41","source":"Crossref","is-referenced-by-count":3,"title":["Pipeline optimizations of the prime factor algorithm"],"prefix":"10.1002","volume":"7","author":[{"given":"R.","family":"Albrizio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Mazzone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Veneziani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Messina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Aloisio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Bochicchio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,25]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1968.6477"},{"key":"e_1_2_1_3_2","doi-asserted-by":"crossref","unstructured":"S.Winograd \u2018A new method for computing DFT \u2019Proc. IEEE Int. Conf. ASSPP 1977 pp.366\u2013368.","DOI":"10.1109\/ICASSP.1977.1170234"},{"volume-title":"DFT\/FFT Convolution Algorithms","year":"1984","author":"Burrus C. S.","key":"e_1_2_1_4_2"},{"volume-title":"Fast Fourier Transform and Convolution Algorithms","series-title":"Springer Series in Information Science","author":"Nussbaumer H. J.","key":"e_1_2_1_5_2"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(05)80051-1"},{"key":"e_1_2_1_7_2","first-page":"684","article-title":"Effects of architecture implementation on DFT algorithm performance","volume":"33","author":"Mehalic M. A.","year":"1985","journal-title":"IEEE Trans."},{"volume-title":"Solving Problems on Concurrent Processors","year":"1988","author":"Fox G. C.","key":"e_1_2_1_8_2"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/78.80774"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.4330030503"},{"volume-title":"Parallel Computing: Problems, Methods and Applications","year":"1992","author":"Aloisio G.","key":"e_1_2_1_11_2"},{"key":"e_1_2_1_12_2","unstructured":"G.Aloisio M.Bochicchio F.Corsi P.Dello RussoandP.Messina \u2018The use of switchable memory to enhance the performance of a strengthened node \u2019Proc. of the ISSM Int. Workshop on Parallel Computing Trani 10\u201313 September1991."}],"container-title":["Concurrency: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fcpe.4330070104","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/cpe.4330070104","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T23:50:00Z","timestamp":1736639400000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/cpe.4330070104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,2]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,2]]}},"alternative-id":["10.1002\/cpe.4330070104"],"URL":"https:\/\/doi.org\/10.1002\/cpe.4330070104","archive":["Portico"],"relation":{},"ISSN":["1040-3108","1096-9128"],"issn-type":[{"type":"print","value":"1040-3108"},{"type":"electronic","value":"1096-9128"}],"subject":[],"published":{"date-parts":[[1995,2]]}}}