image_separation

一阶无限冲激响应低通滤波器和一阶无限冲激响应高通滤波器，用matlab计算并画出它们的增益响应(First order IIR low-pass filter and the first order IIR high-pass filter, using matlab to calculate and draw them gain response)

matlab code for digital modulations

斯坦福ply格式文件读取显示程序，用matlab写的，测试可用(Stanford ply format file to read the display program, written with matlab, the test can be used)

solution to nonlinear equations use secant method

some basic matlab function

programm of mfcc matlab parametrisation wav

时间序列分析中对于平稳时间序列建立模型，并实现模型的预测。(Time series analysis for stationary time series model, and the realization of the forecast model.)

说明：  分支定界法（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.)

提供了几种最小二乘法程序包括：批处理最小二乘参数估计，递推最小二乘参数估计，遗忘因子递推最小二乘参数估计，递推增广最小二乘参数估计。(Provides several least squares procedures include: Batch least squares parameter estimation, recursive least squares parameter estimation, forgetting factor recursive least squares parameter estimation, Recursive Extended Least Squares Parameter Estimation.)

k-means algorithm clustering