搜索资源列表
eg
- x=2*sin(4*pi*t)+5*cos(8*pi*t) 对其进行快速傅立叶变换 加入高斯噪声 再进行频谱分析-x = 2 * sin (4 * pi * t) 5 * cos (8 * pi * t) makes its rapid Fourier transform to re-Gaussian noise spectral analysis
sin-fft
- 注释非常详细的FFT变换，用matlab实现两个正弦函数的区分，初学着都能看懂-Notes very detailed FFT transform, with the achievement of the two sine function matlab distinction, the novice can understand
fft
- Radix-2 Fast Fourier Transform, real or complex sin/cos transform -Radix-2 Fast Fourier Transform, real or complex sin/cos transform
fft_plot
- routine to take the Fourier transform of a signal and plot both the time and frequency domain representations. Typical use: >> n = 100 number of data points >> dt = 0.01 spacing between samples >> t = 0:dt:(n-1)*dt time
examples-(dsp-and-communications)
- this .rar file is dedecated to the beginers in the communications and digital signal processing fileds : 1. simple amplitude modulation 2. Disictete Fourier Transform 3. plotting the digital symbols 4. Digital Data Representation 5. Digital
dsp_system
- 实现一个数字信号处理的仿真系统 。具有界面并实现以下功能：能产生（得到）并选择各种数字信号（sin、方波、三角波、语音、噪声及其叠加）；具有DFT和DCT变换功能，对各种信号进行变换；设计滤波器实现低通、高通、带通滤波，得到输出信号的频域特性和时间序列。-the realization of a digital signal processing simulation system. Requires interface and achieve the following functions:
Discret-Wavelet-Transform-got-Daub2-by-Santhana-R
- y=d2wavelet(x,Fs,level) does the 2nd order Daubechies Wavelet Transform of signal x with a sampling frequency Fs and the DWT is decomposition is done upto a level It returns the matrix of all decompositions and the final approximations. Instead
sin-FFT--IFFT
- 对原始正弦信号进行傅里叶变换与逆变换并给出结果-Fourier transform and inverse transform the original sinusoidal signals and gives results
yi
- 基于matlab 的叠加高斯白噪声的正弦信号频谱分析，给定正弦函数x=sin(2πf0n/N+π/3)+sin(2πf1n/N+π/4)，设定f0.f1的值，加了噪声之后做快速傅里叶变换，在matlab中分析其频谱，验证是否与f0,f1的值符合。再变换N值，看随着N值的变化对应点是否符合及有何变化。-Matlab based on the superposition of Gaussian white noise sinusoidal signal spectrum analysis, giv
ee
- 快速傅里叶变换 (FFT) 实现，给定信号x(t)=sin(2πf0t)，f0=50Hz，对x(t)以fs=200Hz进行抽样，抽样点数为N=16。编写程序实现对x(n)的快速傅里叶变换，求得相应的X(K)。-Fast Fourier Transform (FFT) to achieve a given signal x (t) = sin (2πf0t), f0 = 50Hz, for x (t) with fs = 200Hz sampling, the sampling points is
Modeling-Rayleigh-fading-channel-based-on-modifie
- This Matlab Code models a Rayleigh fading channel using a modified Jakes channel model. A modified Jakes model chooses slightly different spacings for the scatterers and scales their waveforms using Walsh–Hadamard sequences to ensure zero cross-co
digital-signal-processing
- 实现一个数字信号处理的仿真系统 。要求具有界面并实现以下功能： 1）能产生（得到）并选择各种数字信号（sin、方波、三角波、语音、噪声及其叠加）； 2）具有DFT、DCT和小波变换和经典功率谱估计功能； 3）具有设计IIR和FIR低通、高通、带通滤波器功能； 4）能显示时域和频域波形，演示输入信号经过系统得到输出信号过程及频域特性和时间序列。 -Implement a simulation system of digital signal processing. It
hw4
- 这是图片处理的霍夫变换，通过ρ = x cos θ + y sin θ 来计算角度和位移，没有使用自带函数-This is a picture processing Hough transform, y sin θ by ρ = x cos θ+ to calculate the angle and displacement, not use its own function
Fourier-Transform
- 傅立叶变换（FT）将时间函数（信号）分解为构成它的频率，其方式类似于如何将音乐和弦表示为其组成音符的频率（或音调）。在这个排序库中，我将实现一个通用的傅立叶变换算法，对于>0个的常数a，b，...它能够分解函数f（x）=sin（2apix）+sin（2bpix）...。 作者 Fotios Kapotos-初始工作 这个项目是根据麻省理工学院的许可证授权的-参见LICENSE.md许可证文件以获取详细信息(The Fourier transform (FT) decomposes a f