Search - fast fourier transform vhdl

Search - fast fourier transform vhdl - List

[Other resource] 一篇用VHDL实现快速傅立叶变换的论文 DL : 0: 一篇用VHDL实现快速傅立叶变换的论文，包括原理分析和代码实现，印度圣雄甘地大学M.A.学院提供-VHDL with a Fast Fourier Transform papers, including the principle of analysis and implementation of the code, the Mahatma Gandhi Institute of the University of Marat
Update : 2008-10-13 Size : 61.65kb Publisher : 咱航
[VHDL-FPGA-Verilog] 一篇用VHDL实现快速傅立叶变换的论文 DL : 0: 一篇用VHDL实现快速傅立叶变换的论文，包括原理分析和代码实现，印度圣雄甘地大学M.A.学院提供-VHDL with a Fast Fourier Transform papers, including the principle of analysis and implementation of the code, the Mahatma Gandhi Institute of the University of Marat
Update : 2025-02-17 Size : 61kb Publisher :
[VHDL-FPGA-Verilog] FFT的VHDL源代码 DL : 0: FFT的VHDL源代码-fft vhdl source code
Update : 2025-02-17 Size : 29kb Publisher : 阿林
[VHDL-FPGA-Verilog] 1024_FFT DL : 0: 1024点FFT快速傅立叶变换，包含说明文档和VHDL源代码，16位输入/输出，带DMA功能，xilinx的ip-1024-point FFT fast Fourier transform, and includes documentation, VHDL source code, 16 input/output, with DMA function, the ip xilinx
Update : 2025-02-17 Size : 615kb Publisher : 刘超
[VHDL-FPGA-Verilog] synth_fft DL : 0: fft原代码，用vhdl语言完成快速傅立叶变换-fft the original code, complete with VHDL language Fast Fourier Transform
Update : 2025-02-17 Size : 412kb Publisher :
[Algorithm] 20070112201648396 DL : 0: FFT参考设计和一篇用VHDL实现快速傅立叶变换的论文，包括原理分析和代码实现，印度圣雄甘地大学M.A.学院提供 -FFT reference design using VHDL and realize a fast Fourier transform of the thesis, including the principles of analysis and code realize, India Mahatma Gandhi University College, MA
Update : 2025-02-17 Size : 91kb Publisher : 吴庆庆
[Other] VHDL_core_for_1024-point_radix-4_FFT_computation.r DL : 0: 该论文阐述了用于硬件信号处理的基于4基数12点快速傅立叶变换的VHDL核的设计过程。作者：Vite-Frias Jose Alberto、Romero-Troncoso Rene de Jesus、Ordaz-Moreno -The paper described the hardware for signal processing based on the 4 base 12 points Fast Fourier Transform Nuclear VHDL design process. Authors: Vite-Frias Jose Alberto, Romero-Troncoso Rene de Jesus, Ordaz-Moreno
Update : 2025-02-17 Size : 430kb Publisher : Rae
[VHDL-FPGA-Verilog] 1024FFT DL : 0: 1024点FFT快速傅立叶变换 VHDL语言实现-1024-point FFT Fast Fourier Transform VHDL language
Update : 2025-02-17 Size : 426kb Publisher : libukun
[VHDL-FPGA-Verilog] FFT DL : 0: 讲解快速傅里叶变换--FFT快速算法的文章。-On Fast Fourier Transform- FFT fast algorithm for the article.
Update : 2025-02-17 Size : 1.4mb Publisher : lixu
[VHDL-FPGA-Verilog] 16Point-FFT DL : 0: 16点FFT VHDL源程序，The xFFT16 fast Fourier transform (FFT) Core computes a 16-point complex FFT. The input data is a vector of 16 complex values represented as 16-bit 2’s complement numbers – 16-bits for each of the real and imaginary component of a datum.-16:00 FFT VHDL source code, The xFFT16 fast Fourier transform (FFT) Core computes a 16-point complex FFT. The input datais a vector of 16 complex values represented as 16-bit 2 s complement numbers- 16-bits foreach of the real and imaginary component of a datum.
Update : 2025-02-17 Size : 1.74mb Publisher : qiyuan
[VHDL-FPGA-Verilog] signalprocess_fft_VHDL DL : 0: 一篇用VHDL实现快速傅立叶变换的论文，包括原理分析和代码实现，印度圣雄甘地大学M.A.学院提供，同时包含使用手册，做FFT很好的-VHDL with a fast Fourier transform papers, including the principle of analysis and code, India Mahatma Gandhi Institute of the University of MA, at the same time contains the user manual, so good FFT
Update : 2025-02-17 Size : 382kb Publisher : 费尔德
[VHDL-FPGA-Verilog] VHDL DL : 0: VHDL实现快速傅立叶变换 -VHDL implementation VHDL implementation of Fast Fourier Transform Fast Fourier Transform
Update : 2025-02-17 Size : 61kb Publisher : jingzi
[VHDL-FPGA-Verilog] cf_fft_1024_8 DL : 0: 用verilog编写的1024点的fft快速傅立叶变换-Verilog prepared using 1024 point fft Fast Fourier Transform
Update : 2025-02-17 Size : 11kb Publisher : xlxiaoling
[VHDL-FPGA-Verilog] CORDIC DL : 0: 数字控制振荡器（NCO，numerical controlled oscillator）是软件无线电、直接数据频率合成器（DDS，Direct digital synthesizer）、快速傅立叶变换（FFT，Fast Fourier Transform）等的重要组成部分，同时也是决定其性能的主要因素之一，随着芯片集成度的提高、在信号处理、数字通信领域、调制解调、变频调速、制导控制、电力电子等方面得到越来越广泛的应用。-Digital controlled oscillator (NCO, numerical controlled oscillator) is a software-defined radio, direct data on the frequency synthesizer (DDS, Direct digital synthesizer), Fast Fourier Transform (FFT, Fast Fourier Transform), such as an important component of the decision at the same time the performance of one of the main factors, along with the improvement of the chip integrated in the signal processing, digital communications, modulation and demodulation, frequency conversion speed control, guidance control, such as power electronics get more and more widely.
Update : 2025-02-17 Size : 4kb Publisher : 司令
[VHDL-FPGA-Verilog] FPGA_FFT DL : 0: 基于VHDL语言的一个FFT快速傅里叶变换程序。采用4蝶形算法-VHDL language based on a FFT Fast Fourier Transform procedure. 4 butterfly algorithm used
Update : 2025-02-17 Size : 176kb Publisher : 李超
[Algorithm] fft DL : 0: fast fourier transform
Update : 2025-02-17 Size : 28kb Publisher : moh saad
[Embeded-SCM Develop] butterfly DL : 0: 　计算离散傅里叶变换的一种快速算法,简称FFT。快速傅里叶变换是1965年由J.W.库利和T.W.图基提出的。采用这种算法能使计算机计算离散傅里叶变换所需要的乘法次数大为减少,特别是被变换的抽样点数N越多,FFT算法计算量的节省就越显著。 -Discrete Fourier transform calculation of a fast algorithm, referred to as FFT. Fast Fourier Transform in 1965 by JW Cooley and TW map out Kormakiti. This algorithm enables calculation of discrete Fourier transform computer required a significant reduction in the number of multiplication, in particular by changing the sampling points N more, FFT algorithm for calculating the amount of savings will be significant.
Update : 2025-02-17 Size : 1kb Publisher : 圈石
[VHDL-FPGA-Verilog] FFT DL : 0: Fast Fourier Transform in vhdl and matlab
Update : 2025-02-17 Size : 3.92mb Publisher : Marija
[VHDL-FPGA-Verilog] fft DL : 0: 快速傅立叶变换（FFT）的FPGA实现,本系统采用了不同点数基2的复FFT。-Fast Fourier Transform (FFT) of the FPGA, the system uses two different points-based complex FFT.
Update : 2025-02-17 Size : 582kb Publisher : xiaoming
[VHDL-FPGA-Verilog] cFFT DL : 0: CFFT is a radix-4 fast Fourier transform (FFT) core with configurable data width and a configurable number of sample points in the FFT. Twiddle factors are implemented using the CORDIC algorithm, causing the gain of the CFFT core to be different from the standard FFT algorithm. This variation in gain is not important for orthogonal frequency division modulation (OFDM) and demodulation. The gain can be corrected, to that of a conventional FFT, by applying a constant multiplying factor.
Update : 2025-02-17 Size : 179kb Publisher : Nagendran

« 12 »