World’s Fastest FFT Architectures: Breaking the Barrier of 100 GS/s

DOI10.1109/TCSI.2018.2886626zbMath1468.65228OpenAlexW2907773570WikidataQ128664672 ScholiaQ128664672MaRDI QIDQ5007586

Mario Garrido, Martin Kumm, Konrad Möller

Publication date: 26 August 2021

Published in: IEEE Transactions on Circuits and Systems I: Regular Papers (Search for Journal in Brave)

Full work available at URL: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-155881

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Parallel numerical computation (65Y05) Mathematical problems of computer architecture (68M07)

This page was built for publication: World’s Fastest FFT Architectures: Breaking the Barrier of 100 GS/s