lpc2

1、系统仅处于训练状态。训练序列为2cos(2π×f1×n/fs)， 干扰为sin(2π×f2×n/fs)；序列长度为100个样点。 其中n=0…99，f1=1kHz，f2=2kHz，fs=8kHz。 2、采用LMS算法，均衡器输入为训练序列加上干扰，均衡器阶数为21阶，步长因子β=0.01。 3、在Matlab中编写浮点LMS算法，绘制均衡器的输出波形，并与训练序列进行对比。 (1, the system only in the training status. The training sequence is 2cos (2πf1n/fs), interference sin (2πf2n/fs) sequence length of 100 samples. Where n = 0 ... 99, f1 = 1kHz, f2 = 2kHz, fs = 8kHz. 2, using LMS algorithm, the input to the equalizer training sequence plus interference equalizer order is 21 bands, step factor β = 0.01. 3, the preparation of the floating-point LMS algorithm in Matlab, draw the output waveform equalizer, and with the training sequence comparison.)

序列Lloyd算法，对一个正弦信号数据进行标量量化(Sequence Lloyd algorithm, for a sinusoidal signal data Scalar quantization)

该程序是一纯滞后系统的大林控制算法，是一种不同于常规PID控制规律的新型算法。其控制效果大大优于普通PID控制算法。(that the procedure was a pure delay system Dalin control algorithm, Unlike a conventional PID control algorithm for the new law. Its effectiveness is significantly better than ordinary PID control algorithm.)

这是做SRP项目的一个蚁群算法的源代码的M文件，给大家看看，作为一个参考吧。(This is to do an ant colony algorithm SRP project source code for everyone to see it as a reference.)

MATLAB函数速查手册！方便新手学习matlab。(MATLAB function Quick Reference! Easy for novices to learn matlab.)

eqation 3 for mathmorph

说明：  遗传算法实现50维函数优化，代码简单易懂，适合初学者。(Genetic algorithm of 50-dimensional function optimization, code easy-to-read, suitable for beginners.)

Path-based HDR algorithm

全波形反演最速下降法，共轭梯度发matlab程序。仅供参考(Matlab conjugate gradient method)

旅行商问题（Travelling Salesman Problem, 简记TSP):假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 此处使用蚁群算法求解TSP问题(Suppose a business trip to visit n cities, he must choose the path to go, pass through the restriction is to visit each city only once, and finally go back to the original departure city. Path selection objective is to get the path distance to the minimum value among all paths.Here,we use the procedure of ant colony algorithm to work out the TSP.)