Design and Power Measurement of Different Points FFT using Radix-2 Algorithm for FPGA Implementation

被引:0
作者
Patrikar, Mayura [1 ]
Tehre, Vaishali [1 ]
机构
[1] GH Raisoni Coll Engn, Dept Elect & Telecommun, Nagpur, Maharashtra, India
来源
2017 INTERNATIONAL CONFERENCE OF ELECTRONICS, COMMUNICATION AND AEROSPACE TECHNOLOGY (ICECA), VOL 1 | 2017年
关键词
Fast Fourier transform (FFT); Discrete Fourier transform (DFT); DIT; Radix-2; VHDL; FPGA;
D O I
暂无
中图分类号
V [航空、航天];
学科分类号
08 ; 0825 ;
摘要
In Cooley-Tukey algorithm the Radix-2 decimation-in-time Fast Fourier Transform is the easiest form. The Fast Fourier Transform is the mostly used in digital signal processing algorithms. Discrete Fourier Transform (DFT) is computing by the FFT. DFT is used to convert a time domain signal into its frequency spectrum domain. FFT algorithm use many applications for example, OFDM, Noise reduction, Digital audio broadcasting, Digital video broadcasting. It's used to design butterflies for different point FFT. In this paper given to design and power measurement 16 and 32 point FFT by using VHDL. Simulation and synthesis of design is done using Xilinx ISE 14.2.
引用
收藏
页码:190 / 195
页数:6
相关论文
共 12 条
[1]  
Bingrui Wang, 2010 2 INT C COMP MO
[2]  
Elbably G. Abdelfadeel, 2009, INT J CIRCUITS SYSTE, V3
[3]  
Gentleman WMorven, 1966, P NOV 7 10 1966 FALL, P563, DOI DOI 10.1145/1464291.1464352
[4]  
Hussain Waqar, 2012, ENERGY POWER ESTIMAT
[5]  
Jump Cipra Barry A., 2012, FFT BUTTERFLY DIAGRA
[6]  
Kaur Harpreet, 2015, DESIGN SIMULATION 32, V2
[7]  
Limaye S. S., VHDL DESIGN ORIENTED
[8]  
Oppenheim AV, 2010, Discrete-Time Signal Processing, V3
[9]  
Ramachandran Remya, INT J COMPUTER SCI E
[10]  
Sharma Sanjay, DIGITAL SIGNAL PROCE