Browse > Article
http://dx.doi.org/10.17661/jkiiect.2020.13.1.35

Novel Radix-26 DF IFFT Processor with Low Computational Complexity  

Cho, Kyung-Ju (Department of Electronic Engineering Wonkwang University)
Publication Information
The Journal of Korea Institute of Information, Electronics, and Communication Technology / v.13, no.1, 2020 , pp. 35-41 More about this Journal
Abstract
Fast Fourier transform (FFT) processors have been widely used in various application such as communications, image, and biomedical signal processing. Especially, high-performance and low-power FFT processing is indispensable in OFDM-based communication systems. This paper presents a novel radix-26 FFT algorithm with low computational complexity and high hardware efficiency. Applying a 7-dimensional index mapping, the twiddle factor is decomposed and then radix-26 FFT algorithm is derived. The proposed algorithm has a simple twiddle factor sequence and a small number of complex multiplications, which can reduce the memory size for storing the twiddle factor. When the coefficient of twiddle factor is small, complex constant multipliers can be used efficiently instead of complex multipliers. Complex constant multipliers can be designed more efficiently using canonic signed digit (CSD) and common subexpression elimination (CSE) algorithm. An efficient complex constant multiplier design method for the twiddle factor multiplication used in the proposed radix-26 algorithm is proposed applying CSD and CSE algorithm. To evaluate performance of the previous and the proposed methods, 256-point single-path delay feedback (SDF) FFT is designed and synthesized into FPGA. The proposed algorithm uses about 10% less hardware than the previous algorithm.
Keywords
FFT; Radix-26 algorithm; Twiddle factor; SDF; Complex constant multiplier; CSD;
Citations & Related Records
Times Cited By KSCI : 2  (Citation Analysis)
연도 인용수 순위
1 J. Yu and K. J. Cho, "A low-area and low-power 512-point pipelined FFT design using raidx-24-23 for OFDM applications", JKIIECT, vol. 11. no. 5, pp. 475-480, 2018.
2 C. Yu and M. H. Yen, "Area-efficient 128- to 2048/1536-point pipeline FFT processor for LTE and mobile WiMAX systems", IEEE VLSI Syst., vol. 23, pp. 1793-1800, 2015.   DOI
3 S. He and M. Torkelson, "A new approach to pipelined FFT processor", IPPS'96, pp. 766-770, 1996.
4 J. Y. Oh and M. S. Lim, "New radix-2 to the 4th power pipeline FFT processor", IEICE trans. Electron., vol. E88-C, no. 8, pp.1740-1746, 2005.   DOI
5 T. S. Cho and H. H. Lee, "A high-speed low-complexity modified radix-2^5 FFT processor for high rate WPAN applications", IEEE Trans. Very Large Scale Integr. (VLSI) Syst, vol. 21, no. 1, pp. 187-191, Feb, 2013.   DOI
6 C. Yang, C. Wei, Y. Xie, H. Chen and C. Ma, "Area-efficient mixed-radix variable-length FFT processor", IEICE Electron. Expr. , vol. 14, no. 10, pp. 1-10, 2017.
7 S. J. Huang, S. G. Chen, "A high-throughput radix-16 FFT processor with parallel and normal input/output ordering for IEEE 802.15. 3c systems", IEEE Tran. Circuits Sys. I: Reg. Papers, vol. 59, no. 8, pp.1752-1765, 2012.   DOI
8 G. K. Ganjikunta and S. K. Sahoo, "An area-efficient and low-power 64-point pipeline Fast Fourier Transform for OFDM applications", Integration, the VLSI Journal, vol. 57, pp. 125-131, 2017.   DOI