The week's pick
Reseach Article
Simulation and Synthesis of 2048 point FFT/IFFT for Mobile Wimax 802.16e
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 65 - Number 25 |
| Year of Publication: 2013 |
| Authors: Unnati C Mehta, Satyendra Sharma |
10.5120/11269-6245
|
Unnati C Mehta, Satyendra Sharma . Simulation and Synthesis of 2048 point FFT/IFFT for Mobile Wimax 802.16e. International Journal of Computer Applications. 65, 25 ( March 2013), 1-4. DOI=10.5120/11269-6245
Abstract
This paper represents 2048 point Fast Fourier Transform and its inverse (FFT/IFFT) for Mobile Wi-MAX. Modified architecture also provides concept of local ROM module and variable length support from 128~2048 point for FFT/IFFT. UMC 0. 18µm is used to design the same. FFT/IFFT chip consumes 266. 81mW at 40MHz, 130. 74mW at 20MHz and 65mW at 10 MHz for length of 2048 point. Its core size is 2. 6mm x 2. 6mm. Its latency is 2050 clock cycle with maximum clock frequency 40MHz. Start up time for the chip is N/2 clock cycle where N is the length of FFT/IFFT. 16 bit word length with fixed point precision is used for entire implementation. As Wi-MAX is used for Metropolitan Area Network, it uses Orthogonal Frequency Division Multiple Access scheme.
References
- WiMAX Forum, Mobile WiMAX-Part I: A technical overview and performance evaluations, Feb. 21, 2006
- Bo Fu, Paul Ampadu, "An Area Efficient FFT/IFFT Processor for MIMO-OFDM WLAN 802. 11n" J Sign Process Syst (2009) 56:59–68
- J. W. Cooley and J. W. Tukey, "An algorithm for the machine calculation of complex Fourier series," Math. Comput. , vol. 19,Apr. 1965, Page(s):297 – 301.
- M. Vetterli and P. Duhamel, "Split-radix algorithms for length- pn DFT's," IEEE Trans. Acoust. , Speech, Signal Processing, vol. 37,pp. 57–64, Jan. 1989
- Soo-Chang Pei, Tzyy-Liang Luo, "Split-radix generalized fast Fourier transform," Signal Processing, 54(1996) 137-151.
- Daisuke Takahashi, May 2001 "An Extended Split-Radix FFT Algorithm," IEEE Signal Processing Letters," vol. 8, no. 5, pp. 145-147
- Erling H. Wold "Pipelined and Parallel-pipelined FFT FFT processor for VLSI Implementation" 0018-9340/84/0500- 0414$01 . 00 © 1984 IEEE
- Hyun-Yong Lee, In-Cheol Park "Balanced Binary-Tree Decomposition for Area-Efficient Pipelined FFT Processing" 8328/$25. 00 © 2007 IEEE
- Jen-Chih Kuo, Ching-Hua Wen, Chih-Hsiu Lin, An-Yeu Wu,"VLSI Design of Variable –Length FFT/IFFT Processor for OFDM-Based Communication Systems" EURASIP Journal on Applied Signal Processing 2003:13, 1306-1316
- Chin-Long Wey, Wei-Chien ang and Shin-Yo Lin "Efficient VLSI Implementation of Memory-Based FFT processors for DVB-T Applications" IEEE Computer Society Annual Symposium on VLSI(ISVLSI'07)
- B. Sklar, "Digital Communications, Fundamentals and Applications, Second Edition, New Delhi, Pearson Education, 2004.
- Simeng li, Huxiong Xu, Wenhua Fan, Yun Chen, Xiaoyang Zeng 2010"A 128/256-Point Pipeline FFT/IFFT Processor for MIMO OFDM System IEEE 802. 16e" 978-1-4244-5309-2/10/$26. 00 ©2010 IEEE
- J. A. Heller and I. M. Jacobs, "Viterbi Decoding for Satellite and Space Communications", IEEE Trans. Commun. Technol. , vol. COM19, no. 5, 1971
- K. Harikrishna 1, T. Rama Rao 2, Vladimir A. Labay 2011"FPGA Implementation of FFT Algorithm for IEEE 802. 16e (Mobile WiMAX)" International Journal of Computer Theory and Engineering, Vol. 3, No. 2, April 2011
Index Terms
Keywords