Please wait a minute...
Front. Inform. Technol. Electron. Eng.  2011, Vol. 12 Issue (12): 1021-1030    DOI: 10.1631/jzus.C1100071
    
A novel 3780-point FFT processor scheme for the time domain synchronous OFDM system
Ji-nan Leng1, Lei Xie*,1,2, Hui-fang Chen1,2, Kuang Wang1,2
1 Department of Information Science and Electronic Engineering, Zhejiang University, Hangzhou 310027, China 2 Zhejiang Provincial Key Laboratory of Information Network Technology, Hangzhou 310027, China
Download:   PDF(639KB)
Export: BibTeX | EndNote (RIS)      

Abstract  The 3780-point FFT is a main component of the time domain synchronous OFDM (TDS-OFDM) system and the key technology in the Chinese Digital Multimedia/TV Broadcasting-Terrestrial (DMB-T) national standard. Since 3780 is not a power of 2, the classical radix-2 or radix-4 FFT algorithm cannot be applied directly. Hence, the Winograd Fourier transform algorithm (WFTA) and the Good-Thomas prime factor algorithm (PFA) are used to implement the 3780-point FFT processor. However, the structure based on WFTA and PFA has a large computational complexity and requires many DSPs in hardware implementation. In this paper, a novel 3780-point FFT processor scheme is proposed, in which a 60(63 iterative WFTA architecture with different mapping methods is imported to replace the PFA architecture, and an optimized CoOrdinate Rotation DIgital Computer (CORDIC) module is used for the twiddle factor multiplications. Compared to the traditional scheme, our proposed 3780-point FFT processor scheme reduces the number of multiplications by 45% at the cost of 1% increase in the number of additions. All DSPs are replaced by the optimized CORDIC module and ROM. Simulation results show that the proposed 3780-point FFT processing scheme satisfies the requirement of the DMB-T standard, and is an efficient architecture for the TDS-OFDM system.

Key words3780      CoOrdinate Rotation DIgital Computer (CORDIC)      Digital Multimedia/TV Broadcasting-Terrestrial (DMB-T)      FFT      Time domain synchronous OFDM (TDS-OFDM)      Winograd Fourier transform algorithm (WFTA)     
Received: 26 March 2011      Published: 30 November 2011
CLC:  TN915.05  
Cite this article:

Ji-nan Leng, Lei Xie, Hui-fang Chen, Kuang Wang. A novel 3780-point FFT processor scheme for the time domain synchronous OFDM system. Front. Inform. Technol. Electron. Eng., 2011, 12(12): 1021-1030.

URL:

http://www.zjujournals.com/xueshu/fitee/10.1631/jzus.C1100071     OR     http://www.zjujournals.com/xueshu/fitee/Y2011/V12/I12/1021


A novel 3780-point FFT processor scheme for the time domain synchronous OFDM system

The 3780-point FFT is a main component of the time domain synchronous OFDM (TDS-OFDM) system and the key technology in the Chinese Digital Multimedia/TV Broadcasting-Terrestrial (DMB-T) national standard. Since 3780 is not a power of 2, the classical radix-2 or radix-4 FFT algorithm cannot be applied directly. Hence, the Winograd Fourier transform algorithm (WFTA) and the Good-Thomas prime factor algorithm (PFA) are used to implement the 3780-point FFT processor. However, the structure based on WFTA and PFA has a large computational complexity and requires many DSPs in hardware implementation. In this paper, a novel 3780-point FFT processor scheme is proposed, in which a 60(63 iterative WFTA architecture with different mapping methods is imported to replace the PFA architecture, and an optimized CoOrdinate Rotation DIgital Computer (CORDIC) module is used for the twiddle factor multiplications. Compared to the traditional scheme, our proposed 3780-point FFT processor scheme reduces the number of multiplications by 45% at the cost of 1% increase in the number of additions. All DSPs are replaced by the optimized CORDIC module and ROM. Simulation results show that the proposed 3780-point FFT processing scheme satisfies the requirement of the DMB-T standard, and is an efficient architecture for the TDS-OFDM system.

关键词: 3780,  CoOrdinate Rotation DIgital Computer (CORDIC),  Digital Multimedia/TV Broadcasting-Terrestrial (DMB-T),  FFT,  Time domain synchronous OFDM (TDS-OFDM),  Winograd Fourier transform algorithm (WFTA) 
[1] Rui WANG, Yi-xuan ZHOU, Yan-liang JIN, Wen-ming CAO. Sparse fast Clifford Fourier transform[J]. Front. Inform. Technol. Electron. Eng., 2017, 18(8): 1131-1141.
[2] Sandeep SAROWA, Harmanjeet SINGH, Sunil AGRAWAL, B. S. SOHI . A novel energy-efficient ICI cancellation technique for bandwidth improvements through cyclic prefix reuse in an OFDM system[J]. Front. Inform. Technol. Electron. Eng., 2017, 18(11): 1892-1899.
[3] Michaelraj Kingston Roberts, Ramesh Jayabalan. An improved low-complexity sum-product decoding algorithm for low-density parity-check codes[J]. Front. Inform. Technol. Electron. Eng., 2015, 16(6): 511-518.
[4] Zhen-guo Ma, Feng Yu, Rui-feng Ge, Ze-ke Wang. An efficient radix-2 fast Fourier transform processor with ganged butterfly engines on field programmable gate arrays[J]. Front. Inform. Technol. Electron. Eng., 2011, 12(4): 323-329.
[5] Dan Wu, Xue-cheng Zou, Kui Dai, Jin-li Rao, Pan Chen, Zhao-xia Zheng. Implementation and evaluation of parallel FFT on Engineering and Scientific Computation Accelerator (ESCA) architecture[J]. Front. Inform. Technol. Electron. Eng., 2011, 12(12): 976-989.
[6] Xue Liu, Feng Yu, Ze-ke Wang. A pipelined architecture for normal I/O order FFT[J]. Front. Inform. Technol. Electron. Eng., 2011, 12(1): 76-82.
[7] Lei Zhang, Peng Liu, Yu-ling Liu, Fei-hong Yu. High quality multi-focus polychromatic composite image fusion algorithm based on filtering in frequency domain and synthesis in space domain[J]. Front. Inform. Technol. Electron. Eng., 2010, 11(5): 365-374.