Description: 实数序列的快速傅立叶变换，基本算法为分裂基算法，将实数序列数组的地址给函数即可-actual sequence of the fast Fourier transform, the basic algorithm for splitting algorithm-based, real-sequence addresses to the array function can be Platform: |
Size: 3072 |
Author:刘祜 |
Hits:
Description: DIT-FFT算法子程序
FFT长度为2m，m为正整数。FFT输出结果放在输入复数数组中。其中xr存放信号序列实部，xi存放信号序列虚部。如果信号长度小于N，需要给xr和xi后面补足0，计算结果x(k)的实部和虚部仍然分别存放在数组xr和xi中。-DIT- FFT subroutine FFT length of 2m, m is a positive integer. FFT output on the importation of complex array. Xr which kept real signal sequence, the signal sequence xi kept the imaginary part. If the signal is less than the length of N, and the need to xr xi behind complement 0, The results of x (k) the real and imaginary parts were still stored in the array xr and xi China. Platform: |
Size: 2048 |
Author:jia |
Hits:
Description: DIT-FFT算法子程序
FFT长度为2m，m为正整数。FFT输出结果放在输入复数数组中。其中xr存放信号序列实部，xi存放信号序列虚部。如果信号长度小于N，需要给xr和xi后面补足0，计算结果x(k)的实部和虚部仍然分别存放在数组xr和xi中。-DIT- FFT subroutine FFT length of 2m, m is a positive integer. FFT output on the importation of complex array. Xr which kept real signal sequence, the signal sequence xi kept the imaginary part. If the signal is less than the length of N, and the need to xr xi behind complement 0, The results of x (k) the real and imaginary parts were still stored in the array xr and xi China. Platform: |
Size: 1024 |
Author:jia |
Hits:
Description: FFT算法研究与实现(C语言),1 倒位序算法分析,2 实数蝶形运算算法的推导,3 DIT FFT 算法的基本思想分析-Research and Implementation of FFT algorithm (C language), one inversion algorithm sequence analysis, 2 real butterfly computation algorithm is derived, 3 DIT FFT algorithm the basic idea of analysis Platform: |
Size: 3072 |
Author:sxd |
Hits:
Description:
N个实序列转成N/2个复序列，求N个实序列实序列FFT快速变换.-N real sequence into N/2 months complex sequence for N real sequence is the rapid transformation sequence FFT. Platform: |
Size: 3072 |
Author:慌种衣 |
Hits:
Description: 将共轭对称性复序列进行快速傅里叶反变换,得出变换结果为实序列。-The conjugate symmetry sequence complex Fast Fourier Transform, transform the results obtained for the real sequence. Platform: |
Size: 1024 |
Author:慌种衣 |
Hits:
Description: 2N点实序列FFT_C程序
上《数字信号处理》课程时编的-2N-point real sequence FFT_C procedural Digital Signal Processing course series Platform: |
Size: 2048 |
Author:swaxm |
Hits:
Description: 序执行时要求输入序列的长度N_pre，N_pre 是最初输入序列的长度，任意长度都可以。N是指补零后的序列长度，满足2^L.
然后逐个输入各个元素的实部和虚部，补零部分不必输入。
显示FFT变换的结果。-Order execution when the input sequence length requirements N_pre, N_pre are the initial input sequence length, can be of any length. N refers to zero after the sequence length, then 2 ^ L. Satisfied by the importation of all elements of real and imaginary parts, some do not have to enter zero. Shows the results of FFT transform. Platform: |
Size: 202752 |
Author:李昊然 |
Hits:
Description: 2048点实序列fft 采用优化地方法节省存储空间和运算时间。包括2048点实序列fft，信号幅度谱分析和排序。本程序用于基于tms320lf2407的波形采集与分析上，能够精确分析信号的幅度和频率分量。-2048-point sequence is optimized to fft method used to save storage space and computing time. Including the 2048-point real sequence fft, signal amplitude spectrum analysis and sequencing. This procedure for tms320lf2407 based on the waveform acquisition and analysis, to accurately analyze the magnitude and frequency of signal components. Platform: |
Size: 8192 |
Author:熊涛 |
Hits:
Description: 基2fft,实现对实数序列的离散快速傅里叶变换-Based 2fft, the realization of the real sequence of discrete Fast Fourier Transform Platform: |
Size: 1024 |
Author:zhaoyan |
Hits:
Description: 多维傅里叶变换，二维DFT快速算法，共分五部--五：三维实序列3D-DFT快速算法-Multi-dimensional Fourier transform, fast algorithm for two-dimensional DFT is divided into 5- 5: Three-dimensional real sequence of 3D-DFT Fast Algorithm Platform: |
Size: 4096 |
Author:jet ju |
Hits:
Description: 实现了一维实序列的fft变换，有随机数产生函数、补零函数，返回值放在一个复数数组中，并有取模运算。-Achieved on the real sequence of fft transform, there are random number generator function, zero fill function, the return value in a complex array, and a modulo operation. Platform: |
Size: 1024 |
Author:zhouyanmei |
Hits:
Description: 实际中需做快速傅里叶变换(FFT)的多为实序列数据，而其变换算法都是以复数序列
作为输入。文中利用频域的性质．将实序列数据变换为复数序列，再进行FFT变换，以提高FFT对于实序列输入的变换效率，最后用C语言实现该算法并与传统算法进行实验对比，从结果可看到优化后效率提高很多。-FFT algorithm with complex sequences as input is commonly applied to real sequence．A
new FFT algorithm is proposed，which depends on the characters of the frequency domain，transforms real
into complex sequences as input to improve the efficiency of FFT．The algorithm is programmed in C
language and compared with the unoptimized．The result indicates that the new algorithm does improve the
transformation efficiency． Platform: |
Size: 227328 |
Author:陈晓娟 |
Hits:
Description: 一种实序列FFT新算法与C语言实现FFT of a real sequence and the C language implementation of new algorithms-FFT of a real sequence and the C language implementation of new algorithms Platform: |
Size: 939008 |
Author:net515 |
Hits:
Description: 实际中需做快速傅里叶变换(FFT)的多为实序列数据，而其变换算法都是以复数序列作为输入。文中利用频域的性质，将实序列数据变换为复数序列，再进行FFT 变换，以提高FFT对于实序列输入的变换效率，最后用C 语言实现该算法并与传统算法进行实验对比，从结果可看到优化后效率提高很多。-Practice to be done fast Fourier transform (FFT) for the implementation of multi-sequence data, and its transformation algorithm are based on complex sequence as input. The system uses frequency-domain nature of the real sequence data transformation is a complex number sequence, then the FFT transform, to enhance the FFT for the real sequence input conversion efficiency, and finally with the C language implementation of the algorithm with the traditional algorithm experimental comparison, from the results see a lot more efficient after optimization. Platform: |
Size: 940032 |
Author:Stuart |
Hits:
Description: 实序列的FFT算法
当isign=1时,对实序列data[1..n]做FFT,
返回正频率的系数保存在data[1..n]中
当isign=-1时,对实序列做IFFT,所得结果乘以2/n为原序列
n必须为2的幂-//The real sequence of FFT algorithm// When isign = 1, the sequence of real data [1 .. n] do FFT,// Return positive frequency coefficients stored in the data [1 .. n] in// When isign =-1, the actual sequence to do IFFT, the result is multiplied by 2/n for the original sequence// n must be a power of 2 Platform: |
Size: 1024 |
Author:徐校波 |
Hits:
Description: 程序 FFT_NCompl_2NReal_float 是用 *N点复序列FFT* 来计算 *2N点实序列* 离散傅立叶变换的函数。其中复序列FFT变换用到基2浮点DIT的算法程序。-Program FFT_NCompl_2NReal_float is* N point complex sequence to calculate the FFT** 2N point real sequence* Discrete Fourier Transform function. Complex sequence of which use base 2 floating-point FFT transform algorithm DIT program. Platform: |
Size: 248832 |
Author:傲天 |
Hits:
Description: 计算实序列的快速傅里叶变换，它比复序列FFT算法大约可减少一半的运算量和存储量。-Calculate the real sequence of the fast Fourier transform, which is the time taken by the sequence of the base 2 FFT algorithm, it is more than complex sequence FFT algorithm can be roughly halved the amount of computation and storage. Platform: |
Size: 163840 |
Author:冰河 |
Hits:
Description: 用c#实现实序列的DFT和FFT变换，DFT与FFT均为自己编写-With c# Realize the real sequence of DFT and FFT transform, DFT and FFT are themselves prepared Platform: |
Size: 59392 |
Author:zhang |
Hits:
Description: 实序列FFT快速算法，用N点FFT计算2N点实序列的FFT，比直接进行2N点FFT运算减少一半运算量。-Real sequence FFT fast algorithm, using N-point FFT calculation 2N point real sequence of FFT, than the direct 2N-point FFT computation halved. Platform: |
Size: 657408 |
Author:王恺 |
Hits:
Search - real sequence FFT