Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. Other Colleges / 其他學院
  3. Graduate School of Advanced Technology / 重點科技研究學院
  4. A Memory-Based Continuous-Flow FFT Processor with a Conflict-Free In-Place Addressing Scheme Supporting Composite Power Points
 
  • Details

A Memory-Based Continuous-Flow FFT Processor with a Conflict-Free In-Place Addressing Scheme Supporting Composite Power Points

Journal
2025 IEEE International Symposium on Circuits and Systems (ISCAS)
Series/Report No.
Proceedings IEEE International Symposium on Circuits and Systems
Part Of
Proceedings - IEEE International Symposium on Circuits and Systems
Start Page
1
End Page
5
ISSN
02714310
ISBN (of the container)
979-835035683-0
Date Issued
2025-05-25
Author(s)
Chang, Chih-Chia
Yu, Hung-Shu
PEI YUN TSAI  
DOI
10.1109/iscas56072.2025.11043843
URI
https://www.scopus.com/pages/publications/105010621535
https://scholars.lib.ntu.edu.tw/handle/123456789/730959
Abstract
A configurable fast Fourier transform (FFT) processor capable of computing composite power points becomes prevailing in recent communication and signal processing systems. In this paper, a continuous-flow memory-based FFT processor is designed to support 63 modes from 32 to 4096 points. A conflict-free and in-place addressing scheme is proposed to minimize the number of memory banks and total memory sizes for input buffering, intermediate storage, and output re-ordering. The processing element handles radix-3, radix-4, radix-5, radix-(4•2), radix- 32, radix-42 butterflies using a multi-path delay commutator (MDC) architecture with up to five parallel paths. Besides, the 3-tuple multi-radix representation is adopted for the virtual address generation and thus we can extend the concept of conventional conflict-free and in-place addressing for physical address and bank assignments beyond power-of-2 cases. From the comparison results, our proposed FFT processor architecture demonstrates strong computational efficiency by considering both the arithmetic complexity of butterfly operations and twiddle-factor multipliers as well as throughput.
Event(s)
2025 IEEE International Symposium on Circuits and Systems, ISCAS 2025
Subjects
Conflict-free addressing
in place
memory-based FFT
mixed-radix
Publisher
IEEE
Description
Conference date:25 May 2025 - 28 May 2025
Type
conference paper

臺大位居世界頂尖大學之列,為永久珍藏及向國際展現本校豐碩的研究成果及學術能量,圖書館整合機構典藏(NTUR)與學術庫(AH)不同功能平台,成為臺大學術典藏NTU scholars。期能整合研究能量、促進交流合作、保存學術產出、推廣研究成果。

To permanently archive and promote researcher profiles and scholarly works, Library integrates the services of “NTU Repository” with “Academic Hub” to form NTU Scholars.

總館學科館員 (Main Library)
醫學圖書館學科館員 (Medical Library)
社會科學院辜振甫紀念圖書館學科館員 (Social Sciences Library)

開放取用是從使用者角度提升資訊取用性的社會運動,應用在學術研究上是透過將研究著作公開供使用者自由取閱,以促進學術傳播及因應期刊訂購費用逐年攀升。同時可加速研究發展、提升研究影響力,NTU Scholars即為本校的開放取用典藏(OA Archive)平台。(點選深入了解OA)

  • 請確認所上傳的全文是原創的內容,若該文件包含部分內容的版權非匯入者所有,或由第三方贊助與合作完成,請確認該版權所有者及第三方同意提供此授權。
    Please represent that the submission is your original work, and that you have the right to grant the rights to upload.
  • 若欲上傳已出版的全文電子檔,可使用Open policy finder網站查詢,以確認出版單位之版權政策。
    Please use Open policy finder to find a summary of permissions that are normally given as part of each publisher's copyright transfer agreement.
  • 網站簡介 (Quickstart Guide)
  • 使用手冊 (Instruction Manual)
  • 線上預約服務 (Booking Service)
  • 方案一:臺灣大學計算機中心帳號登入
    (With C&INC Email Account)
  • 方案二:ORCID帳號登入 (With ORCID)
  • 方案一:定期更新ORCID者,以ID匯入 (Search for identifier (ORCID))
  • 方案二:自行建檔 (Default mode Submission)
  • 方案三:學科館員協助匯入 (Email worklist to subject librarians)

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science