搜索资源列表
2fft
- 基2FFT算法实现改进的一篇很好的文章,有利于傅立叶变换的理解-2FFT-based algorithm to improve a very good article, and is conducive to the understanding of Fourier Transform
GeneratingFPGA-AcceleratedDFTLibraries
- 关于DFT的文章,应用FPGA实现傅立叶变换。-Abstract—We present a domain-specific approach to generate high-performance hardware-software partitioned implementations of the discrete Fourier transform (DFT). The partitioning strategy is a heuristic based on the DFT
Copy-of-VHDL-implementation-of-an-optimized-8-poi
- The xFFT16 fast Fourier transform (FFT) Core computes a 16-point complex FFT. The input datais a vector of 16 complex values
cf_fft_256_8
- FFT VHDL with a fast Fourier transform papers, including the principle of analysis and code for 8 to 256 number of points