demodulators

演化博弈的仿真程序，非常实用的程序，可以画相位图(evolutional game modeling)

针对基本无线传感器网络DV-Hop定位算法中，计算平均跳距时产生偏小误差的原因，提出了基于平均跳距修正的DV-Hop算法。改进算法中，引入信标节点个数比例、所有信标节点平均跳距的最大值以及所有信标节点平均跳距的平均值三个因子，并采用它们对平均跳距进行修正。通过Matlab软件对算法进行仿真验证，结果表明，改进后的 DV-Hop 算法有效降低了未知节点的定位误差，是一种可行的无线传感器网络节点定位解决方案。(DV-Hop localization algorithm for wireless sensor networks, we calculate the average hop distance small error of reasons, raised the DV-Hop algorithm based on the average hop distance correction. Improved algorithm, the proportion of the number of nodes, the introduction of beacons, the beacon node average maximum jump distance as well as all the beacon nodes average jump from the average of three factors, and their average hop distance correction. Matlab software simulation results show that the improved DV-Hop algorithm effectively reduce the unknown node positioning error, the solution is a viable wireless sensor network node positioning algorithm.)

共三个文件，以子函数调用的形式，分别实现了Capon的基本算法以及改进的MVDR算法(Of the three files, subroutine calls in the form of, respectively, to achieve the basic algorithm of Capon and improved MVDR algorithm)

量子遗传算法的源程序，很实用，很经典，适合入门 (Quantum genetic algorithm source code, very practical, very classic, suitable for entry)

Jacobi迭 代 法, 用于方程求根 matlab(Jacobi Iterative)

说明：  采用栅格对机器人的工作空间进行划分，再利用优化算法对机器人路径优化，是采用智能算法求最优路径的一个经典问题。目前，采用蚁群算法在栅格地图上进行路径优化取得比较好的效果，而利用遗传算法在栅格地图上进行路径优化在算法显得更加难以实现。 利用遗传算法处理栅格地图的机器人路径规划的难点主要包括：1保证路径不间断，2保证路径不穿过障碍。 用遗传算法解决优化问题时的步骤是固定的，就是种群初始化，选择，交叉，变异，适应度计算这样，那么下面我就说一下遗传算法求栅格地图中机器人路径规划在每个步骤的问题、难点以及解决办法。(It is a classical problem to divide the workspace of the robot by grids and optimize the path of the robot by using optimization algorithm. At present, the ant colony algorithm is used to optimize the path on the grid map, and the genetic algorithm is used to optimize the path on the grid map, which is more difficult to achieve. The difficulties of using genetic algorithm to deal with the path planning of robot on raster map mainly include: 1. guaranteeing that the path is uninterrupted, 2. guaranteeing that the path does not cross obstacles. The steps of genetic algorithm in solving optimization problems are fixed, that is, population initialization, selection, crossover, mutation, fitness calculation. Then I will talk about the problems, difficulties and solutions of genetic algorithm in each step of robot path planning in raster map.)

基于MATLAB的，交互式多模型算法卡尔曼滤波仿真代码(MATLAB-based, interactive multiple model algorithm for Kalman Filter Simulation Code)

经典DSP书籍，最新的第二版。chm格式，非常清晰。(classic books, the latest version of the second. Chm format, very clear.)

可用于IEEE802.16标准下ldoc码的性能分析(Can be used for performance analysis of IEEE802.16 standard ldoc code )

自己刚开始接触混沌方面，自己编写的一个利用Matlab画混沌系统的混沌吸引子的M程序，希望对哪些刚开始学习混沌的学者有所帮助。(Chaos has just started their own contacts, the preparation of their own paintings of a chaotic system using Matlab chaotic attractor of the M program, in the hope that what has just started to learn the academics of chaos help.)