登录
首页 » matlab » Rayleigh_fading

Rayleigh_fading

于 2009-02-14 发布 文件大小:1KB
0 77
下载积分: 1 下载次数: 10

代码说明:

  Rayleigh fading simulation

文件列表:

Rayleigh_fading.mht

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

发表评论

0 个回复

  • solveeqution
    使用matlab求解方程的小资料,简单易用。(Solving equations using matlab small information, easy to use.)
    2007-11-27 11:01:14下载
    积分:1
  • gatbx
    matlab计算程序 遗传算法中的一个例子 很值得学习(matlab genetic algorithm calculation of an example is worth studying)
    2008-08-04 00:13:22下载
    积分:1
  • delaysys
    système à retard PID
    2011-01-05 21:34:42下载
    积分:1
  • erciguihua
    用拉格朗日法求解等式约束的凸二次规划 用起作用集法求解不等式约束的凸二次规划 用路径跟踪法求解不等式约束的凸二次规划 (Lagrangian method for solving equality constraints convex quadratic programming work set method for solving inequality constraints convex quadratic programming path tracking method for solving inequality constraints convex quadratic programming)
    2013-03-10 18:25:13下载
    积分:1
  • ADC模型(simulink)
    说明:  pipeline ADC simulink
    2021-01-22 09:48:45下载
    积分:1
  • sensormanagement
    有关机载传感器管理、传感器资源分配的经典外文博士论文,很值得仔细读读哦。(On the airborne sensor management, sensor resource allocation classic foreign doctoral thesis, is worth reading carefully Oh.)
    2007-08-15 13:09:55下载
    积分:1
  • ddddd
    说明:  关于滤波器的源码 能够在MATLAB上运行(On the source filter can be run in MATLAB)
    2008-11-12 12:12:43下载
    积分:1
  • cMeansAlgorithm
    文中给出了人工鱼群算法的原理和详细描述,并对算法的收敛性能和算法中各参数对收敛性的影响等因素进行了分析 针对组合优化问题,给出了人工鱼群算法在其中的距离、邻域和中心等概念,并给出了算法在组合优化问题中的描述 针对大规模系统的优化问题,给出了基于分解协调思想的人工鱼群算法 给出了人工鱼群算法中常用的一些改进方法(The Analysis and ImProvement of Artifieial Fish-swarm algorithm)
    2011-12-07 22:22:36下载
    积分:1
  • DTW
    DTW算法的程序,申请两个n*m的矩阵D、d,分别为累积距离和帧匹配距离。这里n和m为测试模版与参考模版的帧数。然后通过一个循环计算两个模版的帧匹配距离d。接下来进行动态规划,为每个格点 (i,j)都计算其三个可能的前续格点的累积距离D1,D2,D3。考虑到边界问题,有些前续格点可能不存在,因此加入一些判断条件最后利用最小值函数min(),找到三个前续格点的累积 距离作为累积距离,与当前帧的匹配距离d(i,j)相加,作为当前格点的累积距离。该计算过程一直达到格点(n,m),并将D(n,m)输出,作为模版匹配的结果。(DTW algorithm procedures, apply two n* m matrix D, d, respectively, accumulated distance and frame matching distance. Where n and m is a reference test pattern and the template frames. Then through a loop to calculate two frames template matching distance d. Next, dynamic programming, for each grid point (i, j) are calculated from the cumulative D1 before the renewal of its three possible lattice point, D2, D3. Taking into account the boundary problem, some former continued grid point may not exist, so add some conditions to determine the final use of the minimum function min (), found three former continued accumulation of grid points cumulative distance as the distance from the current frame to match the d (i, j) added, and a current cumulative distance grid. This calculation has reached the grid (n, m), and D (n, m) output, as a result of template matching.)
    2014-05-05 14:30:21下载
    积分:1
  • pp14
    利用matlab计算14结点,对大家应该有帮助(Matlab calculated using 14 nodes, for all of us should have to help)
    2009-07-04 09:47:28下载
    积分:1
  • 696518资源总数
  • 104269会员总数
  • 42今日下载