cordic

用matlab 实现各种算法，如burg算法，LMS算法，比较基础，适合初学者。(Using matlab implementation of various algorithms, such as burg algorithm, LMS algorithm, a comparative basis, suitable for beginners.)

It s about smart antenna. It can help you whatever it is.

code source on matlab for som

matlab基础教程，是我们学校和爱尔兰联合班的教程(Matlab based tutorial is a joint schools and classes Ireland Guide)

fuzzy logic control of speed DC Motor

两个函数都是用hopfield神经网络实现4位的A/D转换。采用不同的结构得到不同的结果(Parallel structure.)

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

param factory document factory, may not be null Source Code for Andriod.

matlab车牌识别程序的源程序，里面有实例可以参考。(matlab )

说明：  卡尔曼滤波仿真实例，内附word版实验报告(Kalman filter simulation, experimental version of the report containing a word)