rar

Implementation of Fast Fourier Transform Based on FPGA

  • 2014-03-05
  • 5.07MB
  • Points it Requires : 2

  Fast Fourier transform (FFT) is one of the important contents in digital signal processing and is the core algorithm in many signal processing processes. This paper first summarizes some common algorithms of fast Fourier transform, and comprehensively considers various factors, adopts the radix-2 frequency extraction algorithm as the implementation algorithm, and then compares the two ways of implementing digital signal processing with field programmable gate array (FPGA) and DSP processor, pointing out their respective advantages and disadvantages. Finally, using FPGA chip XCS200 as the hardware platform and ISE6 as the software platform, a 512-point 16-bit complex fast Fourier transform system is implemented using VHDL language description, and simulation and synthesis are carried out. The simulation results show that the calculation results have achieved a certain accuracy, and the running speed can meet the requirements of general real-time signal processing.

unfold

You Might Like

Uploader
sinceyoulove
 

Recommended ContentMore

Open source project More

Popular Components

Just Take a LookMore

EEWorld
subscription
account

EEWorld
service
account

Automotive
development
circle

About Us Customer Service Contact Information Datasheet Sitemap LatestNews


Room 1530, 15th Floor, Building B, No.18 Zhongguancun Street, Haidian District, Beijing, Postal Code: 100190 China Telephone: 008610 8235 0740

Copyright © 2005-2024 EEWORLD.com.cn, Inc. All rights reserved 京ICP证060456号 京ICP备10001474号-1 电信业务审批[2006]字第258号函 京公网安备 11010802033920号
×