Location:
Search - fft complex DSP
Search list
Description: 基于tms320vc55*系列DSP常用算法，包括：
1. Experiment 7A - Radix-2 Complex FFT in C
2. Experiment 7B - Radix-2 Complex FFT in C55x Assembly Language
3. Experiment 7C - Radix-2 Complex FFT and IFFT
4. Experiment 7C - Fast Convolution
5. matlab 源码- Based on tms320vc55* series DSP commonly used algorithm,
including: 1. Experiment 7A - Radix-2 Complex FFT in C
2. Experiment 7B - Radix-2 Complex FFT in C55x Assembly
Language
3. Experiment 7C - Radix-2 Complex FFT and IFFT
4. Experiment 7C - Fast Convolution
5. matlab source code
Platform: |
Size: 79064 |
Author: 李国龙 |
Hits:
Description: C语言实现各种常用的数字信号处理方法。比如复数运算、快速傅立叶变换FFT以及各种滤波算法-C language commonly used in various digital signal processing methods. For example, complex operations, FFT fast Fourier transform algorithm and the various filtering
Platform: |
Size: 71406 |
Author: 王雪松 |
Hits:
Description: 程序通过DSP来实现数字滤波FFT的功能-The program implements FFT with DSP
Platform: |
Size: 15360 |
Author: 胡龙 |
Hits:
Description: 基于tms320vc55*系列DSP常用算法，包括：
1. Experiment 7A - Radix-2 Complex FFT in C
2. Experiment 7B - Radix-2 Complex FFT in C55x Assembly Language
3. Experiment 7C - Radix-2 Complex FFT and IFFT
4. Experiment 7C - Fast Convolution
5. matlab 源码- Based on tms320vc55* series DSP commonly used algorithm,
including: 1. Experiment 7A- Radix-2 Complex FFT in C
2. Experiment 7B- Radix-2 Complex FFT in C55x Assembly
Language
3. Experiment 7C- Radix-2 Complex FFT and IFFT
4. Experiment 7C- Fast Convolution
5. matlab source code
Platform: |
Size: 78848 |
Author: |
Hits:
Description: C语言实现各种常用的数字信号处理方法。比如复数运算、快速傅立叶变换FFT以及各种滤波算法-C language commonly used in various digital signal processing methods. For example, complex operations, FFT fast Fourier transform algorithm and the various filtering
Platform: |
Size: 70656 |
Author: 王雪松 |
Hits:
Description: 该程序是应用在DSP上的傅里叶变换。它是对复序列的数组进行傅里叶变换后，输出相应的频谱数组。-The procedure is used in the Fourier transform DSP. It is a complex sequence of Fourier transform to the array, the output spectrum corresponding array.
Platform: |
Size: 1024 |
Author: 蔡志伟 |
Hits:
Description: dsp算法40例,包括fft、滤波器、谱运算等
1． 将模拟滤波器转变为数字滤波器。
2． 由得到幅频响应 。
3． 用Burg算法求AR模型的参数。
4． 由AR模型参数得到功率谱。
5． 用Levinson算法求解Yule-Walker方程以得到 阶AR模型的参数 。
6． 实现双线性Z变换。
7． 设计巴特沃斯模拟低通滤波器，求出转移函数 。
8． 设计切比雪夫I型模拟低通滤波器，求出转移函数 。
9． 直接由定义求 点复序列 的DFT 。
10．利用经典的Cooley-Tukey基2算法求复序列 的DFT 。
-dsp algorithms 40 cases, including the fft, filter, spectrum operations, etc.
1. Analog filters into digital filters.
2. Amplitude-frequency response by obtained.
3. Burg algorithm for AR model with the parameters of demand.
4. AR model parameters obtained from the power spectrum.
5. Levinson algorithm using Yule-Walker equations to get the first-order AR model
parameters.
6. The bilinear Z transform to achieve.
7. Design of Butterworth analog low-pass filter, find the transfer function.
8. Design of Chebyshev-I analog low-pass filter, find the transfer function.
9. Directly from the definition of point complex sequence of DFT.
10. The use of the classic Cooley-Tukey radix-2 algorithm is seeking re-sequence of DFT.
.......
Platform: |
Size: 59392 |
Author: jack |
Hits:
Description: 用dsp实现快速傅立叶变换(FFT)算法，FFT 并不是一种新的变换，它是离散傅立叶变换（DFT）的一种快速算法。由于我们在计
算DFT 时一次复数乘法需用四次实数乘法和二次实数加法；一次复数加法则需二次实数加法。每运算一个X（k）需要4N 次复数乘法及2N+2（N-1）=2（2N-1）次实数加法。所以整个DFT运算总共需要4N^2 次实数乘法和N*2(2N-1)=2N(2N-1)次实数加法-
Dsp to achieve the fast Fourier transform (FFT) algorithm, the FFT is not a new transform, which is a fast algorithm for the discrete Fourier transform (DFT).Since the time when we in the calculation of DFT complex multiplication required four real multiplications and secondary real additions a complex additions need to quadratic real additions. Each operator a (k) 4N complex multiplications and 2N+2 (N-1) = 2 (2N-1) times the real number addition. Entire DFT operation a total of 4N ^ 2 real multiplications and N* 2 (2N-1) = 2N (2N-1) real additions
Platform: |
Size: 81920 |
Author: 车 |
Hits:
Description: TI C283X系列dsp浮点运算库，主要包括实数FFT复数FFT及IFFT-The TI the C283X family dsp floating-point arithmetic library, including real number FFT complex FFT and IFFT
Platform: |
Size: 79872 |
Author: |
Hits:
Description: TI的FFT库函数,最高可完成1024个点的FFT运算，适用于C28***系列DSP-This FFT library contains generic FFT module (32-bit implementation) for real/complex FFT.
Platform: |
Size: 1008640 |
Author: moneyfan |
Hits:
Description: 在TI DSP上实现扩展精度的FFT和IFFT-Extended-Precision Complex Radix-2 FFT/IFFT
Implemented on TMS320C62x
Platform: |
Size: 62464 |
Author: 催勇 |
Hits: