登录
首页 » matlab » uniform_grating_myself

uniform_grating_myself

于 2016-01-11 发布 文件大小:1KB
0 230
下载积分: 1 下载次数: 6

代码说明:

  程序模拟了均匀光栅的反射谱特性、色散特性和时延特性(Program to simulate the reflection spectrum in uniform grating dispersion characteristics and delay characteristics)

文件列表:

uniform_grating_myself.m,2187,2016-01-07

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

发表评论

0 个回复

  • 6Pmethods
    自适应波束形成多种算法的matlab实现,算法类型:MVDR,LCEC,GSC,PCI,MWF,PCA-MVB,SC-MVB,EC(A variety of adaptive beamforming algorithm matlab implementation, the algorithm type: MVDR, LCEC, GSC, PCI, MWF, PCA-MVB, SC-MVB, EC)
    2011-05-09 15:11:59下载
    积分:1
  • muthukumar
    fingerprint autneication
    2012-04-22 15:15:49下载
    积分:1
  • sagar
    for trainng the data.....
    2010-06-09 19:18:10下载
    积分:1
  • 学习matlab的好教程-mfiles
    同上,学习matlab的好教程,呵呵,大家不要骂我亚(ibid., Matlab good learning guides, huh, I do not criticize Asia)
    2005-04-13 20:28:33下载
    积分:1
  • pandi
    激光谐振腔自再现模的计算机模拟,matlab平台,可以实现矩形腔,条性腔的模拟(Laser resonator mode from the reproduction of computer simulation)
    2011-06-06 13:47:08下载
    积分:1
  • Multicomponent-Signals-
    多重非平稳信号的瞬时频率估计,用时频的方法,比较新的英文文献。(Instantaneous frequency estimation of multiple non-stationary signals using time-frequency methods, the new English literature.)
    2013-03-21 13:07:47下载
    积分:1
  • divide
    对区间进行分段的一个功能函数接口需自己调整.(The interval of a function interface segments need to own adjustment. )
    2014-12-09 10:38:07下载
    积分:1
  • nc_tanker
    Neural control (reinforcement learning) for tanker heading
    2010-01-12 02:47:07下载
    积分:1
  • HEFT
    HEFT code in matlab (Heterogeneous Earliest-Finish-Time)
    2020-12-14 12:29:16下载
    积分:1
  • dijikstra
    For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).
    2012-04-12 21:01:48下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载