搜索资源列表
DSP1
- DSP based programs for DFT, IDFT, FFT, Circular Convolution etc.
Myproject
- 快速傅立叶变换（FFT）是一个有效的算法来计算离散傅立叶变换（DFT）及其逆。有很多不同的FFT算法，涉及范围很广，从简单的复数运算的数学组理论和数字理论,这里我给大家带来了一个能够进行快速傅里叶变换及其逆的程序，希望对大家能够有所帮助-A Fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. There are
dsp
- VC++实现数字信号处理（DFT，FFT，滤波器等）-dsp use vc++
Dsiggnal_proci
- 数字信号处理一种基于matlab 文件内容/conv(卷积部分)dupconv重叠保留法freqcirconv频域圆周卷积freqconv频域卷积timecirconv时域圆周卷积timeconv时域域卷积积/fft(频域分析部分)d2fft基2FFTdft DFT最简化程序源码dtftDTFT演示/fir(fir滤波器设计)fir 的到fir滤波器hngetwindow 的到fir滤波器窗函数wn -Digital signal processing matlab file content
bmp-process
- 数字图象处理算法的演示，包括：图象的DFT和逆DFT 图象的FFT和逆FFT；在图象中加入正弦噪声；图象的模板运算实现图象平滑和锐化；图象的直方图均衡化 • 图象的对比度拉伸 • 图象的中值滤波 • 图象灰度直方图的显示 • 若干频域滤波器 • 图象的镜像 • 图象的旋转（90度与任意角度） • 图象的放缩 • 其它小算法 -Demonstration of
DFTaFFT
- 离散傅立叶变换DFT源程序，包括时域离散化，求W算子表，原信号的时域描述和离散频域描述。以及快速傅立叶变换FFT源程序，里面有蝶形算法的循环步骤。适合初学者-Discrete Fourier Transform DFT source, including the time-domain discretization, find the W operator table, the original descr iption of the time-domain signal and discret
relation_dtft_dft_fft
- 说明连续时间傅里叶变换与DTFT、DFT之间的关系，及由FFT求连续时间傅里叶变换的方法。文档说明加MATLAB代码-This project is about the relationship of CTFT, DTFT and DFT, how to calculating CTFT by using FFT. This project contains document and matlab code.
Square-wave
- matlab 实现傅里叶变换 fs FT DFS DFT FFT 以及余弦函数的抽样 离散傅里叶变换 频谱 函数叠加后的傅里叶变换 频谱 -matlab to achieve the Fourier transform fs FT DFS DFT FFT and cosine functions sampling discrete Fourier transform the spectrum of the Fourier transform of the spectrum function su
DSP-Applications-using-C-a-TMS320C6x-DSK-(Chassai
- C. S. BURRUS and T. W. PARKS: DFT/FFT AND CONVOLUTION ALGORITHMS: THEORY AND IMPLEMENTATION JOHN R. TREICHLER, C. RICHARD JOHNSON, JR., and MICHAEL G. LARIMORE: THEORY AND DESIGN OF ADAPTIVE FILTERS T. W. PARKS and C. S. BURRUS: DIGITAL FILTE
ee
- 快速傅立叶变换(FFT)是离散傅立叶变换的一种有效的算法，通过选择和重新排列中间结果，减小运算量。DFT有大量重复的cos、sin计算，FFT的作用就是用技巧减少cos、sin项重复计算。当采样点数为1024点,DFT要求一百万次以上计算量，而FFT则只要求一万次。-cout width cout width cout width cout width cout width cout width cout width cout width cout width cout width cout w
nonsythasizable8pointfft
- A Fast Fourier Transform(FFT) is an efficient algorithm for calculating the discrete Fourier transform of a set of data. A DFT basically decomposes a set of data in time domain into different frequency components. DFT is defined by the following equa
FFTSim.m
- 仿真FFT参数对采用FFT算法分析信号频谱的影响。产生频率分别为2Hz，2.05Hz的正弦波合成信号，采样 频率＝10Hz。根据（8-8）式，要实现分辨两个单频信号的目的，DFT的序列长度必须满足 。分别仿真3种 情况下的FFT变换：１）取 的128点数据，计算FFT；２）将128点 以补零的方式加长到512点，计算FFT； 3）取512点 ，计算FFT-fft simulation matlab
qqsh1.9.0
- 用FFT和DFT对波形进行时域和频谱分析并计算-Using FFT and DFT for time domain waveform and frequency spectrum analysis and calculation
FFT_NFFT
- 数字图象处理算法的演示，主要包括：DFT和逆DFT以及FFT和逆FFT。-Digital image processing algorithms demo, including: DFT and inverse DFT, FFT and inverse FFT.
project
- 时域、频域抽取FFT算法，外加普通DFT算法。测试了两种方法的效率-Time domain, frequency domain to extract the FFT algorithm, plus ordinary DFT algorithm. Test the efficiency of the two methods
DFTPFFT
- 数字信号系统设计DFT-FFT,C程序，-Digital signal system design DFT-FFT, C program,
KeygenCircuitMakerV6.0Pro
- A Fast Fourier Transform (FFT) is an efficient algorithm to compute the Discrete Fourier Transform (DFT) and its inverse. There are many distinct FFT algorithms involving a wide range of mathematics, from simple complex-number arithmetic to group the
LibProteus
- The FFT is based on decomposition and breaking the transform into smaller transforms and combining them to get the total transform. FFT reduces the computation time required to compute a discrete Fourier transform and improves the performance by a fa
ThamKhaoCodeCaAssembly
- The FFT is based on decomposition and breaking the transform into smaller transforms and combining them to get the total transform. FFT reduces the computation time required to compute a discrete Fourier transform and improves the performance by a fa
slau213a
- The FFT is based on decomposition and breaking the transform into smaller transforms and combining them to get the total transform. FFT reduces the computation time required to compute a discrete Fourier transform and improves the performance by a fa