Submit your paper : editorIJETjournal@gmail.com Paper Title : An Optimized CORDIC Algorithm for OFDM WPAN Application ISSN : 2395-1303 Year of Publication : 2020 10.29126/23951303/IJET-V6I5P4 MLA Style: -Dr. Yogini Borole, Dr. C.G. Dethe " An Optimized CORDIC Algorithm for OFDM WPAN Application" Volume 6 - Issue 5(20-30) September - October,2020 International Journal of Engineering and Techniques (IJET) ,ISSN:2395-1303 , www.ijetjournal.org APA Style: -Dr. Yogini Borole, Dr. C.G. Dethe " An Optimized CORDIC Algorithm for OFDM WPAN Application" Volume 6 - Issue 5(20-30) September - October,2020 International Journal of Engineering and Techniques (IJET) ,ISSN:2395-1303 , www.ijetjournal.org Abstract - This paper presents a technique for speed up and low-complexity using improved 2^5 512-point Fast Fourier Transform (FFT) processor utilizing an eight data path pipelined approach for high rate remote individual territory organize applications. An epic changed 2^5 FFT calculation that decreases the equipment complex nature is proposed. This strategy can diminish the quantity of complex augmentations and the size of the twiddle factor memory. It additionally utilizes a perplexing consistent multiplier rather than a complex Booth multiplier. The proposed FFT processor accomplishes a signal to-quantization commotion proportion of 32 dB at 12-bit inward word length. The proposed processor has been planned and executed utilizing 45-nm CMOS innovation with an inventory voltage of 1.2 V. The outcomes show that the absolute gate count of the proposed FFT processor is 340K. Moreover, the most noteworthy throughput rate is up to 2.8 GS/s at 420.203 MHz while requiring considerably less equipment complex nature. Reference [1] Taesang Cho and Hannho lee, "A High-Speed LowComplexity Modified Radix-2^5 FFT Processor for High Rate WPAN Application" IEEE Trans. VLSI SYSTEMS, vol.21, no. 1, JANUARY 2013. [2] J. Lee and H. Lee, "A rapid two-equal FFT/IFFT processor for MB-OFDMUWB Systems," IEICE Trans. Fundam., vol. E91-A, no. 4, pp. 1206–1211, Apr. 2008. [3] Y. Lin, H. Liu, and C. Lee, "A 1-GS/s FFT/IFFT processor for UWB applications," IEEE J. Strong State Circuits, vol. 40, no. 8, pp.1726–1735, Aug. 2005. [4] Y. Chen, Y. Tsao, Y. Wei, C. Lin, and C. Lee, "An ordered scaling pipelined FFT processorfor OFDM- based WPAN applications," IEEE Trans. Circuits Syst.II, Exp. Briefs, vol. 55, no. 2, pp. 146–150, Feb. 2008. [5] M. Shin and H. Lee, "A fast four-equal FFT processor for UWB applications," in Proc. IEEE Int. Symp. Circuits Syst. (ISCAS), 2008, pp. 960–963. [6] S.Tang, J. Tsai, and T. Chang, "A 2.4-GS/s FFT processorfor OFDM based WPAN applications," IEEE Trans. Circuits Syst. II, Exp. Briefs, vol. 57, no. 6, pp. 451–455, Jun. 2010. [7] Huang and S. Chen, "A green FFT processor with 2.5- GS/s for IEEE 802.15.3c (WPANs)," in Proc. Int. Conf. Green Circuits Syst. (ICGCS), 2010, pp. 9–13. [8] T. Cho, H. Lee, J. Park, and C. Park, "A fast low-intricacychanged radix-25 FFT processor for gigabit WPAN applications," in Proc. IEEE Int. Symp. Circuits Syst.(ISCAS), 2011, pp. 1259–1262. [9] A. Cortes, I. Velez, and J. F. Sevillano, "Radix FFTs:Matrical portrayal and SDC/SDF pipeline usage," IEEE Trans. Signal Process., vol. 57, no. 7, pp. 2824–2839, Jul. 2009. [10] K.Cho, K. Lee, J. Chung, and K. Parhi, "Structure of low-mistake fixed width changed Booth multiplier," IEEE Trans.Very Large Scale Integer. (VLSI) Syst., vol. 12, no. 5, pp. 522–531, May 2004. [11] R. I. Hartley, "Sub articulation partaking in channels utilizing canonic marked digit multipliers," IEEE Trans. Circuits Syst. II, Exp. Briefs, vol. 43, no. 10, pp. 677–688, Oct. 1996. [12] Wey, C., Lin, S., and Tang, W. (2007). Productive memory-based FFT processors for OFDM applications. In IEEE International Conf. on Electro-Information Technology, 345–350.May [13] Fanucci, L., Forliti, M., and Gronchi, F. (1999). Single-chip blended radix FFT processor for continuous on-board SAR handling. In sixth IEEE International Conference on Electronics, Circuits and Systems, 2, 1135–1138. [14] Mittal, S., Khan, M., and Srinivas, M. B. (2007). On the appropriateness of Bruun's FFT calculation for programming characterized radio. In 2007 IEEE Sarnoff Symposium, (pp. 1–5), Apr. [15] Volder, J. (1959). The CORDIC trigonometric processing procedure. IEEE Transactions on Electronic Computers, 8(8), 330–334. [16] Despain, A. M. (1974). Fourier change PCs utilizingCORDIC emphasess. IEEE Transactions on Electronic Computers, 23(10), 993–1001. [17] Abdullah, S. S., Nam, H., Mc Dermot, M., and Abraham, J. A. (2009). A high throughput FFT processor without any multipliers. In IEEE International Conf. on Computer Design, pp. 485–490. [18] Lin, C., and Wu, A. (2005). Blended scaling-turn CORDIC (MSRCORDIC) calculation and engineering for elite vector rotational DSP applications. Frameworks I, 52(11), 2385–2396. [19] Jiang, R. M. (2007). A zone productive FFT design for OFDM advanced video broadcasting. IEEE Transactions on Consumer Electronics, 53(4), 1322–1326. [20] Garrido, M., and Grajal, J. (2007). Effective memory-less CORDIC for FFT Computation. In IEEE International Conference on Acoustics, Speech and Signal Processing, 2, 113-116), Apr. [21] Xiao, X., Oruklu, E., and Saniie, J. (2009). Quick memory tending to conspire for radix-4 FFT usage. In IEEE International Conference on Electro/Information Technology, EIT 2009, 437–440, June. [22] Xiao, X., Oruklu, E., and Saniie, J. (2010) Reduced Memory Architecture for CORDIC-based FFT. In IEEE International Symposium on Circuits and Systems, 2690–2693. [23] MaY.(1999). A viable memory tending to conspire for FFT processors. IEEE Transactions on Signal Processing, 47(3), 907–911. Keywords CORDIC, Modified radix2^5 FFT, OFDM, WPAN |