Systematic generation of FPGA-based FFT implementations

In this paper, we propose a systemic approach for synthesizing field-programmable gate array (FPGA) implementations of fast Fourier transform (FFT) computations. Our approach considers both cost (in terms of FPGA resource requirements), and performance (in terms of throughput), and optimizes for bot...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2008 IEEE International Conference on Acoustics, Speech and Signal Processing s. 1413 - 1416
Hlavní autoři: Hojin Kee, Petersen, N., Kornerup, J., Bhattacharyya, S.S.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.03.2008
Témata:
Cost function
Educational institutions
Fast Fourier transform
Fast Fourier transforms
Field programmable gate arrays
Hardware design languages
High-level synthesis
Instruments
Jacobian matrices
Libraries
Memory management
Signal synthesis
Throughput
ISBN:9781424414833, 1424414830
ISSN:1520-6149
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 In this paper, we propose a systemic approach for synthesizing field-programmable gate array (FPGA) implementations of fast Fourier transform (FFT) computations. Our approach considers both cost (in terms of FPGA resource requirements), and performance (in terms of throughput), and optimizes for both of these dimensions based on user-specified requirements. Our approach involves two orthogonal techniques-FFT inner loop unrolling and outer loop unrolling - to perform design space exploration in terms of cost and performance. By appropriately combining these two forms unrolling, we can achieve cost-optimized FFT implementations in terms of FPGA slices or block RAMs in FPGA, subject to the required throughput. We compared the results of our synthesis approach with a recently-introduced commercial FPGA intellectual property (IP) core - the FFT IP module in the Xilinx LogiCore Library, which provides different FFT implementations that are optimized for a limited set of performance levels. Our results demonstrate efficiency levels that are in some cases better than these commercial IP blocks. At the same time, our approach provides the advantages of being able to optimize implementations based on arbitrary, user-specified performance levels, and of being based on general formulations of FFT loop unrolling trade-offs, which can be retargeted to different kinds of FPGA devices.
AbstractList In this paper, we propose a systemic approach for synthesizing field-programmable gate array (FPGA) implementations of fast Fourier transform (FFT) computations. Our approach considers both cost (in terms of FPGA resource requirements), and performance (in terms of throughput), and optimizes for both of these dimensions based on user-specified requirements. Our approach involves two orthogonal techniques-FFT inner loop unrolling and outer loop unrolling - to perform design space exploration in terms of cost and performance. By appropriately combining these two forms unrolling, we can achieve cost-optimized FFT implementations in terms of FPGA slices or block RAMs in FPGA, subject to the required throughput. We compared the results of our synthesis approach with a recently-introduced commercial FPGA intellectual property (IP) core - the FFT IP module in the Xilinx LogiCore Library, which provides different FFT implementations that are optimized for a limited set of performance levels. Our results demonstrate efficiency levels that are in some cases better than these commercial IP blocks. At the same time, our approach provides the advantages of being able to optimize implementations based on arbitrary, user-specified performance levels, and of being based on general formulations of FFT loop unrolling trade-offs, which can be retargeted to different kinds of FPGA devices.
Author Hojin Kee
Kornerup, J.
Petersen, N.
Bhattacharyya, S.S.
Author_xml – sequence: 1
  surname: Hojin Kee
  fullname: Hojin Kee
  organization: Dept. of Electr. & Comput. Eng., Univ. of Maryland, College Park, MD
– sequence: 2
  givenname: N.
  surname: Petersen
  fullname: Petersen, N.
– sequence: 3
  givenname: J.
  surname: Kornerup
  fullname: Kornerup, J.
– sequence: 4
  givenname: S.S.
  surname: Bhattacharyya
  fullname: Bhattacharyya, S.S.
BookMark eNo1T81qwkAY3FILVZsn8JIXSLrf7vftz1Gk0YJQIfYsu8luSTGJJLn49pXWzmVmYBhmFmzW9V1gbAU8B-D29X2zLstDLjg3ORJoY_CBLQAFIqBB-8gSq82_l3LG5kCCZwrQPrNkHL_5DUiSLM2ZLq_jFFo3NVX6Fbow3FTfpX1Mi8N2nXk3hjotimPatJdzaEM3_QbGF_YU3XkMyZ2X7LN4O2522f5je1u4zxrQNGWoVI3O10QSjIhekdfS-6qCKIKyUTkyArkgL-pKCB05OVE7gEiuIrRyyVZ_vU0I4XQZmtYN19P9t_wBEIJK5A
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/ICASSP.2008.4517884
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE/IET Electronic Library (IEL) (UW System Shared)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISBN 1424414849
9781424414840
EndPage 1416
ExternalDocumentID 4517884
Genre orig-research
GroupedDBID 23M
29P
6IE
6IF
6IH
6IK
6IL
6IM
6IN
AAJGR
AAWTH
ABLEC
ACGFS
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IJVOP
IPLJI
M43
OCL
RIE
RIL
RIO
RNS
ID FETCH-LOGICAL-i175t-466d4abd553182fb65b73bbcc1f2e69f6a5824025b2dc227f05a2da11f5ac5493
IEDL.DBID RIE
ISBN 9781424414833
1424414830
ISICitedReferencesCount 7
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000257456701015&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1520-6149
IngestDate Wed Aug 27 02:03:21 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i175t-466d4abd553182fb65b73bbcc1f2e69f6a5824025b2dc227f05a2da11f5ac5493
PageCount 4
ParticipantIDs ieee_primary_4517884
PublicationCentury 2000
PublicationDate 2008-March
PublicationDateYYYYMMDD 2008-03-01
PublicationDate_xml – month: 03
  year: 2008
  text: 2008-March
PublicationDecade 2000
PublicationTitle 2008 IEEE International Conference on Acoustics, Speech and Signal Processing
PublicationTitleAbbrev ICASSP
PublicationYear 2008
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000453595
ssj0008748
Score 1.7148442
Snippet In this paper, we propose a systemic approach for synthesizing field-programmable gate array (FPGA) implementations of fast Fourier transform (FFT)...
SourceID ieee
SourceType Publisher
StartPage 1413
SubjectTerms Cost function
Educational institutions
Fast Fourier transform
Fast Fourier transforms
Field programmable gate arrays
Hardware design languages
High-level synthesis
Instruments
Jacobian matrices
Libraries
Memory management
Signal synthesis
Throughput
Title Systematic generation of FPGA-based FFT implementations
URI https://ieeexplore.ieee.org/document/4517884
WOSCitedRecordID wos000257456701015&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
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwED61FQMsPFrEWxkYMW0cO5eMVUUACVWVWlC3yk_UgRaVlt-P7aQBJBa2OIvfvjv7-74DuM44YwxzJEJiTpjQikhEQdBQzTJuhA2yiy9POBxm02k-asBNzYUxxgTwmbn1n-EtXy_Vxl-VdRmPXcTGmtBETEuuVn2f4lyTkmNancIZhsxZzjz58IjlW1KXc_-TWuupKieVHFHcy7uPg_54PCpBllV9vxKvBLtT7P-vxQfQ-SbwRaPaNB1CwyyOYO-H9mAbcFxrOEevQXvaT1G0tFExuu8Tb910VBSTaP62hZiHJdqB5-JuMnggVRYFMneuwZqwNNVMSM3dbsuolSmXmEipVGypSXObCp75JxYuqVaUou1xQbWIY8uFctFjcgytxXJhTiBypxtVShvbSy3jVIhMGiNlgsJFiRzNKbT9EMzeS6GMWdX7s79_n8NuCb7wgK4LaK1XG3MJO-pzPf9YXYXZ_QIFQ52j
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NT8IwGH6DaKJe_EDjtzt4tMK6dt2OhDghIlkCGm6kn4aDYBD8_bbdmJp48db10m39ePu0z_O8ADcJJYSwlCEuWIoIVxIJxjhiGiuSUM2Nt1186bPBIBmP07wGt5UWRmvtyWf6zhX9Xb6ay5U7KmsSGlrERjZg07aAW4VaqzpRsZuTQmVarsMJ87mzbIByAImka1mXBQBR5fZUPkelIVHYSpu9Tns4zAuaZdnir9QrPvJke_975304-pbwBXkVnA6gpmeHsPvDfbABbFi5OAev3n3adVIwN0GWP7SRi28qyLJRMH1bk8z9ID2C5-x-1OmiMo8CmtrNwRKROFaEC0XtfEuwETEVLBJCytBgHacm5jRxlyxUYCUxZqZFOVY8DA3l0uLH6Bjqs_lMn0Bg1zcspdKmFRtCMeeJ0FqIiHGLEynTp9Bwv2DyXlhlTMqvP_u7-hq2u6On_qTfGzyew05BxXD0rguoLxcrfQlb8nM5_Vhc-Z7-AnFzoOo
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%3Abook&rft.genre=proceeding&rft.title=2008+IEEE+International+Conference+on+Acoustics%2C+Speech+and+Signal+Processing&rft.atitle=Systematic+generation+of+FPGA-based+FFT+implementations&rft.au=Hojin+Kee&rft.au=Petersen%2C+N.&rft.au=Kornerup%2C+J.&rft.au=Bhattacharyya%2C+S.S.&rft.date=2008-03-01&rft.pub=IEEE&rft.isbn=9781424414833&rft.issn=1520-6149&rft.spage=1413&rft.epage=1416&rft_id=info:doi/10.1109%2FICASSP.2008.4517884&rft.externalDocID=4517884
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1520-6149&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1520-6149&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1520-6149&client=summon