HI-FFT: Heterogeneous Parallel In-place Algorithm for Large-scale 2D-FFT

Fast Fourier Transform (FFT) is a fundamental operation for 2D data in various applications. To accelerate large-scale 2D-FFT computation, we propose a Heterogeneous parallel In-place 2D-FFT algorithm, HI-FFT. Our novel work decomposition method makes it possible to run our parallel algorithm on the...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE access Ročník 9; s. 1
Hlavní autoři:	Kang, Homin, Lee, Jaehong, Kim, Duksu
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Piscataway IEEE 01.01.2021 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	2D-FFT Algorithms Central processing units Computation Computer memory CPU CPUs Decomposition Discrete Fourier transforms Fast Fourier transformations Fourier transforms GPU Graphics processing units Heterogeneous Heterogeneous networks In-place Libraries Matrix decomposition Memory management Parallel Parallel algorithms Priority scheduling
ISSN:	2169-3536, 2169-3536
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	Fast Fourier Transform (FFT) is a fundamental operation for 2D data in various applications. To accelerate large-scale 2D-FFT computation, we propose a Heterogeneous parallel In-place 2D-FFT algorithm, HI-FFT. Our novel work decomposition method makes it possible to run our parallel algorithm on the original data (i.e., in-place), unlike prior parallel algorithms that require additional memory space (i.e., out-of-place) to guarantee independence among sub-tasks. Our work decomposition method also removes the duplicated operations on the out-of-place approaches. Using our decomposition method, we introduced an in-place heterogeneous parallel algorithm that utilizes both multi-core CPU and GPU simultaneously. To maximize the utilization efficiency of the computing resources, we also propose a priority-based dynamic scheduling method.We compared the performance of seven different 2D-FFT algorithms, including ours, for large-scale 2D-FFT problems whose sizes varied from 20K2 to 120K2. As a result, we found that our method achieved up to 2.92 and 4.42 times higher performance than the conventional homogeneous parallel algorithms based on the state-of-the-art CPU and GPU libraries, respectively. Also, our method showed up to 2.27 times higher performance than the prior heterogeneous algorithms while requiring two times less memory space. To check the benefit of our HI-FFT on an actual application, we applied it to a CGH (Computer Generated Holography) process. We found that it successfully reduces the hologram generation time. These results demonstrate the advantage of our approach for large-scale 2D-FFT computation.
AbstractList	Fast Fourier Transform (FFT) is a fundamental operation for 2D data in various applications. To accelerate large-scale 2D-FFT computation, we propose a Heterogeneous parallel In-place 2D-FFT algorithm, HI-FFT. Our novel work decomposition method makes it possible to run our parallel algorithm on the original data (i.e., in-place), unlike prior parallel algorithms that require additional memory space (i.e., out-of-place) to guarantee independence among sub-tasks. Our work decomposition method also removes the duplicated operations on the out-of-place approaches. Using our decomposition method, we introduced an in-place heterogeneous parallel algorithm that utilizes both multi-core CPU and GPU simultaneously. To maximize the utilization efficiency of the computing resources, we also propose a priority-based dynamic scheduling method. We compared the performance of seven different 2D-FFT algorithms, including ours, for large-scale 2D-FFT problems whose sizes varied from 20K2 to 120K2. As a result, we found that our method achieved up to 2.92 and 4.42 times higher performance than the conventional homogeneous parallel algorithms based on the state-of-the-art CPU and GPU libraries, respectively. Also, our method showed up to 2.27 times higher performance than the prior heterogeneous algorithms while requiring two times less memory space. To check the benefit of our HI-FFT on an actual application, we applied it to a CGH (Computer Generated Holography) process. We found that it successfully reduces the hologram generation time. These results demonstrate the advantage of our approach for large-scale 2D-FFT computation.
Author	Kang, Homin Kim, Duksu Lee, Jaehong
Author_xml	– sequence: 1 givenname: Homin surname: Kang fullname: Kang, Homin organization: School of Computer Engineering, Korea University of Technology and Education (KOREATECH), Cheonan, South Korea – sequence: 2 givenname: Jaehong surname: Lee fullname: Lee, Jaehong organization: School of Computer Engineering, Korea University of Technology and Education (KOREATECH), Cheonan, South Korea – sequence: 3 givenname: Duksu surname: Kim fullname: Kim, Duksu organization: School of Computer Engineering, Korea University of Technology and Education (KOREATECH), Cheonan, South Korea. (e-mail: bluekdct@gmail.com)
BookMark	eNqFUU1r20AQXUoKTZP8glwEPcvd3VntR27GjWuDoYWk52W0GjkyG627kg_995GjEEovncsMj_cx8D6ziz71xNit4AshuPu6XK3uHx4WkkuxAMGt4uoDu5RCuxIq0Bd_3Z_YzTAc-DR2gipzyTabbbleP94VGxoppz31lE5D8RMzxkix2PblMWKgYhn3KXfj03PRplzsMO-pHAJGKuS3s8M1-9hiHOjmbV-xX-v7x9Wm3P34vl0td2VQ3I6lApCNrjSQcaENpqq5Ea4FCFJqUZtG1NJCsMaCrpQIDh3IALUNrnYKGrhi29m3SXjwx9w9Y_7jE3b-FUh57zGPXYjkBZqmUQ0iCafa1qC2ZDTnE1CR4Xby-jJ7HXP6faJh9Id0yv30vpeVtuY8MLFgZoWchiFT-54quD834OcG_LkB_9bApHL_qEI34tilfszYxf9ob2dtR0Tvaa6SSksJL53pkkI
CODEN	IAECCG
CitedBy_id	crossref_primary_10_1007_s10586_022_03591_6 crossref_primary_10_1007_s10825_024_02237_7 crossref_primary_10_1007_s11227_022_04570_9 crossref_primary_10_1109_ACCESS_2024_3421349 crossref_primary_10_3390_math11061538 crossref_primary_10_1007_s11277_023_10654_3 crossref_primary_10_2478_msr_2025_0016 crossref_primary_10_4218_etrij_2022_0297
Cites_doi	10.1016/j.future.2017.09.073 10.1109/PCCC.2013.6742796 10.1145/1995896.1995937 10.1145/1810085.1810128 10.1145/2071379.2071383 10.1109/MC.2005.260 10.1109/PACT.2011.14 10.1109/ACCESS.2018.2878271 10.1007/s11704-019-8184-3 10.1109/IPDPS.2013.18 10.1002/jnm.1960 10.1007/s11432-015-0594-2 10.1145/1810085.1810127 10.1145/2788396 10.1137/11082748X 10.1016/0165-1684(90)90158-U 10.1109/IV.2006.53 10.1155/2010/540159 10.1109/TPDS.2018.2827055 10.1109/IAEAC.2018.8577843 10.1111/j.1467-8659.2009.01556.x 10.1109/83.506761 10.1007/978-981-13-9965-7 10.1137/120885887 10.1109/SC.2006.13 10.1364/OE.23.025440 10.1364/AO.56.00F138 10.1109/TVCG.2013.71 10.1109/HPCA.2013.6522332 10.1090/S0025-5718-1965-0178586-1 10.1016/j.micpro.2018.04.003 10.1145/325096.325150 10.1109/ICASSP.1998.681704 10.1109/FPL.2009.5272532 10.1109/PARCOMPTECH.2015.7084519 10.1007/978-981-15-7486-3_53 10.1145/1186562.1015800
ContentType	Journal Article
Copyright	Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2021
Copyright_xml	– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2021
DBID	97E ESBDL RIA RIE AAYXX CITATION 7SC 7SP 7SR 8BQ 8FD JG9 JQ2 L7M L~C L~D DOA
DOI	10.1109/ACCESS.2021.3108404
DatabaseName	IEEE All-Society Periodicals Package (ASPP) 2005-present IEEE Open Access Journals IEEE All-Society Periodicals Package (ASPP) 1998-Present IEEE Electronic Library (IEL) CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Engineered Materials Abstracts METADEX Technology Research Database Materials Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional DOAJ Directory of Open Access Journals
DatabaseTitle	CrossRef Materials Research Database Engineered Materials Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace METADEX Computer and Information Systems Abstracts Professional
DatabaseTitleList	Materials Research Database
Database_xml	– sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering
EISSN	2169-3536
EndPage	1
ExternalDocumentID	oai_doaj_org_article_1a7dd4daae194ff7a68e7600aae5e708 10_1109_ACCESS_2021_3108404 9524622
Genre	orig-research
GrantInformation_xml	– fundername: National Research Foundation of Korea grantid: 2021R1I1A304826311 funderid: 10.13039/501100003725 – fundername: Institute of Information and communications Technology Planning and Evaluation IITP MSIT grantid: 2020-0-00594
GroupedDBID	0R~ 5VS 6IK 97E AAJGR ABAZT ABVLG ACGFS ADBBV ALMA_UNASSIGNED_HOLDINGS BCNDV BEFXN BFFAM BGNUA BKEBE BPEOZ EBS ESBDL GROUPED_DOAJ IPLJI JAVBF KQ8 M43 M~E O9- OCL OK1 RIA RIE RNS 4.4 AAYXX AGSQL CITATION EJD 7SC 7SP 7SR 8BQ 8FD JG9 JQ2 L7M L~C L~D
ID	FETCH-LOGICAL-c408t-4332d6563e79cfc75b0719f33c2261b7d1b283c87836541c9a932c3b8c9b943d3
IEDL.DBID	DOA
ISICitedReferencesCount	14
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000692233500001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	2169-3536
IngestDate	Fri Oct 03 12:47:20 EDT 2025 Mon Jun 30 03:42:24 EDT 2025 Sat Nov 29 06:12:34 EST 2025 Tue Nov 18 21:48:02 EST 2025 Wed Aug 27 02:27:35 EDT 2025
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Language	English
License	https://creativecommons.org/licenses/by/4.0/legalcode
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c408t-4332d6563e79cfc75b0719f33c2261b7d1b283c87836541c9a932c3b8c9b943d3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0002-9075-3983 0000-0002-8311-5975
OpenAccessLink	https://doaj.org/article/1a7dd4daae194ff7a68e7600aae5e708
PQID	2568777773
PQPubID	4845423
PageCount	1
ParticipantIDs	crossref_primary_10_1109_ACCESS_2021_3108404 doaj_primary_oai_doaj_org_article_1a7dd4daae194ff7a68e7600aae5e708 ieee_primary_9524622 proquest_journals_2568777773 crossref_citationtrail_10_1109_ACCESS_2021_3108404
PublicationCentury	2000
PublicationDate	2021-01-01
PublicationDateYYYYMMDD	2021-01-01
PublicationDate_xml	– month: 01 year: 2021 text: 2021-01-01 day: 01
PublicationDecade	2020
PublicationPlace	Piscataway
PublicationPlace_xml	– name: Piscataway
PublicationTitle	IEEE access
PublicationTitleAbbrev	Access
PublicationYear	2021
Publisher	IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml	– name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References	ref13 ref12 ref15 ref14 ref17 ref16 ref18 gholami (ref34) 2015 ref50 (ref47) 2020 ref46 ref45 ref48 ogata (ref19) 2008 ref44 cheng (ref43) 2014 mathieu (ref3) 2013 ref49 ref7 (ref10) 2021 ref9 ref4 ref5 ref40 quinn (ref41) 1994 ref35 ref37 ref36 ref31 ref30 ref33 ref32 ref2 ref39 ref38 (ref11) 2020 saeed (ref22) 2009; 3 (ref8) 2020 drepper (ref42) 2007; 11 oppenheim (ref1) 1999 ref24 ref23 ref26 ref25 ref20 zhang (ref6) 2018; 79 ref21 ref28 ref27 moreland (ref29) 2003
References_xml	– volume: 79 start-page: 473 year: 2018 ident: ref6 article-title: Parallel ant colony optimization on multi-core SIMD CPUs publication-title: Future Gener Comput Syst doi: 10.1016/j.future.2017.09.073 – ident: ref20 doi: 10.1109/PCCC.2013.6742796 – ident: ref18 doi: 10.1145/1995896.1995937 – ident: ref32 doi: 10.1145/1810085.1810128 – year: 1999 ident: ref1 publication-title: Discrete-Time Signal Processing – ident: ref25 doi: 10.1145/2071379.2071383 – ident: ref49 doi: 10.1109/MC.2005.260 – ident: ref15 doi: 10.1109/PACT.2011.14 – ident: ref28 doi: 10.1109/ACCESS.2018.2878271 – volume: 3 start-page: 103 year: 2009 ident: ref22 article-title: Efficient fpga implementation of fft/ifft processor publication-title: Int J Circuits Syst Signal Process – ident: ref17 doi: 10.1007/s11704-019-8184-3 – ident: ref36 doi: 10.1109/IPDPS.2013.18 – ident: ref40 doi: 10.1002/jnm.1960 – ident: ref9 doi: 10.1007/s11432-015-0594-2 – ident: ref33 doi: 10.1145/1810085.1810127 – ident: ref12 doi: 10.1145/2788396 – ident: ref26 doi: 10.1137/11082748X – year: 2020 ident: ref8 publication-title: Intel Math Kernel Library – year: 2020 ident: ref11 publication-title: CUFFT Library – ident: ref4 doi: 10.1016/0165-1684(90)90158-U – year: 2020 ident: ref47 publication-title: OpenMP – ident: ref31 doi: 10.1109/IV.2006.53 – ident: ref13 doi: 10.1155/2010/540159 – ident: ref38 doi: 10.1109/TPDS.2018.2827055 – ident: ref35 doi: 10.1109/IAEAC.2018.8577843 – ident: ref14 doi: 10.1111/j.1467-8659.2009.01556.x – ident: ref2 doi: 10.1109/83.506761 – ident: ref39 doi: 10.1007/978-981-13-9965-7 – ident: ref27 doi: 10.1137/120885887 – volume: 11 year: 2007 ident: ref42 publication-title: What Every Programmer Should Know About Memory – ident: ref21 doi: 10.1109/SC.2006.13 – ident: ref50 doi: 10.1364/OE.23.025440 – ident: ref48 doi: 10.1364/AO.56.00F138 – start-page: 1 year: 2008 ident: ref19 article-title: An efficient, model-based CPU-GPU heterogeneous FFT library publication-title: Proc IEEE Int Symp Parallel Distrib Process – ident: ref16 doi: 10.1109/TVCG.2013.71 – year: 2015 ident: ref34 article-title: AccFFT: A library for distributed-memory FFT on CPU and GPU architectures publication-title: arXiv 1506 07933 – ident: ref46 doi: 10.1109/HPCA.2013.6522332 – ident: ref5 doi: 10.1090/S0025-5718-1965-0178586-1 – ident: ref23 doi: 10.1016/j.micpro.2018.04.003 – year: 2021 ident: ref10 publication-title: CUDA Runtime API CUDA Toolkit Documentation – year: 2014 ident: ref43 publication-title: Professional CUDA C Programming – year: 1994 ident: ref41 publication-title: Parallel Computing Theory and Practice – ident: ref45 doi: 10.1145/325096.325150 – ident: ref7 doi: 10.1109/ICASSP.1998.681704 – ident: ref44 doi: 10.1109/FPL.2009.5272532 – start-page: 112 year: 2003 ident: ref29 article-title: The FFT on a GPU publication-title: Proc SIGGRAPH/Eurographics Workshop Graphics Hardware – ident: ref37 doi: 10.1109/PARCOMPTECH.2015.7084519 – ident: ref24 doi: 10.1007/978-981-15-7486-3_53 – ident: ref30 doi: 10.1145/1186562.1015800 – year: 2013 ident: ref3 article-title: Fast training of convolutional networks through FFTs publication-title: Arxiv 1312 5851
SSID	ssj0000816957
Score	2.2809908
Snippet	Fast Fourier Transform (FFT) is a fundamental operation for 2D data in various applications. To accelerate large-scale 2D-FFT computation, we propose a...
SourceID	doaj proquest crossref ieee
SourceType	Open Website Aggregation Database Enrichment Source Index Database Publisher
StartPage	1
SubjectTerms	2D-FFT Algorithms Central processing units Computation Computer memory CPU CPUs Decomposition Discrete Fourier transforms Fast Fourier transformations Fourier transforms GPU Graphics processing units Heterogeneous Heterogeneous networks In-place Libraries Matrix decomposition Memory management Parallel Parallel algorithms Priority scheduling
SummonAdditionalLinks	– databaseName: IEEE Electronic Library (IEL) dbid: RIE link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LbxMxEB6VigMceBVEoCAfOHapvfbGNrcQiFIJVT0UqTfLr4VKIUFJyu9nxuuuQCAkbivLtnb38-Mbe-YbgDcm4NLYJ96YqcmNwlo4pbhu1FRmH6JWvUwl2YQ-PzdXV_biAE7GWJicc3E-y2_psdzlp028oaOyU9u1atrigntH6-kQqzWep1ACCdvpKiwkuD2dzef4DWgCtgItU46WjPpt8yka_TWpyh8rcdleFg__78UewYNKI9lswP0xHOT1E7j_i7jgESyXZ81icfmOLcnjZYMDJaOVzy78ltKnrNjZuikOWWy2-rLZXu-_fmNIYNkncg1vdghdZu0H6uEpfF58vJwvm5o3oYmKmz0FQbUJeZrM2sY-6i4gj7C9lBG5lgg6iYCkIhoK4OiUiNYjiYsymGiDVTLJZ3C43qzzc2AJ7RsfkER6lRX3yqgk2mC4DyL6zusJtLc_1MUqKk65LVauGBfcugEFRyi4isIETsZG3wdNjX9Xf09IjVVJELsUIASuzi8nvE5JJe-zsKrvtcehR3eOWNBlzc0Ejgi2sZOK2ASOb3F3dfLuHLJAUknUWr74e6uXcI9ecDiJOYbD_fYmv4K78cf-erd9XcblTzOm3WY priority: 102 providerName: IEEE
Title	HI-FFT: Heterogeneous Parallel In-place Algorithm for Large-scale 2D-FFT
URI	https://ieeexplore.ieee.org/document/9524622 https://www.proquest.com/docview/2568777773 https://doaj.org/article/1a7dd4daae194ff7a68e7600aae5e708
Volume	9
WOSCitedRecordID	wos000692233500001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 2169-3536 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000816957 issn: 2169-3536 databaseCode: DOA dateStart: 20130101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2169-3536 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000816957 issn: 2169-3536 databaseCode: M~E dateStart: 20130101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3PS8MwFA4iHvQg6hSnc-Tg0WLSpEvibU7HBjoGKngL-VUV5ibb9Ojf7kvbjYmgFy89hDRtXl7S70vzvofQqbSwNOaeJLIlQ8KhFkwpIhLeYsFYJ3jOfJFsQgwG8vFRDVdSfcUzYaU8cGm4c2qE99wbE4Bu57kw0Gb8mQQFWRBlmC8RaoVMFWuwpC2ViUpmiBJ13u50oEdACFMKPJUAr-HfPkWFYn-VYuXHulx8bLo7aLtCibhdvt0uWgvjPbS1oh1YQ71eP-l27y9wLx5omYAfBCDxeGimMTvKCPfHyTBukeP26GkyfZk_v2LAp_gmnvxO7mBkAk6vYgv76KF7fd_pJVVahMRxIucxxin1AMNYEMrlTmQWYILKGXMApagVnlrADE7G-IyMU6cMYDTHrHTKKs48O0Dr48k4HCLsgb4YCxjR8MCJ4ZJ7mlpJjKXOZEbUUbqwkHaVZnhMXTHSBXcgSpdm1dGsujJrHZ0tb3orJTN-r34ZTb-sGvWuiwLwAl15gf7LC-qoFgdu2YjKUt5K0zpqLAZSV3NzpgHkRRFEIdjRfzz6GG3G7pTbMg20Pp--hxO04T7mL7Nps3BLuN5-XjeL4MIvg__jgg
linkProvider	Directory of Open Access Journals
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LbxMxEB5VBQl6KI-CSCngA8cutXe9sc0tpEQbEaIegtSb5deWSiGpkpTfz9jrrkBUSNxWlm3t7ufHN_bMNwDvpcWlsfW0kEMZCo61cEpRUfBhFYx1greVT8kmxHwuLy_VxR6c9rEwIYTkfBY-xMd0l-_X7jYelZ2puuTDEhfcBzXnJe2itfoTlZhCQtUiSwsxqs5G4zF-BRqBJUPblKItw__YfpJKf06r8tdanDaYyZP_e7WncJiJJBl1yD-DvbB6Dge_yQseQdNMi8lk8ZE00edljUMloJ1PLswmJlBZkumqSC5ZZLS8Wm-ud99_EKSwZBadw4stghdIeR57eAHfJp8X46bImRMKx6ncxTCo0iNTq4JQrnWitsgkVFtVDtkWs8Izi7TCyRjCUXPmlEEa5yornbKKV756Cfur9Sq8AuLRwjEWaaThgVPDJfestJIay5ypjRhAefdDtcuy4jG7xVIn84Iq3aGgIwo6ozCA077RTaeq8e_qnyJSfdUoiZ0KEAKdZ5hmRnjPvTGBKd62wuDgi7eOWFAHQeUAjiJsfScZsQGc3OGu8_TdauSBUSdRiOr4_lbv4FGz-DrTs-n8y2t4HF-2O5c5gf3d5ja8gYfu5-56u3mbxugv4TngrQ
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=HI-FFT%3A+Heterogeneous+Parallel+In-Place+Algorithm+for+Large-Scale+2D-FFT&rft.jtitle=IEEE+access&rft.au=Kang%2C+Homin&rft.au=Lee%2C+Jaehong&rft.au=Kim%2C+Duksu&rft.date=2021-01-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.eissn=2169-3536&rft.volume=9&rft.spage=120261&rft_id=info:doi/10.1109%2FACCESS.2021.3108404&rft.externalDBID=NO_FULL_TEXT
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2169-3536&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2169-3536&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2169-3536&client=summon