ndCVP-HGPSO

数据辅助的载波相位跟踪，在第n个接收符号的DFT之后，导引子载波等于信道频率响应和已知符号的乘积根据余下的频率误差旋转以后的结果。(Data-aided carrier phase tracking in the first n months after receiving DFT symbols, guided subcarriers equivalent channel frequency response and known symbol of the product in accordance with rotation frequency error remaining after the results.)

Antenna and EM Modeling with MATLAB - Sergey N. Makarov (.m Files).rar(Antenna and EM Modeling with MATLAB- Sergey N. Makarov (.m Files).rar)

matlab book good book

需将图形文件复制到D盘根目录，或修改程序中的相关文件的路径。 计算机运行可能会出现这样的警告：Warning: Function call WAVEDEC2 invokes inexact match F:Matlab oolboxwaveletwaveletwavedec2.m. > In Wnn0802 at 18 无妨，没关系的，不影响运算结果。(Need to copy files to the D graphics root directory, or modify the program in the path of the relevant documents. Computer running such a warning might appear: Warning: Function call WAVEDEC2 invokes inexact match F: Matlab toolbox wavelet wavelet wavedec2.m> In Wnn0802 at 18 anyway, it does not matter, does not affect the result of the operation.)

sample coding for the matlba

卡尔曼滤波器在GPS导航中的一些应用，包括滤波算法和一些误差分析(Kalman filter in GPS navigation in a number of applications, including filtering algorithms and error analysis of some)

说明：  是基于超扭曲算法的直接转矩控制 基于论文Super-Twisting Sliding Mode Control of Torque and Flux in Permanent Magnet Synchronous Machine Drives(Direct Torque Control Based on Hyper-distortion Algorithms Super-Twisting Sliding Mode Control of Torque and Flux in Permanent Magnet Synchronous Machine Drives)

说明：  双环控制，直流母线电压外环，电感电流内环预测控制，3kW光伏并网系统，无升压电路，增量电导法，逆变桥控制最大功率追踪，亲测可用。(DC bus voltage outer loop, inductance current inner loop, 3KW photovoltaic grid connected system, no boost circuit, incremental conductance method, inverter bridge control maximum power tracking, available for pro test.)

《数据挖掘新方法-支持向量机》支持向量机入门教程，介绍了回归、分类、核等问题(《Support Vector Machine》the course of the SVM,the problem of regression ,recognition, core is introduced here. )

说明：  利用蚁群算法求解tsp（旅行商）问题，给出遍历方案，最后求出最短路径。(Ant colony algorithm for tsp (TSP) problem, given traversal solutions, and finally find the shortest path.)