登录
首页 » matlab » simulink-introduction

simulink-introduction

于 2011-12-29 发布 文件大小:984KB
0 216
下载积分: 1 下载次数: 3

代码说明:

  simulink 入门教程,的一些资料,帮助初学者快速了解matlab中的simulink (Simulink how-to tutorials, some of the material, help beginners a rapid understanding of simulink matlab)

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

发表评论

0 个回复

  • PSNR
    求解两幅压缩前后图片A和B之间的峰值信噪比(To find the PSNR (peak signal-to-noise ratio) between two intensity images A and B, each having values in the interval[0,1]. The answer is in decibels (dB).)
    2010-05-06 15:46:30下载
    积分:1
  • b1e1010c8ef5
    matlab仿真软件和解析法来计算一维光子晶体带隙(matlab simulation software and analytic method to calculate the one-dimensional photonic crystal band gap)
    2012-11-25 22:56:20下载
    积分:1
  • cooperative-communicaion
    协同通信信道保密容量与功率分配因子的关系matlab仿真程序(secrecy capacity for cooperative communication)
    2011-11-16 21:05:46下载
    积分:1
  • AddNoise_A
    用于添加噪声,达到去噪的目的.原始数据如果不太理想,去噪是常用的处理方法(Used to add noise to achieve the purpose of de-noising. If the original data is not ideal, de-noising is a common treatment method)
    2014-12-17 09:33:55下载
    积分:1
  • gammatone_filterbank
    模拟人耳听觉系统的gammatone滤波器组(Simulate the human auditory system gammatone filter banks)
    2020-11-26 22:29:31下载
    积分:1
  • 地震褶积模型 convz
    褶积模型,褶积运算,地震褶积模型,反射系数与子波褶积运算(Convolution model, convolution operation, the seismic convolution model, reflection coefficient and wavelet convolution operation)
    2016-05-15 15:12:45下载
    积分:1
  • BPSK_Hamming
    BPSK 加上了(7,4)汉民编码,误比特率统计(BPSK with the (7,4) Han coding, bit error rate statistics)
    2010-12-30 21:19:58下载
    积分:1
  • MATLAB
    时间序列在MATLAB中的应用以及使用说明(Time series in MATLAB applications and instructions for use)
    2015-01-23 20:21:06下载
    积分: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
  • splitmerge559.m
    a function to perform simple split-merge segmentation
    2014-11-18 03:31:53下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载