9.1 简单房间回响模型

This is not my work but a function I use often. It is much faster than the conv2 function in matlab

DATA REGION is about matlab and OFDM

此代码是采用matlab编写的最优化算法，主要是对求解函数进行最优化分析，最终求出最优解。(This code is prepared using matlab optimization algorithm, the main function is to solve the optimization analysis, the final optimal solution obtained.)

convert directory of images to a movie in Matlab

阵列信号处理，自适应波束形成，Capon算法(array signal processing，adaptive beam forming，Capon)

说明：  分支定界法（branch and bound）是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划，还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法，选择不同的分支变量和子问题进行分支。 对于两个变量的整数规划问题，使用网格的方法有时更为简单。 [1] 通常，把全部可行解空间反复地分割为越来越小的子集，称为分支；并且对每个子集内的解集计算一个目标下界（对于最小值问题），这称为定界。在每次分枝后，凡是界限超出已知可行解集目标值的那些子集不再进一步分枝，这样，许多子集可不予考虑，这称剪枝。这就是分枝定界法的主要思路。(Branch and bound method is one of the most commonly used algorithms to solve integer programming problems. This method can solve not only pure integer programming but also mixed integer programming. Branch and bound algorithm is a method of search and iteration, which selects branches with different branch variables and sub problems. For integer programming problems with two variables, the grid method is sometimes simpler[ 1] Generally, all feasible solution spaces are divided into smaller and smaller subsets repeatedly, which is called bifurcation; And a lower bound of the objective (for the minimum value problem) is calculated for the solution set in each subset, which is called the bound. After each branch, those subsets whose bounds exceed the objective value of the known feasible solution set will not be further branched, so many subsets can not be considered, which is called pruning. This is the main idea of branch and bound method.)

a figure to m file converter

this code is solution of optimal control

matlab中文手册，很实用，很全面，适合初学者(matlab Chinese Manual, very practical, very comprehensive, suitable for beginners)

电力系统分析中有功功率的经济负荷分配的编程。(Economic load dispatch of power system analysis programming active power.)