登录
首页 » matlab » MATLABLearningMaterial

MATLABLearningMaterial

于 2013-09-16 发布 文件大小:6169KB
0 239
下载积分: 1 下载次数: 2

代码说明:

  这个学习matlab的一个教程,主要内容是学习如何进行通信系统的仿真(This learning matlab tutorial, the main content is to learn how to communicate with system simulation)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • MATLAB_example
    简单的小程序实现不同的功能,均应用基本函数实现,均是入门级程序,内附注释和说明,放心下载(Simple little program to achieve different functions, are applied to achieve the basic functions are all entry-level program, containing notes and instructions, ease download)
    2010-12-15 15:27:47下载
    积分:1
  • fwfangzhen
    永磁同步电机加减速控制,电控部分,飞轮储能(Permanent magnet synchronous motor rotor acceleration and deceleration control)
    2019-04-09 14:24:02下载
    积分:1
  • ACOBP
    用蚁群算法优化BP神经网络,然后用于预测,非常实用,适合初学者。(This is the aco-bp code in matlab)
    2021-02-26 00:59:37下载
    积分:1
  • learnMatlab6
    让你熟悉matlab六的具体用法操作,从初学者到入门的好的教材(You are familiar with the specific use matlab 6 operation, from beginners to get into good teaching materials)
    2010-08-21 22:29:50下载
    积分:1
  • abs_smc
    Simulink block diagram of simple Antilock Braking System control
    2013-02-27 17:38:01下载
    积分:1
  • lyapunov
    用来计算Lyapunov图的源程序,只需要改变微分方程即可直接引用(Used to calculate the Lyapunov map source, only need to change the differential equations can be directly referenced)
    2013-03-06 21:08:57下载
    积分:1
  • TS_TSP
    matlab程序编写 利用禁忌算法实现选择性拆卸序列规划(matlab code disassembly sequence planning based on tabu algorism)
    2015-04-22 11:04:04下载
    积分:1
  • supclust
    减法聚类的matlab程序,是学习模糊聚类的好东西(Subtractive clustering of Matlab procedures, is a good thing to learn fuzzy clustering)
    2020-09-25 17:07:48下载
    积分: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
  • rsfigures
    rs figure....
    2012-01-28 19:04:00下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载