{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,28]],"date-time":"2026-07-28T14:15:48Z","timestamp":1785248148438,"version":"3.55.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T00:00:00Z","timestamp":1741737600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T00:00:00Z","timestamp":1741737600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["RS-2024-00334550"],"award-info":[{"award-number":["RS-2024-00334550"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discov Computing"],"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Searches for signals at low signal-to-noise ratios frequently involve correlations evaluated by the Fast Fourier Transform (FFT). To accelerate the discovery power of present and next-generation multi-messenger observatories, we here explore the implementation of FFT on wafer-scale engines. To minimize the memory overhead of the inherently non-local FFT algorithm on a homogeneous mesh of Processing Elements (PEs) with no global memory on the chip, we introduce a new synchronous slide operation (<jats:italic>Slide<\/jats:italic>) exploiting fast interconnect between adjacent PEs. The feasibility of compute-limited performance is demonstrated in linear scaling of Slide execution times with varying array sizes in preliminary benchmarks on the CS-2 WSE. As a first step, this benchmark appears promising for the proposed implementation of high-throughput FFT-based signal processing in multi-messenger astronomy.<\/jats:p>","DOI":"10.1007\/s10791-025-09508-2","type":"journal-article","created":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T13:03:53Z","timestamp":1741784633000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Slide FFT on a homogeneous mesh in wafer-scale computing"],"prefix":"10.1007","volume":"28","author":[{"given":"Maurice H. P. M.","family":"van Putten","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Leighton","family":"Wilson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adam","family":"Lavely","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mark","family":"Hair","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,3,12]]},"reference":[{"key":"9508_CR1","first-page":"157","volume":"952","author":"MA Abchouyeh","year":"2023","unstructured":"Abchouyeh MA, van Putten MHPM, Amati L. Observational prospects of double neutron star mergers and their multimessenger afterglows: LIGO discovery power. Event Rates, and Diversity, ApJ. 2023;952:157\u201377.","journal-title":"Event Rates, and Diversity, ApJ"},{"key":"9508_CR2","unstructured":"Abernathy M et al. (ET Science Team), Einstein Gravitational Wave Telescope Conceptual Design Study, Tech Rep ET-0106C-10. 2011"},{"key":"9508_CR3","unstructured":"Abbott R et al. (LIGO Scientific, Virgo), Exploring the sensitivity of next generation gravitational wave detectors\u201d. Class Quant Grav 2017;34:044001-1-044001-18"},{"key":"9508_CR4","unstructured":"Bragadeesh N. 2015 [Last accessed Feb 28 2025]. https:\/\/github.com\/clMathLibraries\/clFFT. Accessed Feb 28 2025."},{"key":"9508_CR5","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","volume":"19","author":"JW Cooley","year":"1965","unstructured":"Cooley JW, Tukey JW. An algorithm for the machine calculation of complex fourier series. Math Comput. 1965;19:297\u2013301.","journal-title":"Math Comput"},{"key":"9508_CR6","unstructured":"Evans M et al., A Horizon Study for Cosmic Explorer: Science, Observatories, and Community CE Techn Rep. CE-P2100003-v7, 2021. https:\/\/arxiv.org\/abs\/2109.09882"},{"issue":"2","key":"9508_CR7","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1109\/JPROC.2004.840301","volume":"93","author":"M Frigo","year":"2005","unstructured":"Frigo M, Johnson SG. The design and implementation of FFTW3. Proc IEEE. 2005;93(2):216\u201331.","journal-title":"Proc IEEE"},{"key":"9508_CR8","doi-asserted-by":"publisher","first-page":"2634","DOI":"10.1109\/TCSI.2009.2017125","volume":"56","author":"M Garrido","year":"2009","unstructured":"Garrido M, Parhi KK, Grajal J. A pipelined FFT architecture for real-valued signals, IEEE Trans. Circ Syst I Regul Pap. 2009;56:2634\u201343.","journal-title":"Circ Syst I Regul Pap"},{"key":"9508_CR9","first-page":"1","volume":"116","author":"SM Joshi","year":"2015","unstructured":"Joshi SM. FFT architectures: a review. Int J Comput Appl. 2015;116:1\u20135.","journal-title":"Int J Comput Appl"},{"key":"9508_CR10","doi-asserted-by":"crossref","unstructured":"Jeong H, Low TH, Grover P, Masterless coded computing: a fully-distributed coded FFT algorithm, in 56th Ann Allerton Conf Commununication, Control, and Computing (Allerton), 2018;887-894","DOI":"10.1109\/ALLERTON.2018.8636047"},{"key":"9508_CR11","doi-asserted-by":"crossref","unstructured":"Lee M, Malaya N, Moser RD, Petascale direct numerical simulation of turbulent channel flow on up to 786k cores, in SC\u201913: Proc Int Conf HPC, Networking, Storage and Analysis, IEEE, 2013:1-11","DOI":"10.1145\/2503210.2503298"},{"key":"9508_CR12","doi-asserted-by":"crossref","unstructured":"Li P, Dong W. Computation Oriented Parallel FFT Algorithms on Distributed Computer, in 3rd Int. Symp. Parallel Architectures, Algorithms and Programming, Liaoning, China, 2010; 369-373","DOI":"10.1109\/PAAP.2010.35"},{"key":"9508_CR13","doi-asserted-by":"publisher","first-page":"93422","DOI":"10.1109\/ACCESS.2021.3092312","volume":"9","author":"T Lu","year":"2021","unstructured":"Lu T, Chen Y-F, Hechtman B, Wang T, Anderson J. Large-scale discrete Fourier transform on TPUs. IEEE Access. 2021;9:93422\u201332.","journal-title":"IEEE Access"},{"key":"9508_CR14","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1088\/1475-7516\/2020\/03\/050","volume":"3","author":"M Maggiore","year":"2020","unstructured":"Maggiore M, et al. Science case for the Einstein telescope. JCAP. 2020;3:50\u2013100.","journal-title":"JCAP"},{"key":"9508_CR15","doi-asserted-by":"crossref","unstructured":"Orenes-Vera M, Sharapov I, Schreiber R et al. Wafer-Scale Fast Fourier Transforms, In ICS\u201923: Proc. 37th Int Conf Supercomp (ICS), 2023;180-191","DOI":"10.1145\/3577193.3593708"},{"key":"9508_CR16","doi-asserted-by":"publisher","first-page":"C192","DOI":"10.1137\/11082748X","volume":"34","author":"D Pekurovsky","year":"2012","unstructured":"Pekurovsky D. P3DFFT: a framework for parallel computations of Fourier transforms in three dimensions. SIAM J Sc Comp. 2012;34:C192-209.","journal-title":"SIAM J Sc Comp"},{"key":"9508_CR17","unstructured":"Plimpton S. fftMPI, a distributed-memory parallel FFT library, 2018. [Last accessed Feb 28 2025]. https:\/\/lammps.github.io\/fftmpi."},{"key":"9508_CR18","doi-asserted-by":"crossref","unstructured":"Rocki K et al., Fast Stencil-Code Computation on a Wafer-Scale Processor, 2020. [Last accessed Feb 28 2025]. arXiv:2010.03660v1.","DOI":"10.1109\/SC41405.2020.00062"},{"key":"9508_CR19","doi-asserted-by":"crossref","unstructured":"Takahashi D, Sato M, Boku T. An OpenMP imple- mentation of parallel FFT and its performance on IA-64 processors, in Int. Workshop OpenMP Appl. and Tools (Springer-Verlag), 2003;99-108","DOI":"10.1007\/3-540-45009-2_8"},{"key":"9508_CR20","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1109\/TIT.1960.1057571","volume":"6","author":"GL Turin","year":"1960","unstructured":"Turin GL. An introduction to matched filters. IRE T Inform Theory. 1960;6:311\u201329.","journal-title":"IRE T Inform Theory"},{"key":"9508_CR21","doi-asserted-by":"crossref","unstructured":"Van Loan C. Computational frameworks for the fast Fourier transform (Frontiers in Applied Mathematics), SIAM. 1992","DOI":"10.1137\/1.9781611970999"},{"key":"9508_CR22","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1088\/0004-637X\/786\/2\/146","volume":"786","author":"MHPM van Putten","year":"2014","unstructured":"van Putten MHPM, Guidorzi C, Frontera F. Broadband turbulent spectra in gamma-ray burst light curves. ApJ. 2014;786:146\u201353.","journal-title":"ApJ"},{"key":"9508_CR23","first-page":"1","volume":"093F01","author":"MHPM van Putten","year":"2017","unstructured":"van Putten MHPM. Deep searches for broadband extended gravitational-wave emission bursts by heterogeneous computing. PTEP. 2017;093F01:1\u201315.","journal-title":"PTEP"},{"issue":"A36","key":"9508_CR24","first-page":"1","volume":"669","author":"MHPM van Putten","year":"2023","unstructured":"van Putten MHPM, Della Valle M. Central engine of GRB170817A: neutron star versus Kerr black hole based on multimessenger calorimetry and event timing. Astron Astrophys. 2023;669(A36):1\u201318.","journal-title":"Astron Astrophys"},{"key":"9508_CR25","doi-asserted-by":"publisher","first-page":"L23","DOI":"10.3847\/2041-8213\/ad710f","volume":"972","author":"MHPM van Putten","year":"2024","unstructured":"van Putten MHPM, Abchouyeh MA, Della Valle M. Unveiling the central engine of core-collapse supernovae in the local universe: neutron star or black hole? ApJ Lett. 2024;972:L23-38.","journal-title":"ApJ Lett"},{"key":"9508_CR26","volume-title":"FPGA-based implementation of signal processing systems","author":"R Woods","year":"2018","unstructured":"Woods R, McAllister G, Lightbody J, Yi Y. FPGA-based implementation of signal processing systems. Hoboken: Wiley; 2018."}],"container-title":["Discover Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-025-09508-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10791-025-09508-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-025-09508-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T13:03:59Z","timestamp":1741784639000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10791-025-09508-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,12]]},"references-count":26,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["9508"],"URL":"https:\/\/doi.org\/10.1007\/s10791-025-09508-2","relation":{},"ISSN":["2948-2992"],"issn-type":[{"value":"2948-2992","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,12]]},"assertion":[{"value":"26 September 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 March 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"The authors declare no Competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"16"}}