classical-algorithm-matlab-source

说明：  本程序来自TI公司网站原程序,其功能是通过传统的矢量控制算法来实现对永磁同步电机的控制,矢量控制采用双闭环结构，内环为电流环，外环为速度环，其速度的获得是靠滑模自适应算法求得。是一个不可多得无速度传感器矢量控制例程。控制程序可以采用.asm也可以采用.C。程序的具体算法和介绍在软件压缩包有详细介绍！ (this program from the company's Web site TI program, its function is through the traditional vector control algorithm to achieve the permanent magnet synchronous motor control, vector control double-loop structure for the inner loop current loop, velocity loop to the outer ring, the speed was on sliding mode is obtained adaptive algorithm. It is a rare speed sensorless vector control routines. Control procedures can be taken. Asm also be used. C. The specific procedures and the introduction of the algorithm compression software packages are described in detail!)

卡尔曼滤波的一个工具箱，包含了所需的函数，功能强大(Kalman filter a toolbox that contains the desired function, powerful)

support vector machine code for matlab

DWT of image using haar wavelet

一个火力目标分配的优化问题，matlab实现(A fire target allocation optimization problem)

matlab code and document for least square problem

图像Sift特征提取,由MATLAB和C混合编程完成。(Sift feature extraction, image performed by MATLAB and C programming. )

说明：  ldpc编译码综述，介绍了ldpc的发展的研究现状及各种编译码方法。(ldpc codec Summary)

TSP问题（又名：旅行商问题，货郎担问题）遗传算法通用matlab程序 D是距离矩阵，n为种群个数 参数a是中国31个城市的坐标 C为停止代数，遗传到第 C代时程序停止,C的具体取值视问题的规模和耗费的时间而定 m为适应值归一化淘汰加速指数,最好取为1,2,3,4,不宜太大 alpha为淘汰保护指数,可取为0~1之间任意小数,取1时关闭保护功能,建议取0.8~1.0之间的值 R为最短路径,Rlength为路径长度( TSP problem (also known as: traveling salesman problem, traveling salesman problem) genetic algorithm generic matlab program D is the distance matrix, n is the population number of parameters a C coordinates of the 31 cities to stop algebra, genetic to C on behalf of the program stops, the specific values ​ ​ of C depending on the size and time-consuming, m alpha for the fitness value of the normalized phase-out acceleration index, and is best taken as 1, 2, 3, 4, and not too much eliminated the protection index, it is desirable for any decimal between 0 and 1, taking 1:00 off the protective function, it is recommended to take a value between 0.8 to 1.0 R for the shortest path, Rlength for the path length)

MY AREA OF WORKING IS ON IMAGE WATERMARKING.. I WANT SOME HELP REGARDING THAT..