{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T01:44:40Z","timestamp":1785894280547,"version":"3.56.0"},"reference-count":46,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003816","name":"Huawei Technologies Co Ltd","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003816","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004536","name":"Southwest Jiaotong University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004536","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002338","name":"Ministry of Education of the People's Republic of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002338","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62271422"],"award-info":[{"award-number":["62271422"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62275222"],"award-info":[{"award-number":["62275222"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Future Generation Computer Systems"],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1016\/j.future.2026.108675","type":"journal-article","created":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T23:34:25Z","timestamp":1781739265000},"page":"108675","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["DRFFT: A dynamic and double radix FFT framework based on Ascend NPU"],"prefix":"10.1016","volume":"185","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-9582-103X","authenticated-orcid":false,"given":"Bangrui","family":"Yao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9894-5832","authenticated-orcid":false,"given":"Yang","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jia","family":"Ye","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xihua","family":"Zou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei","family":"Pan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lianshan","family":"Yan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"21","key":"10.1016\/j.future.2026.108675_b1","doi-asserted-by":"crossref","first-page":"17555","DOI":"10.1007\/s13369-025-10009-z","article-title":"Optimized FFT designs for high-performance LTE and 5G networks","volume":"50","author":"Khan","year":"2025","journal-title":"Arab. J. Sci. Eng."},{"key":"10.1016\/j.future.2026.108675_b2","series-title":"2017 Fourteenth International Conference on Wireless and Optical Communications Networks","first-page":"1","article-title":"FFT and sparse FFT techniques and applications","author":"Mohapatra","year":"2017"},{"issue":"8","key":"10.1016\/j.future.2026.108675_b3","doi-asserted-by":"crossref","first-page":"1853","DOI":"10.1016\/j.camwa.2018.07.034","article-title":"A FFT-based finite-difference solver for massively-parallel direct numerical simulations of turbulent flows","volume":"76","author":"Costa","year":"2018","journal-title":"Comput. Math. Appl."},{"issue":"1","key":"10.1016\/j.future.2026.108675_b4","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1109\/TE.1969.4320436","article-title":"The fast Fourier transform and its applications","volume":"12","author":"Cooley","year":"2007","journal-title":"IEEE Trans. Educ."},{"key":"10.1016\/j.future.2026.108675_b5","series-title":"Fnet: Mixing tokens with fourier transforms","first-page":"4296","author":"Lee-Thorp","year":"2022"},{"key":"10.1016\/j.future.2026.108675_b6","first-page":"4479","article-title":"Fast fourier convolution","volume":"33","author":"Chi","year":"2020","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"6","key":"10.1016\/j.future.2026.108675_b7","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1109\/PROC.1968.6477","article-title":"Discrete Fourier transforms when the number of data samples is prime","volume":"56","author":"Rader","year":"1968","journal-title":"Proc. the IEEE"},{"issue":"1","key":"10.1016\/j.future.2026.108675_b8","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1109\/TASSP.1978.1163036","article-title":"Z-transform DFT filters and FFT\u2019s","volume":"26","author":"Bruun","year":"1978","journal-title":"IEEE Trans. Acoust. Speech, Signal Process."},{"issue":"141","key":"10.1016\/j.future.2026.108675_b9","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. Comp."},{"issue":"1","key":"10.1016\/j.future.2026.108675_b10","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1049\/el:19840012","article-title":"\u2018Split radix\u2019FFT algorithm","volume":"20","author":"Duhamel","year":"1984","journal-title":"Electron. Lett."},{"issue":"4","key":"10.1016\/j.future.2026.108675_b11","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1109\/TAU.1970.1162132","article-title":"A linear filtering approach to the computation of discrete Fourier transform","volume":"18","author":"Bluestein","year":"2003","journal-title":"IEEE Trans. Audio Electroacoustics"},{"issue":"3","key":"10.1016\/j.future.2026.108675_b12","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1109\/LSP.2012.2184283","article-title":"Generic mixed-radix FFT pruning","volume":"19","author":"Wang","year":"2012","journal-title":"IEEE Signal Process. Lett."},{"issue":"90","key":"10.1016\/j.future.2026.108675_b13","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. Comp."},{"key":"10.1016\/j.future.2026.108675_b14","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/j.ins.2014.08.022","article-title":"Fast Fourier transform using matrix decomposition","volume":"291","author":"Zhou","year":"2015","journal-title":"Inform. Sci."},{"key":"10.1016\/j.future.2026.108675_b15","series-title":"Cufft library","author":"NVIDIA","year":"2025"},{"key":"10.1016\/j.future.2026.108675_b16","doi-asserted-by":"crossref","first-page":"93422","DOI":"10.1109\/ACCESS.2021.3092312","article-title":"Large-scale discrete Fourier transform on TPUs","volume":"9","author":"Lu","year":"2021","journal-title":"IEEE Access"},{"issue":"1","key":"10.1016\/j.future.2026.108675_b17","doi-asserted-by":"crossref","first-page":"405","DOI":"10.3390\/app14010405","article-title":"Research on high-performance Fourier transform algorithms based on the NPU","volume":"14","author":"Li","year":"2024","journal-title":"Appl. Sci."},{"key":"10.1016\/j.future.2026.108675_b18","article-title":"FFTW: Fastest Fourier transform in the west","author":"Frigo","year":"2012","journal-title":"Astrophys. Source Code Libr."},{"issue":"19","key":"10.1016\/j.future.2026.108675_b19","doi-asserted-by":"crossref","first-page":"4707","DOI":"10.1109\/TSP.2013.2273199","article-title":"The fastest Fourier transform in the south","volume":"61","author":"Blake","year":"2013","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/j.future.2026.108675_b20","series-title":"Parallel Computations","first-page":"51","article-title":"Vectorizing the ffts","author":"Swarztrauber","year":"1982"},{"key":"10.1016\/j.future.2026.108675_b21","series-title":"Fftpack: A package of fortran subprograms for the fast fourier transform of periodic and other symmetric sequences","author":"Swarztrauber","year":"1985"},{"key":"10.1016\/j.future.2026.108675_b22","series-title":"Collaborative acceleration for FFT on commercial Processing-In-Memory architectures","author":"Ibrahim","year":"2023"},{"issue":"8","key":"10.1016\/j.future.2026.108675_b23","doi-asserted-by":"crossref","first-page":"1925","DOI":"10.1109\/TPDS.2020.2977629","article-title":"Automatic generation of high-performance fft kernels on arm and x86 cpus","volume":"31","author":"Li","year":"2020","journal-title":"IEEE Trans. Parallel Distributed Syst."},{"key":"10.1016\/j.future.2026.108675_b24","doi-asserted-by":"crossref","unstructured":"Q. Lu, X. Wang, W. Ma, Y. Zhao, D. Chen, F. Liu, Gfft: a task graph based fast fourier transform optimization framework, in: Proceedings of the 52nd International Conference on Parallel Processing, 2023, pp. 513\u2013523.","DOI":"10.1145\/3605573.3605587"},{"issue":"3","key":"10.1016\/j.future.2026.108675_b25","doi-asserted-by":"crossref","first-page":"C213","DOI":"10.1137\/120885887","article-title":"PFFT: An extension of FFTW to massively parallel architectures","volume":"35","author":"Pippig","year":"2013","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"10.1016\/j.future.2026.108675_b26","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1109\/JPROC.2004.840306","article-title":"SPIRAL: Code generation for DSP transforms","volume":"93","author":"Puschel","year":"2005","journal-title":"Proc. the IEEE"},{"key":"10.1016\/j.future.2026.108675_b27","series-title":"KFR: Fast, modern C++ DSP framework","author":"Timoshkov","year":"2016"},{"key":"10.1016\/j.future.2026.108675_b28","series-title":"Arm performance libraries (ArmPL)","author":"Arm","year":"2025"},{"key":"10.1016\/j.future.2026.108675_b29","series-title":"High-Performance Computing on the Intel\u00ae Xeon Phi\u2122: How To Fully Exploit MIC Architectures","first-page":"167","article-title":"Intel math kernel library","author":"Wang","year":"2014"},{"key":"10.1016\/j.future.2026.108675_b30","series-title":"AMD optimizing CPU libraries (AOCL)","author":"AMD","year":"2025"},{"key":"10.1016\/j.future.2026.108675_b31","series-title":"2008 5th IEEE International Symposium on Biomedical Imaging: From Nano To Macro","first-page":"836","article-title":"CUDA: Scalable parallel programming for high-performance scientific computing","author":"Luebke","year":"2008"},{"key":"10.1016\/j.future.2026.108675_b32","series-title":"rocFFT library","author":"AMD","year":"2025"},{"key":"10.1016\/j.future.2026.108675_b33","series-title":"2021 IEEE International Conference on Cluster Computing","first-page":"1","article-title":"Tcfft: A fast half-precision fft library for nvidia tensor cores","author":"Li","year":"2021"},{"key":"10.1016\/j.future.2026.108675_b34","doi-asserted-by":"crossref","first-page":"12039","DOI":"10.1109\/ACCESS.2023.3242240","article-title":"VkFFT-a performant, cross-platform and open-source GPU FFT library","volume":"11","author":"Tolmachev","year":"2023","journal-title":"IEEE Access"},{"key":"10.1016\/j.future.2026.108675_b35","series-title":"Turbofft: A high-performance fast fourier transform with fault tolerance on gpu","author":"Wu","year":"2024"},{"key":"10.1016\/j.future.2026.108675_b36","series-title":"A GPU based memory optimized parallel method for FFT implementation","author":"Zhang","year":"2017"},{"issue":"3","key":"10.1016\/j.future.2026.108675_b37","first-page":"1","article-title":"MFFT: A GPU accelerated highly efficient mixed-precision large-scale FFT framework","volume":"20","author":"Zhao","year":"2023","journal-title":"ACM Trans. Archit. Code Optim."},{"key":"10.1016\/j.future.2026.108675_b38","series-title":"Tensor processing units (TPU) \u2013 google cloud","author":"Google","year":"2025"},{"issue":"1","key":"10.1016\/j.future.2026.108675_b39","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1109\/JSSC.2016.2616357","article-title":"Eyeriss: An energy-efficient reconfigurable accelerator for deep convolutional neural networks","volume":"52","author":"Chen","year":"2016","journal-title":"IEEE J. Solid-State Circuits"},{"key":"10.1016\/j.future.2026.108675_b40","series-title":"Ascend NPU computing","author":"Huawei","year":"2025"},{"key":"10.1016\/j.future.2026.108675_b41","series-title":"2021 IEEE 18th International Symposium on Biomedical Imaging","first-page":"783","article-title":"Nonuniform fast Fourier transform on TPUs","author":"Lu","year":"2021"},{"issue":"12","key":"10.1016\/j.future.2026.108675_b42","first-page":"2160","article-title":"Design and Implementation of FFT Operator for Neural Network Processor\u2014Taking Ascend910 as an Example","volume":"65","author":"He","year":"2025","journal-title":"Telecommun. Eng."},{"issue":"4","key":"10.1016\/j.future.2026.108675_b43","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1145\/1498765.1498785","article-title":"Roofline: an insightful visual performance model for multicore architectures","volume":"52","author":"Williams","year":"2009","journal-title":"Commun. ACM"},{"key":"10.1016\/j.future.2026.108675_b44","series-title":"FFTW benchmark on AMD opteron 2.2GHz (64-bit)","author":"Frigo","year":"2005"},{"key":"10.1016\/j.future.2026.108675_b45","series-title":"FFTW benchmark on Intel Pentium4 2.4GHz (gcc)","author":"Frigo","year":"2005"},{"key":"10.1016\/j.future.2026.108675_b46","series-title":"FFTW benchmark on PowerPC G5 2GHz (gcc4, 64-bit)","author":"Frigo","year":"2005"}],"container-title":["Future Generation Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X26003092?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X26003092?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T00:52:25Z","timestamp":1785891145000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167739X26003092"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,12]]},"references-count":46,"alternative-id":["S0167739X26003092"],"URL":"https:\/\/doi.org\/10.1016\/j.future.2026.108675","relation":{},"ISSN":["0167-739X"],"issn-type":[{"value":"0167-739X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"DRFFT: A dynamic and double radix FFT framework based on Ascend NPU","name":"articletitle","label":"Article Title"},{"value":"Future Generation Computer Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.future.2026.108675","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"108675"}}