Location:
Search - fft twiddle
Search list
Description: 基于DSP 6711 浮点的FFT计算，可用CCS打开-6711 floating-point DSP-based FFT calculation can be opened CCS
Platform: |
Size: 147456 |
Author: wuzhenzhi |
Hits:
Description: 最近用Mega128写了一个128点FFT程序，浮点运算，加汉宁窗。由于窗函数和旋转因子通过查表得到，所以速度还可以，程序中给的初值是通过高速AD采集的20KHz正弦信号。计算结果与Matlab的FFT函数得到的结果相同。 -Mega128 recently wrote a 128-point FFT procedures, floating-point operations, Hanning window. Since the window function and the twiddle factor look-up table has been adopted, so the speed can also be, the initial value to the process through high-speed AD collected 20KHz sinusoidal signal. The calculation results with the Matlab
Platform: |
Size: 20480 |
Author: dfsdf |
Hits:
Description: fft twiddle factor multiplier design with cordic processor
Platform: |
Size: 318464 |
Author: park sang yoon |
Hits:
Description: 在分析了快速傅里叶算法理论的基础上，提出了一种频率抽取基4FFT的FPGA设计方案，针对现有FFT的
FPGA实现过程中蝶形运算需要频繁乘以多个旋转因子提出了改进方法，减少了旋转因子的乘法次数和存储空间，加快了蝶
形运算的速度，设计的地址映射方法，无需运算即可得到所需数据的存放地址，并结合采用乒乓结构和流水线方式，来提高
快速傅里叶变换(FFT)FPGA实现的速度，为实现FFT算法提供了一定的参考价值。-In the analysis of the fast Fourier algorithm based on the theory proposed a frequency extraction 4FFT FPGA-based design, the FPGA implementation for existing FFT butterfly operations that require frequent during the rotation factor multiplied by the number of proposed improved method , reducing the number of twiddle factor multiplication and storage space, speed up the butterfly computing speed, design, address mapping method, the required data can be obtained without computing the storage address and a combination of ping-pong structure and assembly line methods to increase rapidly Fourier Transform (FFT) FPGA to achieve the speed, in order to achieve the FFT algorithm provides a certain reference value.
Platform: |
Size: 376832 |
Author: wk |
Hits:
Description: 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.
Platform: |
Size: 183296 |
Author: Nagendran |
Hits:
Description: FFT旋转因子，旋转因子是蝶形运算的组成部分，是数字信号处理FFT算法的基础部分-FFT twiddle factor, rotation factor is an integral part of the butterfly, digital signal processing is a fundamental part of FFT algorithm
Platform: |
Size: 1024 |
Author: 姚兴波 |
Hits:
Description: this program calculates the twiddle factors, generator sine wave with user setting sample rate, signal frequency. The user interface gives parameter setting of sample frequency, signal freqency and number of sample and so on.
Platform: |
Size: 273408 |
Author: Jim Lai |
Hits:
Description: 提出了一个用于快速Fourier变换计算的反写码序的旋转因子表,这种旋转因子表具有可扩展性-Scalable twiddle factor tables and FFT algorithms
Platform: |
Size: 180224 |
Author: zhanglili |
Hits:
Description: FFT中 旋转因子8位复数乘法的VHDL程序，3次实数乘法和3次加减法运算，-FFT twiddle factor of the VHDL program, 3 times real multiplication and subtraction 3
Platform: |
Size: 1024 |
Author: cxl |
Hits:
Description: FFT控制器需要的旋转因子数据，可以直接使用-FFT twiddle factor data controller is required，Can be used directly
Platform: |
Size: 50176 |
Author: tangganping |
Hits:
Description: An Elementary Introduction to the Discrete Fourier Transform
1.1 ComplexNumbers
1.3 Analyzing the Series
1.5 Filtering a Signal
1.6 How Often Does One Sample?
1.7 Notes and References
1.2 Trigonometric Interpolation
1.4 Fourier Frequency Versus Time Frequency
2 Some Mathematical and Computational Preliminaries
2.1 Computing the Twiddle Factors
2.2.1 Real floating-point operation (FLOP) count
2.2.2 Special considerations in computing the FFT
2.3 Expressing Complex Multiply-Adds in Terms of Real Multiply-Adds
2.4 Solving Recurrences to Determine an Unknown Function
2.2 Multiplying Two Complex Numbers
II Sequential FFT Algorithms
3 The Divide-and-Conquer Paradigm and Two Basic FFT Algorithms
3.1 Radix-2 Decimation-In-Time (DIT) FFT
3.1.1 Analyzing the arithmetic cost
3.2 Radix-2 Decimation-In-Frequency (DIF) FFT
3.2.1 Analyzing the arithmetic cost
3.3 Notes and References
Platform: |
Size: 14788608 |
Author: Rakesh |
Hits:
Description: 下面是找到了基2 FFT蝴蝶旋转因子的Matlab代码。代码计算的 A 相角，在图1（c）和图2（c）所示，旋转因子的因素。我建议你开始8点DIT的FFT图1（a）通过运行代码然后运行图2中的代码为16点DIF FFT（一）。-Below is the Matlab code to find radix-2 FFT butterfly twiddle factors. The code computes the A phase angle factors that are used in the twiddle factors as shown in Figure 1(c) and Figure 2(c). I suggest you start by running the code for the 8-point DIT FFT in Figure 1(a) and then run the code for the 16-point DIF FFT in Figure 2(a).
Platform: |
Size: 1024 |
Author: 张成 |
Hits:
Description: 自己编写的FFT基2 MATLAB程序，其中包括换位以及旋转因子变化，调试通过，和matlab自带程序时间等都差不多-Write your own FFT-based 2 MATLAB program, including changes in transposition and twiddle factor debugging through time and matlab own procedures and so almost
Platform: |
Size: 1024 |
Author: gt |
Hits:
Description: 1024点FFT的VHDL程序，含碟形图，旋转因子存储及产生代码，最后是VHDL整体设计，quartus ii编译环境-1024-point FFT VHDL program, including dish-shaped figure, twiddle factor , last VHDL overall design, Quartus ii compile environment
Platform: |
Size: 1005568 |
Author: 瞿鑫 |
Hits:
Description: 乘法器。fft。 基2.蝶形运算。旋转因子-Multipliers. fft. Group 2 butterfly. Twiddle factor
Platform: |
Size: 1024 |
Author: 随身 |
Hits: