matlab

使用二边逐次修正法来求解TSP（旅行商问题）问题的较有解，同时可以控制迭代求解的次数(Successive correction method using the two sides to solve TSP (TSP) problem than a solution, while controlling the number of iterative solution)

本书以MATLAB R2010a为编写基础，系统讲解MATLAB基本环境和操作要旨；分章阐述符号计算、数值计算、计算结果可视化及编程精要；选例展现MATLAB精华工具SIMULINK的功能级和元器件级仿真能力；范例剖析MATLAB版面编辑器的用法和图形用户界面的制作要领；简扼勾画MATLAB和WORD集成一体的Notebook环境(This book introduce MATLAB R2010a to explain the basic MATLAB environment and operating system sub-chapter on symbolic computation, numerical calculation results visualization and programming essentials and selecte cases to show the essence of tool SIMULINK of MATLAB functional level and component-level simulation capacity)

一个简单易懂的扩展卡尔曼程序，跟踪的是一个二维空间的非线性运动目标(An easy-to-understand program extended Kalman tracking is a two-dimensional nonlinear moving target)

Cyranose@320便携式电子鼻的检测数据,对象是中药材.在MATLAB上进上气味指纹图谱的分析,其4品种的中药材.结果表明其能将其完全分类.(Cyranose @ 320 portable electronic nose detection data, is of Chinese herbal medicines. In progress on MATLAB odor fingerprint analysis, the 4 species of Chinese herbal medicines. The results show that its able to complete classification.)

music algorith easy to algorithm

信源函数 randerr 产生比特误差样本 randint 产生均匀分布的随机整数矩阵 randsrc 根据给定的数字表产生随机矩阵 wgn 产生高斯白噪声 信号分析函数 biterr 计算比特误差数和比特误差率 eyediagram 绘制眼图 scatterplot 绘制分布图 symerr 计算符号误差数和符号误差率 信源编码 compand mu律/A律 压缩/扩张 dpcmdeco DPCM（差分脉冲编码调制）解码 dpcmenco DPCM编码 dpcmopt 优化DPCM参数 lloyds Lloyd法则优化量化器参数 quantiz 给出量化后的级和输出值 误差控制编码 bchpoly 给出二进制BCH码的性能参数和产生多项式 convenc 产生卷积码 cyclgen 产生循环码的奇偶校验阵和生成矩阵 cyclpoly 产生循环码的生成多项式 decode 分组码解码器 encode 分组码编码器 gen2par 将奇偶校验阵和生成矩阵互相转换 gfweight 计算线性分组码的最小距离 hammgen 产生汉明码的奇偶校验阵和生成矩阵 rsdecof 对Reed-Solomon编码的ASCII文件解码(#include <math.h> #include <stdio.h> #include <stdlib.h> #include <ctype.h> #include <float.h> #include <string.h> #include <stdarg.h> #include "svm.h" )

说明：  此源码为多变异位遗传算法，具有执行效率高、效果好的特点。(This source is variable ectopic genetic algorithm, with the implementation of high efficiency, good effect.)

Freq Shift Keying simulation in matlab

Dijkstra通用算法，最近一段时间一直在搞图论的相关算法，发现Dijkstra是一个很好的单元最短路径算法，此程序很短，非常适合学习(Generic Dijkstra algorithm, the most recent period has been engaged in graph theory algorithms, Dijkstra is a good unit the shortest path algorithm, this procedure is very short, very suitable for learning)

无约束问题最优化方法的核心问题是选择搜索方向。 以正定二次函数为例，来观察两个方向关于矩阵Ａ共轭的几何意义(Unconstrained optimization problems are most core issue is to choose the search direction. In definite quadratic function, for example, to observe both directions on the matrix A conjugate geometric meaning)