-
fir_windows
In signal processing, a window function (also known as an apodization function or tapering function[1]) is a mathematical function that is zero-valued outside of some chosen interval. For instance, a function that is constant inside the interval and zero elsewhere is called a rectangular window, which describes the shape of its graphical representation. When another function or waveform/data-sequence is multiplied by a window function, the product is also zero-valued outside the interval: all that is left is the part where they overlap, the view through the window .
- 2015-03-14 16:09:42下载
- 积分：1
-
svmtrain
svm的样本训练代码，用于分类样本数据并进行数值预测的程序(The sample program svm training program, sample data for classification and numerical prediction)
- 2017-01-04 14:51:57下载
- 积分：1
-
ocr_Stroke
处理文字得到笔画,内有实验图片，实验阶段，可以运行，环境matlab2009a(Word processing to get strokes, there are experimental pictures, the experimental stage, you can run, environmental matlab2009a)
- 2014-08-25 13:13:50下载
- 积分：1
-
Final-Coding
ebcot algorith with arithmetic coding
- 2014-02-25 15:10:21下载
- 积分：1
-
matlab.doc
谐波的定义
谐波的产生谐波的危害谐波的测量谐波抑制的方法课题分析课题来源(The definition of harmonic harmonic harmonic hazards arising from the measurement of harmonic harmonic suppression method of subject analysis of the subject sources)
- 2009-03-03 17:22:31下载
- 积分：1
-
tutorial1
tutorial for matlab for image processing tool kit in power point presentation file
- 2010-12-17 23:03:41下载
- 积分：1
-
pll_matlab[1]
课程设计做的PLL，里面有关线性和非线性的都有，大家可以(O 课程 设 计 的 PLL, 里面 Tang 关 Cave Cave性和非性的都 Tang, 大家可 Luk)
- 2007-08-22 18:03:30下载
- 积分：1
-
firfil
说明： 数字滤波设计，包括有限冲击响应和无限冲击响应滤波器设计(digital filter design, including finite impulse response and infinite impulse response filter design)
- 2006-02-15 21:45:13下载
- 积分：1
-
Dijkstra
说明： 最短路径的Dijkstra算法程序。Dijkstra算法是典型最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低。
Dijkstra算法是很有代表性的最短路算法，在很多专业课程中都作为基本内容有详细的介绍，如数据结构，图论，运筹学等等。
(The Dijkstra shortest path algorithm for the procedure. Dijkstra algorithm is a typical shortest path algorithm, used to calculate a node to all other nodes of the shortest path. The main characteristics is the starting point as the center outward expansion layers, until the end date be extended to. Dijkstra shortest path algorithm can arrive at the optimal solution, but because of its calculation of the node traversal, so inefficient. Dijkstra algorithm is very representative of the shortest path algorithm, in many professional courses in the basic content as described in detail, such as data structures, graph theory, operational research and so on.)
- 2008-11-26 22:27:45下载
- 积分：1
-
linear-camera-calibration
using the perspective projection to obtained my algorithm
- 2013-01-04 07:06:14下载
- 积分：1
