galois

正交扩频码ooc的matlab代码。五个用户情况(Orthogonal spreading code of the matlab code for ooc. Five users of)

说明：   有一个长度为整数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.)

说明：  ofdm仿真的入门代码，对初学者来说很有用的(entry-OFDM simulation code, for example very useful for beginners)

语音方面的工具箱，里面包含了很多语音的基础函数如分帧函数等等(Voice in the toolbox, which contains a lot of voice-based functions such as sub-frame function, etc., etc.)

This code is used for calculate the laplacian mean square error

肌电假肢控制中的表面肌电信号的研究进展与展望(Progress and Prospects of myoelectric prosthetic control of surface electromyography)

C++ Primer Plus, 作者 Stephen Prata 版本6ed, AW, 年份 2012 C++初级学者用书(C++ Primer Plus, Stephen Prata, 6ed, AW, 2012 C++ junior scholars books)

关于指纹识别的一些利用matlab进行图像预处理的源程序(Some of the use of fingerprint matlab source code for image preprocessing)

用MATLAB编程，实现加减乘除运算器的功能(MATLAB programming, the functions of addition, subtraction arithmetic unit)

RRT 的思想是快速扩张一群像树一样的路径以探索（填充）空间的大部分区域，伺机找到可行的路径。(The idea of RRT is to rapidly expand a group of tree-like paths to explore (fill) most areas of space, waiting for the opportunity to find feasible paths.)