FPGA를 사용한 radix-2 16 points FFT 알고리즘 가속기 구현

Vol. 34, No. 1, pp. 11-19, 2월. 2024
https://doi.org/10.13089/JKIISC.2024.34.1.11, Full Text:
Keywords: FPGA, FFT, Accelerator
Abstract

The increased utilization of the FFT in signal processing, cryptography, and various other fields has highlighted the importance of optimization. In this paper, we propose the implementation of an accelerator that processes the radix-2 16 points FFT algorithm more rapidly and efficiently than FFT implementation of existing studies, using FPGA (Field Programmable Gate Array) hardware. Leveraging the hardware advantages of FPGA, such as parallel processing and pipelining, we design and implement the FFT logic in the PL (Programmable Logic) part using the Verilog language. We implement the FFT using only the Zynq processor in the PS (Processing System) part, and compare the computation times of the implementation in the PL and PS part. Additionally, we demonstrate the efficiency of our implementation in terms of computation time and resource usage, in comparison with related works.

Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from December 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
이규섭, 조성민, 서승현, "Radix-2 16 Points FFT Algorithm Accelerator Implementation Using FPGA," Journal of The Korea Institute of Information Security and Cryptology, vol. 34, no. 1, pp. 11-19, 2024. DOI: https://doi.org/10.13089/JKIISC.2024.34.1.11.

[ACM Style]
이규섭, 조성민, and 서승현. 2024. Radix-2 16 Points FFT Algorithm Accelerator Implementation Using FPGA. Journal of The Korea Institute of Information Security and Cryptology, 34, 1, (2024), 11-19. DOI: https://doi.org/10.13089/JKIISC.2024.34.1.11.