-
MIMO
对多天线系统进行了系统的分析。多发射天线,多接收天线。(mimo system analysis)
- 2010-12-04 18:46:57下载
- 积分:1
-
he
说明: 自己编的MATLAB计算复杂潮流的程序,用的幅度和相角(Their series trend of the computational complexity of the program MATLAB)
- 2010-12-05 23:39:06下载
- 积分:1
-
boilerash
利用MATLAB中的神经网络模型对锅炉进行结渣预测(The use of MATLAB' s neural network model of the boiler slagging prediction)
- 2010-01-25 20:24:20下载
- 积分:1
-
FM_mod
频率调制和解调
频率调制是将消息信号的积分作为相位,也就是用消息信号去调制频率
( Of the frequency modulation and demodulation frequency modulation is the integral of a signal of the message as the phase, that is, with the message signal to the modulation frequency)
- 2012-10-14 23:51:00下载
- 积分:1
-
monte-carlo-yingyong
蒙特卡洛模拟方法与应用,介绍的比较全面很详细(Monte Carlo simulation methods and applications, described in detail a more comprehensive)
- 2011-05-16 22:07:09下载
- 积分:1
-
111
这是我自己编写的压缩感知图像重构的算法,用于学习,先稀疏,再观测系数,最后重建(This is your perception image compression algorithm used to study and review, thin, and observation of the reconstruction and
)
- 2010-06-03 19:36:00下载
- 积分:1
-
Two-dimensional-parity-check
说明: 数据通信中误码检测机制的研究,使用MATLAB对二维奇偶校验码进行测试(Studies of Error Detection Techniques in Data Communications,two-dimensional parity check is simulated through MATLAB)
- 2011-03-31 09:35:10下载
- 积分:1
-
df
说明: 这个资料是学习kalman滤波的基础材料,里面有程序和文档介绍,适合初学的童鞋(The attachment is the material for Kalman learning, especally for beginners.Hopefully, it will help)
- 2011-07-18 05:18:20下载
- 积分:1
-
varslect
用matlab写的可以在excle中输入变量,然后在matlab中做变量选择做一元和多元回归的程序,并可以画图表示结果。(Can write using matlab input variables in excle choose to do one yuan and multiple regression procedures, and then in matlab variables that the results and drawing.)
- 2012-06-29 21:41:56下载
- 积分: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