rls_AR_pred

台湾人写的GFSK调制和解调，非常清晰，便于学习(Taiwanese write GFSK modulation and demodulation, very clear, easy to learn)

粒子群算法的MATLAB源码，代码运行平台为Tc 3.0 ，对研究粒子群算法问题的朋友较有参考意义。(Particle Swarm MATLAB source code for the operating platform Tc 3.0, the study of particle swarm optimization Friends of the problem than there is reference value.)

进行盲源分离,我已经进行验证了，真的很好用，而且功能很强大，很实用。(blind source separation)

经PPM调制的超宽带信号经高斯白噪声信道的系统仿真,给出了时域和频域图(Modulated by the PPM UWB signal by Gaussian white noise channel of system simulation, given the time and frequency domain map)

Orbit diagram of lyapunov exponent for logistic map

data mining algorithm

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.)

Signal And System Lab_2

利用MATLAB来实现离散傅里叶变换和离散傅里叶逆变换，N为离散傅里叶变换长度，形式为xk=IDFT（xn，N）(To achieve the discrete Fu Liye transform and discrete Fu Liye transform by using MATLAB, N as the discrete Fu Liye transform length, form xk=IDFT (xn, N))

采用压缩感知的方法，结合信号的小波树模型，对一维信号进行压缩重构。(Using Compressed sensing methods, combined with wavelet tree model of the signal, achieve the goal of the one-dimensional signal compression and reconstruction.)