Hog_MatlabCode_2011

search in array by binary search

该工程实现2fsk的载频估计，返回2fsk两个载频估计结果。(The project is estimated to achieve 2fsk carrier frequency, return 2fsk two carrier frequency estimation results.)

这是一个好用的频偏估计算法的mmatlab仿真程序，谢谢使用。 (This is an easy to use Frequency Offset Estimation Algorithm mmatlab simulation program, and thank you to use.)

在WINDOWS环境下，使用MATLAB写的PCA代码，移植性好，对于做PCA的能方便使用！(In the WINDOWS environment, the use of PCA written in MATLAB code, portability, and for doing the PCA can easily use!)

Serial port communication for kwp 2000 fast initialization. this code is not complete. I am trying to develop it

说明：  matlab中关于信息融合中的DS论证程序，很好用的哦(matlab regarding information fusion DS demonstration program, the good oh)

卡尔曼滤波程序。实现多维卡尔曼滤波卡尔曼滤波程序。实现多维卡尔曼滤波(Kalman filter procedure.维卡尔曼realize multi-filter )

心电信号处理之 处理和扩展，ptt计算血压(ECG signal processing and handling of extensions, ptt calculate blood pressure)

数字语音处理及MATLAB仿真[张雪英][程序源代码](Digital audio processing and MATLAB simulation [ZhangXueYing] [source code])

说明：   有一个长度为整数L(1<=L<=10000)的马路，可以想象成数轴上长度为L的一个线段，起点是坐标原点，在每个整数坐标点有一棵树，即在0,1,2，...，L共L+1个位置上有L+1棵树。 现在要移走一些树，移走的树的区间用一对数字表示，如 100 200表示移走从100到200之间（包括端点）所有的树。 可能有M(1<=M<=100)个区间，区间之间可能有重叠。现在要求移走所有区间的树之后剩下的树的个数。 输入： 两个整数L(1<=L<=10000)和M(1<=M<=100)。 接下来有M组整数，每组有一对数字。 输出： 可能有多组输入数据，对于每组输入数据，输出一个数，表示移走所有区间的树之后剩下的树的个数。(Has a length of integer L (1 &lt = L &lt = 10000) of the road, one can imagine a number line segment of length L, the starting point is the coordinate origin, each integer coordinate points in a tree, i.e. 0,1 , 2, ..., L total has L+1 L+1 positions on the tree. Now to remove some trees, tree removed by a range of digitally represented, such as 100 200 represents removed (inclusive) between 100 and 200 all the trees. There may be M (1 &lt = M &lt = 100) intervals, there may be overlap between the intervals. Now, after the number of trees require the removal of all remaining sections of the tree. Input: two integer L (1 &lt = L &lt = 10000) and M (1 &lt = M &lt = 100). Then there is an integer M groups, each with a pair of numbers. Output: there may be multiple sets of input data, for each set of input data, the output of a number indicating the number of the removal of all remaining sections of the tree after tree.)