[1]Blair G M. A review of the discrete Fourier transform. Part 2. Nonradix algorithms, real transforms and noise[J]. Electronics & Communication Engineering Journal, 1995,7(5):187194.[2]Al Ghouwayel A, Louet Y. FPGA implementation of a reconfigurable FFT for multistandard systems in software radio context [J]. IEEE Trans Consumer Electronics, 2009, 55(2): 950958.[3]Sung T Y, Hsin H C, Cheng Y P. Lowpower and highspeed CORDICbased splitradix FFT processor for OFDM systems [J]. Digital Signal Processing, 2010, 20(2): 511527[4]Leng J N, Xie L, Chen H F, et al. A novel 3 780point FFT processor scheme for the time domain synchronous OFDM system [J]. Journal of Zhejiang University: Science C, 2010, 12(12): 10211030[5]Jiang M, Yang B, Huang R, et al. Multiplierless fast fourier transform architecture [J]. Electronics Letters, 2007, 43(3): 191192[6]Jiang M. An areaefficient FFT architecture for OFDM digital video broadcasting [J]. IEEE Trans Consumer Electronics, 2007, 53(4): 13221326.[7]Kim D S, Lee S S, Song J Y, et al. Design of a mixed prime factor FFT for portable digital radio mondiale receiver [J]. IEEE Trans Consumer Electronics, 2008, 54(4): 15901594.[8]Chow P, Vranesic Z G, Yen J L. A pipelined distributed arithmetic PFFT processor [J]. IEEE Trans Computers, 1983, 32(12):11281136.[9]Xilinx. Fast Fourier transform v6.0 product specification [EB/OL]. [20120111]. http://www.xilinx.com/ support/documentation/ip_documentation/xfft_ds260.pdf. |