Location:
Search - DIT Radix-2 FFT
Search list
Description: GENERIC PROGRAM FOR A FAST LOOPED-CODE RADIX-2 DIT FFT-GENERIC PROGRAM FOR A FAST LOOPED-CODE RAD IX-2 DIT FFT
Platform: |
Size: 132392 |
Author: yy |
Hits:
Description: 快速傅立叶算法，按时间和按频率抽取的基2算法-Fast Fourier algorithm, time and frequency taken by the base 2 Algorithm
Platform: |
Size: 1099776 |
Author: 赵勇 |
Hits:
Description: GENERIC PROGRAM FOR A FAST LOOPED-CODE RADIX-2 DIT FFT-GENERIC PROGRAM FOR A FAST LOOPED-CODE RAD IX-2 DIT FFT
Platform: |
Size: 132096 |
Author: yy |
Hits:
Description: 用FFT 计算离散傅里叶变化，时间抽取（DIT）基2算法。-Calculated using FFT Discrete Fourier changes, the time taken (DIT) radix-2 algorithm.
Platform: |
Size: 1024 |
Author: Ming Zhao |
Hits:
Description: FFT算法的基本原理是把长序列的DFT逐次分解为较短序列的DFT。按照抽取方式的不同可分为DIT-FFT（按时间抽取）和DIF-FFT（按频率抽取）算法。按照蝶形运算的构成不同可分为基2、基4、基8以及任意因子（2n,n为大于1的整数），基2、基4算法较为常用。-FFT algorithm is the basic principle of DFT successive long sequence is broken down into shorter sequences of DFT. In accordance with the different extraction methods can be divided into the DIT-FFT (time taken) and the DIF-FFT (according to the frequency of extraction) algorithm. In accordance with the composition of different butterfly operations can be divided into base 2, base 4, base 8, as well as arbitrary factor (2n, n is an integer greater than 1), radix-2, Radix-4 algorithm is more commonly used.
Platform: |
Size: 1024 |
Author: 李文 |
Hits:
Description: 本程序对输入序列din实现DIT——FFT基2算法，点数取大于等于din长度的2的幂次-The program input sequence din realize DIT- FFT radix-2 algorithm, points greater than or equal din take the length of two of the power law
Platform: |
Size: 1024 |
Author: cc |
Hits:
Description: fft The radix-2 algorithms are the simplest FFT algorithms.
The decimation-in-time (DIT) radix-2 FFT recursively partitions
a DFT into two half-length DFTs of the even-indexed and odd-indexed
time samples.
The outputs of these shorter FFTs are reused to compute many outputs
Platform: |
Size: 16384 |
Author: azabusahkra |
Hits:
Description: 本程序对输入序列din实现DIT——FFT基2算法，点数取大于等于din长度的2的幂次-The program realization of the input sequence din DIT- FFT radix-2 algorithm, din length greater than or equal points to take a power of 2
Platform: |
Size: 1024 |
Author: 罗速 |
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: 设计一个按照时间抽取的基2快速傅里叶变换（基2FFT-DIT）。输入倒位序，输出自然顺序。-Design is taken in accordance with the time radix-2 fast Fourier transform the (base 2FFT-DIT). Enter the inversion sequence, the output of the natural order.
Platform: |
Size: 1024 |
Author: 钟福贵 |
Hits:
Description: 基2 fft dif 和 fft dit算法，c语言实现-Radix-2 fft the dif and fft dit algorithm, c language
Platform: |
Size: 2048 |
Author: 樊一鸣 |
Hits:
Description: 主要是fft和ifft算法的c实现.此算法是基2的DIT的FFT算法。-Fft and ifft algorithm using c. Algorithm radix-2 DIT FFT algorithm.
Platform: |
Size: 225280 |
Author: 红薯 |
Hits:
Description: decimation in time radix-2 fft document in pdf containing source code in c language
Platform: |
Size: 171008 |
Author: suha |
Hits:
Description: fft算法的C++程序，主要是基于Radix-2的DIT算法，有助于深入理解快速傅立叶变换-fft algorithm C++ program is mainly based on DIT Radix-2 algorithm, and help us to understand the fast Fourier transform! !
Platform: |
Size: 943104 |
Author: 岑岑 |
Hits:
Description: The Fast Fourier Transform (FFT) is one of the
rudimentary operations in field of digital signal and image
processing. Some of the very vital applications of the fast
fourier transform include Signal analysis, Sound filtering, Data
compression, Partial differential equations, Multiplication of
large integers, Image filtering etc.Fast Fourier transform
(FFT) is an efficient implementation of the discrete Fourier
transform (DFT). This paper concentrates on the development
of the Fast Fourier Transform (FFT), based on Decimation-In-
Time (DIT) domain, Radix-2 algorithm, this paper uses VHDL
as a design entity, and their Synthesis by Xilinx Synthesis Tool
on Vertex kit has been done. The input of Fast Fourier
transform has been given by a PS2 KEYBOARD using a
testbench and output has been displayed using the waveforms
on the Xilinx Design Suite 12.1.The synthesis results show that
the computation for calculating the 32-point Fast Fourier
transform is efficient in terms of speed.
Platform: |
Size: 305152 |
Author: doggaravi |
Hits:
Description: DIT_FFT基2快速离散傅里叶变换的源程序可在vc++上编程应用-DIT FFT radix-2 fast discrete Fourier transform of the source can be used in vc++ programming
Platform: |
Size: 10240 |
Author: liu |
Hits: