Browse > Article
http://dx.doi.org/10.7471/ikeee.2021.25.4.697

2048-point Low-Complexity Pipelined FFT Processor based on Dynamic Scaling  

Kim, Ji-Hoon (Dept. of Electrical and Information Eng., SeooulTech)
Publication Information
Journal of IKEEE / v.25, no.4, 2021 , pp. 697-702 More about this Journal
Abstract
Fast Fourier Transform (FFT) is a major signal processing block being widely used. For long-point FFT processing, usually more than 1024 points, its low-complexity implementation becomes very important while retaining high SQNR (Signal-to-Quantization Noise Ratio). In this paper, we present a low-complexity FFT algorithm with a simple dynamic scaling scheme. For the 2048-point pipelined FFT processing, we can reduce the number of general multipliers by half compared to the well-known radix-2 algorithm. Also, the table size for twiddle factors is reduced to 35% and 53% compared to the radix-2 and radix-22 algorithms respectively, while achieving SQNR of more than 55dB without increasing the internal wordlength progressively.
Keywords
Fast Fourier Transform (FFT); Pipelined Processor; SQNR; Twiddle Factor; Low-Complexity;
Citations & Related Records
연도 인용수 순위
  • Reference
1 S. He and M. Torkelson, "Designing pipeline FFT processor for OFDM (de)modulation," in Proc. IEEE URSI Int. Symp. Signals, Syst. Electron., pp. 257-262, 1998. DOI: 10.1109/ISSSE.1998.738077   DOI
2 L. Pang, et al., "Design and Implementation of High Performance FFT Processor with Radix-2k Algorithm," in Proc. IEEE International Conference on Signal, Information and Data Processing, 2019. DOI: 10.1109/ICSIDP47821.2019.9173055   DOI
3 I. C. Park, W. H. Son, and J. H. Kim., "Twiddle Factor Transformation for Pipelined FFT Processing," in Proc. IEEE International Conference on Computer Design, 2007. DOI: 10.1109/ICCD.2007.4601872   DOI
4 S. He and M. Torkelson, "Design and Implementation of a 1024-point pipeline FFT processor," in Proc. IEEE Custom Integrated Circuits. Conf., pp.131-134, 1998. DOI: 10.1109/CICC.1998.694922   DOI
5 David Elam and Cesar Iovescu, "A Block Floating Point Implementation for an N-Point FFT on the TMS320C55x DSP," Application Report, SPRA948, Texas Instruments, 2003.
6 T. Nguyen and H. Lee, "Shared CSD complex constant multiplierfor parallel FFT processors," in Proc. International SoC Design Conference, 2015. DOI: 10.1109/ISOCC.2015.7401648   DOI
7 J. W. Cooley and J. W. Tukey, "An algorithm for the machine computation of the complex Fourier series," Math. Computation. vol.19, pp.297-301, 1965. DOI: 10.1090/S0025-5718-1965-0178586-1   DOI
8 Y. W. Lin, H. Y. Liu and C. Y. Lee, "A 1-GS/s FFT/IFFT Processor for UWB Applications," IEEE J. Solid-State Circuits, vol.40, no.8, pp.1726-1735, 2005. DOI: 10.1109/JSSC.2005.852007   DOI