A Series-parallel Mixed Structure FFT Processor
Authors: 
Hua Jiang, Wenkai XuAuthors Info & Claims
Hua Jiang, Wenkai XuAuthors Info & ClaimsPages 49 - 54
Abstract
The proposed fixed-point radix-2 decimation-in-time Fast Fourier Transform (R2DIT FFT) processor is implemented by the series-parallel mixed structure. The 64-point FFT is decomposed into 8-channel 8-point FFT structure. Each channel is a serial 8-point FFT which uses an 8-point full-parallel structure. The vertical 8-channel 8-point FFT is calculated, then the result is multiplied by WNn1k2. After that, the horizontal 8-channel 8-point FFT is calculated. In this way, the 64-point FFT calculation is decomposed into two full-parallel 8-point FFT calculations.
The processing of the 64-point FFT calculation takes about 1.96 μs at 100 MHz based on EP2S130F1020C3 chip. And the output from the first data to the last data spends about 0.76 μs. Then, the 64-point FFT is simplified to the 16-point FFT with the same series-parallel mixed structure and downloaded to the EP2C35F-672C6 chip of the DE2 FPGA development board. Then the signal is extracted with the SignalTap II tool. Experimental values are compared with theoretical values calculated by Matlab. After converting them to decimal fractions, the absolute error is less than 0.2. In addition, it takes about 9.8 μs from the data input to the first data output at 100 MHz. And the total output from the first data output to the last data output is about 3 μs. Compared with the full-parallel FFT, the series-parallel mixed structure scheme achieves an effective solution for the contradiction between speeds and resource utilizations based on FPGA.
References
[1]
Dai, Y. 2016. Design FFT processor based on FPGA. Int. J. Control Autom. 9, 11, 137--142.
[2]
Mookherjee, S., DeBrunner, L., and DeBrunner, V. 2015. A low power radix-2 FFT accelerator for FPGA. In 49th Asilomar Conference on Signals, Systems and Computers (Pacific Grove, CA, United states, November 08-11, 2015). IEEE, 447--451.
[3]
Ma, Y. and Liang, H. 2017. Implementation of a pipeline large-FFT processor based on the FPGA. In 6th International Conference on Communications, Signal Processing, and Systems, CSPS 2017 (Harbin, China, July 14-16, 2017). Springer, 638--644.
[4]
Wang, X. and Liu, Y. 2006. Full Parallel FFT Based on FPGA. Nanjing Hangkong Hangtian Daxue Xuebao. 38, 1 (Feb. 2006), 96--100.
[5]
Wang, X. and Liu, Y. 2008. Super-wide band digital I/Q transform algorithm based on FFT and its implementation. Yi Qi Yi Biao Xue Bao. 29, 8 (Aug. 2008), 1714--1718.
[6]
Wang, X. and Pan, M. 2011. Implementation of Digital Signal Processing Based on FPGA. Tsinghua University Press, China.
[7]
Jaber, M. A., Massicotte, D., and Achouri, Y. 2011. A higher radix FFT FPGA implementation suitable for OFDM systems. In 18th IEEE International Conference on Electronics, Circuits, and Systems, ICECS 2011 (Beirut, Lebanon, December 11-14, 2011). IEEE, 744--747.
Index Terms
- A Series-parallel Mixed Structure FFT Processor
Recommendations
Design and Simulation of 32-Point FFT Using Radix-2 Algorithm for FPGA Implementation
ACCT '12: Proceedings of the 2012 Second International Conference on Advanced Computing & Communication TechnologiesThe Fast Fourier Transform (FFT) is one of the rudimentary operations in field of digital signal and image processing. Some of the very vital applications of the fast fourier transform include Signal analysis, Sound filtering, Data compression, Partial ...
Simulation and Analysis of DIT FFT Algorithm for Spartan 3 FPGA
CSNT '13: Proceedings of the 2013 International Conference on Communication Systems and Network TechnologiesThe Fast Fourier Transform (FFT) and its Inverse (IFFT) is one of the most widely used algorithms in digital signal processing. Using this transform, signals can be moved to the frequency domain where filtering and correlation can be performed with ...
Configurable FFT Processor Using Dynamically Reconfigurable Resource Arrays
This paper presents results of using a Coarse Grain Reconfigurable Architecture called DRRA (Dynamically Reconfigurable Resource Array) for FFT implementations varying in order and degree of parallelism using radix-2 decimation in time (DIT). The DRRA ...
Comments
Information & Contributors
Information
Published In
February 2019
170 pages
ISBN:9781450362047
DOI:10.1145/3316551
Copyright © 2019 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 24 February 2019
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Funding Sources
- Brand Professional Construction Project of Colleges and Universities in Jiangsu Province
- Doctoral Research Initiation Fund Project of Nantong University
Conference
ICDSP 2019
ICDSP 2019: 2019 3rd International Conference on Digital Signal Processing
February 24 - 26, 2019
Jeju Island, Republic of Korea
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 70Total Downloads
- Downloads (Last 12 months)5
- Downloads (Last 6 weeks)0
Reflects downloads up to 05 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in