搜索资源列表
xhclfft
- 用FFT 进行信号的频谱分析 1、高斯序列 2、衰减正弦序列 3、三角波序列 4、反三角序列-signals using the FFT spectrum analysis of one, two Gaussian sequence, the sequence of 3 attenuation sine, triangle wave sequence 4, anti - triangular series
fft-gpu
- 选自<gpu gemes 2>,用gpu实现快速傅立叶变换
IR
- 对IQ接收器最重要的两个参数,即I和Q两路分量之间的幅度一致性和相位正交性,可采 用如下办法计算:把I、Q 两路信号分别作FFT ,找出频域内信号的幅度,即可算得两路分量的幅度一 致性 把I、Q两路信号合成一个复数信号,作FFT ,对得到的频谱求镜像抑制比(即频域内的信号与信号镜像的幅度比) ,通过镜像抑制比和幅度一致性,可求出接收机的I和Q两路分量之间的相位正交性。-IQ receiver for the two most important parameters, namely
fft
- 快速傅立叶变换的matlab算法实现。（是一个按照时间抽取的基-2快速傅里（基-2 FFT-DIT）。输入倒位序，输出自然顺序。-Fast Fourier Transform algorithm matlab. (Which is a time of extraction in accordance with the base-2 Fast Fu-ri (base-2 FFT-DIT). Enter the inversion sequence, the output of natural or
FFT-(2)
- 实现FFT谱分析，并进行全相位FFT谱与传统FFT谱的比较-To achieve FFT spectrum analysis, and comparison of all phase FFT spectrum with the traditional FFT spectrum
multi-verilog
- 乘法器。fft。 基2.蝶形运算。旋转因子-Multipliers. fft. Group 2 butterfly. Twiddle factor
fft
- C语言实现几种不同FFT的方法：其中包括时间抽取的基2 DFT，频率抽取的基2 DFT，分裂基算法、CZT方法等。-C language implementation of several different FFT approach: including the time taken by the base 2 DFT, frequency extraction base 2 DFT, split based algorithm, CZT methods.
fft
- 可以用于快速傅里叶变换，实数、复数都适合。正余弦变换-Radix-2 Fast Fourier Transform, real or complex sin/cos transform
FFT-and-FFT-2D-ANSI-C
- 标准C语言实现的一维和二维快速傅里叶变换代码，代码运行时不需要额外占用多余的内存空间，简单易用，具体可见代码说明。-FFT and 2 dimension FFT algorithm acommplished with ANSI C.It occupies the least memory space while running after embeded into you project.The source code is easy and brief,you can check the t
rfft
- Real sequence of Fourier transform 实序列傅立叶变换 已验证 用N点FFT计算2N点实序列的FFT，比直接进行2N点FFT运算减少一半运算量 -Real sequence of Fourier transform verified with N points FFT calculation sequence of 2 N point FFT, than half 2 N point FFT operation to reduce computational
FFT2_test
- 基于基2的蝶型FFT，用C实现，经过测试，没有错误，可以直接拿去使用。-Based on base 2 FFT butterfly type, use C implementation, after testing, there is no error, can be directly used.