Location:
Search - fft if
Search list
Description: 本人做的GPS并行码捕获的算法.用的是1024点FFT,原始数据可以假如不同功率的噪声.-GPS parallel code acquisition algorithm. Using a 1024-point FFT. If the original data can be different noise power.
Platform: |
Size: 22010 |
Author: 朱广清 |
Hits:
Description: 这是一个数字信号处理的函数库,包括FFT变换，各种滤波算法， 如果你要编写数字信号处理相关的程序，这是个不错的选择-This a digital signal processing functions, including FFT, various filtering algorithm, if you want to prepare digital signal processing related to the procedure, which is not a bad choice
Platform: |
Size: 40960 |
Author: 开始 |
Hits:
Description: 关于二维小波变换的程序 [精华]
说明：此算法重在概念，速度并不是很快。因为FOR循环的缘故。此程序从循环矩阵的观点出发，把圆周卷积和快速幅里叶变换建立了联系。实现了分解和无失真重构。它只做了一层分解，即将256x256图形分解成为64x64的四个图形，避免了使用WKEEP()的困惑。主要思想为用小波滤波器族构造正交阵W,变换写为B=W*A*W ,反变换为：A=W *A*W,这与所有正交变换无异。W为循环正交矩阵，因此可用FFT实现快速运算，难点就在重构矩阵上。若用矩阵概念明确，一个共扼转置可以搞顶。但FFT的使用必须找到与分解序列的关系。-on Wavelet Transform procedures [best] Note : This algorithm important concept is not speed quickly. Because FOR cycle nowadays. This program cycle from the point of view of Matrix, circular convolution and fast Fourier transform is established links. To achieve the decomposition and reconstruction without distortion. It only had one decomposition, 256x256 graphics will be 64x64 decomposition of the four graphics, avoiding the use of WKEEP () confusion. The main idea of using wavelet filter generator orthogonal array W, write to transform B = W* A* W, anti-Transform : A = W* A* W, which is orthogonal transformation all the same. W cycle orthogonal matrix, can be used to achieve rapid FFT computation, on the difficult reconstruction matrix. If a clear matrix concept, a home to a total o
Platform: |
Size: 3072 |
Author: 罗松溪 |
Hits:
Description: 我的一个分裂基快速FFT变换程序.不知道有没有错-I split a fast FFT-based procedures. Do not know if it is right or wrong
Platform: |
Size: 1024 |
Author: 张天笑 |
Hits:
Description: 本人做的GPS并行码捕获的算法.用的是1024点FFT,原始数据可以假如不同功率的噪声.-GPS parallel code acquisition algorithm. Using a 1024-point FFT. If the original data can be different noise power.
Platform: |
Size: 21504 |
Author: 朱广清 |
Hits:
Description: Windows下图象处理。可读取/保存常见的多种图象格式，如bmp,jpg,jpeg,png,pcx,tif,tga,gif,wmf,emf,wbmp,可做常规的图象处理，如缩放，裁减，翻转，镜像，旋转，柔化，锐化，亮度，对比度，模糊，伪彩，浮雕，边缘检测，中值滤波，不同图片的颜色通道分离，合并，gamma,fft变换处理等，有多文档窗口的demo程序，demo本身就能算是个功能完善的图象处理工具，能够学到很多图象处理知识。-Windows image processing. Reads/preservation of a variety of common image formats such as bmp, jpg, jpeg, png, pcx, tif, tga, gif, wmf, emf, wbmp, if the conventional image processing, such as zoom, reductions overturned, mirror, rotate, soften, sharpening, brightness, contrast, fuzzy, pseudo-color, relief, edge detection, filtering, The color photographs of different channel separation, the merger, gamma, fft transform treatment. how the document window demo procedures demo itself can be considered a functional improvement of image processing tools, can learn a lot image processing knowledge.
Platform: |
Size: 1351680 |
Author: 免战牌 |
Hits:
Description: 设信号 ，用 对x(t)采样得x(n)，是否会发生频谱混叠？现利用FFT分析其频谱。
1．编程绘制该信号的波形。
2．若令N=16，编程对x(n)做FFT运算，并绘制其幅频特性曲线。
3．令N=1024，编程对x(n)做FFT运算，并绘制其幅频特性曲线。
4．分析2、3的运算结果。
设计调试报告要求：
1．工作原理简述；
2．设计思路；
3．难点及解决方法；
4．设计、调试结果及分析；
5．程序文本及操作步骤。-based signal used to x (t) in the sample x (n), whether there will be a spectrum aliasing? FFT analysis is the use of their spectrum. 1. Programming mapping of the signal waveform. 2. If so N = 16, the programming of x (n) do FFT, and the mapping of its amplitude-frequency characteristic curve. 3. Order N = 1024, the programming of x (n) do FFT, and the mapping of its amplitude-frequency characteristic curve. 4. Analysis of two, three computational results. Design debugging reporting requirements : 1. Principle outlined; 2. Design; 3. Difficulties and solutions; 4. Design, debugging and analysis of results; 5. Text and operating procedures steps.
Platform: |
Size: 49152 |
Author: 魏臻 |
Hits:
Description: 1．通过实验加深对快速傅立叶变换（FFT）基本原理的理解。
2．了解FFT点数与频谱分辨率的关系，以及两种加长序列FFT与原序列FFT的关系。
离散傅里叶变换（DFT）和卷积是信号处理中两个最基本也是最常用的运算，它们涉及到信号与系统的分析与综合这一广泛的信号处理领域。实际上卷积与DFT之间有着互通的联系：卷积可化为DFT来实现，其它的许多算法，如相关、滤波和谱估计等都可化为DFT来实现，DFT也可化为卷积来实现。-1. Deepen the experimental fast Fourier transform (FFT) the basic tenets of understanding. 2. Understand the FFT spectrum and points of the resolution, and two extended sequence with the original FFT FFT relations. Discrete Fourier Transform (DFT) and the convolution of two signal processing is the most commonly used basic arithmetic, they relate to the signal and system analysis and synthesis of the wide range of signal processing field. DFT actually convolution and interoperability between contact : DFT into convolution can be achieved in many other algorithms, If relevant, filtering and spectral estimation could be achieved as DFT, DFT into convolution can be achieved.
Platform: |
Size: 3072 |
Author: 深蓝 |
Hits:
Description: 设模拟带通信号频率范围1KHz—1.1KHz，设计一个采样频率8KHz数字频谱分析系统，要求频率分辨率0.1Hz。若对信号直接用FFT进行频谱分析-simulation based communications, with the frequency range 1KHz- 1.1KHz. Design of an 8 KHz sampling frequency digital spectrum analysis system requirements frequency resolution 0.1 Hz. If the signal directly FFT spectrum analysis
Platform: |
Size: 70656 |
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代码, 本代码在工程项目中得到了应用的检验. 若哪位发现BUG请通知本人.-A complete FFT transform C code, the code of the project has been applied the test. Which, if found please let me BUG.
Platform: |
Size: 23552 |
Author: leiming691128 |
Hits:
Description: 这是一个语音的文件的一个FFT转换文件,是用C++写的源程序,相信对大家有用-fft tranform if you like it, try to use it and share your idea.thank you.
Platform: |
Size: 3072 |
Author: liu |
Hits:
Description: Special Requirements
?nx must be a power of 2.
?The index array must be set up by bitrev_index before the function DSP_bitrev_cplx is called.
?If nx ?4K, one can use the char (8-bit) data type for the "index" variable. This would require changing the LDH when loading index values in the assembly routine to LDB. This would further reduce the size of the Index Table by half its size.
Platform: |
Size: 1024 |
Author: pranav |
Hits:
Description: matlab里FFT变换时的频移程序，自动将FFT变化后的数据移到零频两边，方便好用-FFT transform in matlab frequency shift when the process changes automatically after the FFT to the zero-frequency data on both sides, easy-to-use
Platform: |
Size: 1024 |
Author: 断刀割月 |
Hits:
Description: // 函数名: 快速傅立叶变换
// 本函数测试OK,可以在TC2.0,VC++6.0,Keil C51测试通过。
// 如果你的MCS51系统有足够的RAM时,可以验证一下用单片机处理FFT有多么的慢。
-//Function name: Fast Fourier Transform// This function tests OK, you can TC2.0, VC++6.0, Keil C51 test.// If you MCS51 system has enough RAM, you can verify how to use microcontroller slow FFT processing.
Platform: |
Size: 1024 |
Author: 刘玉才 |
Hits:
Description: 电子设计大赛中430写的FFT变换程序，总共128个点，如果需要更多的点可自己设定-Electronic Design Competition FFT transformation process 430 to write a total of 128 points, if you need more points to set their own
Platform: |
Size: 78848 |
Author: 陈俊涵 |
Hits:
Description: 基于51单片机控制的FFT算法，这个程序经过自己测试可行，有需要的话可以自己下载调试下-51 Microcontroller based on FFT algorithm, this program possible through their own testing, if necessary under the debugger can download
Platform: |
Size: 5120 |
Author: 银钢 |
Hits:
Description: 因此，即便使用ISR而不是HWI,他的中断延时也是蛮大的，因此，我想知道，对于这种强实时的应用如何考虑，裸跑我认为可能比SYS/BIOS还要好一些。(Square brackets ( [ and ] ) identify an optional parameter. If you use
an optional parameter, you specify the information within the
brackets. Unless the square brac)
Platform: |
Size: 176128 |
Author: zchzch
|
Hits:
Description: stm32进行AD采样dma传送进行快速fft，同时包含MAX197驱动，但是ad采样时没有使用，需要的话也可以自己添加使用(Stm32 performs AD sampling dma transfer for fast fft, and includes MAX197 driver, but it is not used when ad sampling. If you need it, you can add it yourself.)
Platform: |
Size: 10207232 |
Author: obamawzd |
Hits: