Digitalmodulation

几种改进的粒子群算法（PSO），可用来学习算法的编程，以及算法之间的对比等等。(Several improved particle swarm optimization (PSO), can be used to learn programming algorithms, as well as contrast between algorithms and so on.)

The best book I have been seeing for Sound and using digital signal processing

图像频域滤波，用matlab实现了在图像频域中通过Butterworth陷波器消除周期性噪声干扰信号。(Image frequency domain filtering using matlab achieved in the frequency domain image by Butterworth notch filter to eliminate periodic noise signal.)

Article about Estimating Optimal Tracking FIlter

针对感应电机扩展卡尔曼滤波器转速估计中难以取得卡尔曼滤波器系统噪声矩阵和测量噪声矩阵最优值的问题，提出了一种基于改进粒子群算法优化的扩展卡尔曼滤波器转速估计方法。算法通过融合遗传算法和粒子群算法的优点，采用可调整的算法模型对粒子群算法进行改进，将改进的粒子群算法对扩展卡尔曼滤波器中的系统噪声矩阵和测量噪声矩阵进行优化处理，将优化后的卡尔曼滤波器应用于感应电机转速估计。( Extended Kalman Filter for induction motor speed estimation problem is difficult to obtain a Kalman filter system noise matrix and the measurement noise matrix optimal value proposed speed estimation method based on improved particle swarm optimization of the extended Kalman filter. By virtue of the genetic algorithm and particle swarm optimization algorithm fusion algorithm using the adjustable model PSO improvements that will improve the PSO extended Kalman filter system noise matrix and the measurement noise matrix optimization process, the optimized Kalman filter is applied to the induction motor speed estimate.)

说明：  扩展卡尔曼滤波算法锂离子电池SOC估计中有较广泛的应用，其精度高，鲁棒性好，算法简单(The extended Kalman filtering algorithm has a wide range of applications in SOC estimation of lithium-ion batteries, with high accuracy, good robustness, and simple algorithm)

模糊PID控制程序，这是毕业设计学生做的，可运行。(Immune genetic algorithm source code, which is a hybrid intelligent algorithm, good resources.)

说明：  打包做好界面的GS算法程序，欢迎大家借鉴(Packing the GS algorithm program of the interface, we welcome you to learn from it.)

选择映射降低OFDM系统中PAPR的论文(Select map PAPR reduction in OFDM systems papers)

int compare(const char* a, const char* b, int size) { for (int i = 0 i < size i ++) { if (a[i] != b[i]) { return i } } return -1 } (int compare(const char* a, const char* b, int size) { for (int i = 0 i < size i++) { if (a[i] != b[i]) { return i } } return-1 } )