{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T11:16:27Z","timestamp":1770290187730,"version":"3.49.0"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Institute of Information and Communications Technology Planning and Evaluation (IITP) Grant through Korean Government [Ministry of Science and ICT (MSIT)]","award":["2020-0-00594"],"award-info":[{"award-number":["2020-0-00594"]}]},{"DOI":"10.13039\/501100003725","name":"Basic Science Research Program through the National Research Foundation of Korea (NRF) through the Ministry of Education","doi-asserted-by":"publisher","award":["2021R1I1A3048263"],"award-info":[{"award-number":["2021R1I1A3048263"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3108404","type":"journal-article","created":{"date-parts":[[2021,8,27]],"date-time":"2021-08-27T20:04:50Z","timestamp":1630094690000},"page":"120261-120273","source":"Crossref","is-referenced-by-count":17,"title":["HI-FFT: Heterogeneous Parallel In-Place Algorithm for Large-Scale 2D-FFT"],"prefix":"10.1109","volume":"9","author":[{"given":"Homin","family":"Kang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8311-5975","authenticated-orcid":false,"given":"Jaehong","family":"Lee","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9075-3983","authenticated-orcid":false,"given":"Duksu","family":"Kim","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-13-9965-7"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2018.2827055"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/1810085.1810127"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1810085.1810128"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/IV.2006.53"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1186562.1015800"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/PARCOMPTECH.2015.7084519"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2013.18"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/IAEAC.2018.8577843"},{"key":"ref34","article-title":"AccFFT: A library for distributed-memory FFT on CPU and GPU architectures","author":"gholami","year":"2015","journal-title":"arXiv 1506 07933"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2878271"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/120885887"},{"key":"ref29","first-page":"112","article-title":"The FFT on a GPU","author":"moreland","year":"2003","journal-title":"Proc SIGGRAPH\/Eurographics Workshop Graphics Hardware"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/83.506761"},{"key":"ref1","author":"oppenheim","year":"1999","journal-title":"Discrete-Time Signal Processing"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/PCCC.2013.6742796"},{"key":"ref22","first-page":"103","article-title":"Efficient fpga implementation of fft\/ifft processor","volume":"3","author":"saeed","year":"2009","journal-title":"Int J Circuits Syst Signal Process"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2006.13"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-15-7486-3_53"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.micpro.2018.04.003"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/11082748X"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2071379.2071383"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1364\/OE.23.025440"},{"key":"ref10","year":"2021","journal-title":"CUDA Runtime API CUDA Toolkit Documentation"},{"key":"ref11","year":"2020","journal-title":"CUFFT Library"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1002\/jnm.1960"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2788396"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1155\/2010\/540159"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2009.01556.x"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2011.14"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2013.71"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-019-8184-3"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1995896.1995937"},{"key":"ref19","first-page":"1","article-title":"An efficient, model-based CPU-GPU heterogeneous FFT library","author":"ogata","year":"2008","journal-title":"Proc IEEE Int Symp Parallel Distrib Process"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0165-1684(90)90158-U"},{"key":"ref3","article-title":"Fast training of convolutional networks through FFTs","author":"mathieu","year":"2013","journal-title":"Arxiv 1312 5851"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1016\/j.future.2017.09.073","article-title":"Parallel ant colony optimization on multi-core SIMD CPUs","volume":"79","author":"zhang","year":"2018","journal-title":"Future Gener Comput Syst"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1965-0178586-1"},{"key":"ref8","year":"2020","journal-title":"Intel Math Kernel Library"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.1998.681704"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2005.260"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-015-0594-2"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2013.6522332"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/325096.325150"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1364\/AO.56.00F138"},{"key":"ref47","year":"2020","journal-title":"OpenMP"},{"key":"ref42","volume":"11","author":"drepper","year":"2007","journal-title":"What Every Programmer Should Know About Memory"},{"key":"ref41","author":"quinn","year":"1994","journal-title":"Parallel Computing Theory and Practice"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/FPL.2009.5272532"},{"key":"ref43","author":"cheng","year":"2014","journal-title":"Professional CUDA C Programming"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09524622.pdf?arnumber=9524622","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:57:41Z","timestamp":1639771061000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9524622\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":50,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3108404","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}