forstner

黄锷院士的EMD/EEMD程序，可实现EMD/EEMD 计算(Wong Ngok academicians EMD/EEMD procedure can achieve EMD/EEMD calculation)

DSP编程,c语言和matlab常用算法 (DSP programming, c language and Matlab algorithms)

机器人上楼梯的杆状模型程序，展示机器人上楼的动作示例过程(Rod-shaped robot model program on the stairs, showing an example of the process of the robot moves upstairs)

三种语音增强算法的源程序，可以播放处理前后的语音，谱相减法，滤波器法及最小均方误差法(Three speech enhancement algorithm of the source can be played before and after voice spectral subtraction filter method and the minimum mean square error method)

运用盲均衡cma算法来实现源信号的恢复，效果明显4QAM(cma test blind equalization)

IMM算法的matlab仿真代码 关键词：交互式多模型 马尔科夫转移矩阵(IMM algorithm matlab simulation code Keywords: interactive multiple model Markov transition matrix)

one time pad encryption code in MATLAB and matrix transpose in visual basic

包括了粒子滤波，无忌卡尔曼粒子滤波，以及他们的之间的比较！！(Including the particle filter loudly Kalman particle filter, and compare them between! !)

旅行商问题，即TSP问题（Travelling Salesman Problem）又译为旅行推销员问题、货郎担问题，是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路径的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。(Traveling Salesman Problem, or TSP problem (Travelling Salesman Problem) also translated as the traveling salesman problem, traveling salesman problem is one of the well-known problems in the field of mathematics. Suppose you have a travel business to visit n cities, he must choose which path to go, limiting the path is to visit each city only once, and the last to return to the original departure city. Select the destination path is the requirement for the minimum distance path was among all paths.)

taylor分布的天线综合代码，基于原始的指数方程编写，并且附加了相位项，可以用来优化综合。(taylor antenna integrated code distribution, exponential equations based on the original writing, and an additional phase term can be used to optimize the synthesis.)