登录
首页 » matlab » smart--antenna

smart--antenna

于 2015-01-08 发布 文件大小:83KB
0 308
下载积分: 1 下载次数: 47

代码说明:

  关于智能天线的一些MATLAB仿真源程序,详细讲述了波束成形、波达方向以及LMS算法、LS算法等仿真程序,具有通俗易懂,便于修改调试等特点(About Smart Antenna some MATLAB simulation source code, a detailed account of beamforming, direction of arrival and the LMS algorithm, LS algorithm simulation program, with user-friendly, easy to modify debugging features)

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

发表评论

0 个回复

  • correlation
    二元天线阵在矩形巷道中接收信号的相关性的matlab仿真(Element antenna array in a rectangular tunnel in the received signal correlation matlab simulation)
    2011-06-30 03:08:44下载
    积分:1
  • 432
    THEY ARA MAAY EXEMPLE OF THS ARTICLE BUT THIS ARTICLE CONTIENNT SO MANY INNFFORMATON ABOUT MOSFET
    2015-04-06 00:50:14下载
    积分:1
  • tp2expo
    exponnentiel law with matlab
    2011-05-16 03:25:46下载
    积分:1
  • MATLAB-GUI-based-filter
    基于MATLAB GUI的“滤波器设计软件”设计(MATLAB GUI-based filter design software design)
    2012-07-08 16:18:44下载
    积分:1
  • fft
    全球导航系统中,软件接收机基带处理部分的捕获电路的算法仿真(FFT acquisition )
    2013-03-28 10:17:48下载
    积分:1
  • 009
    设置matlab GUI中,table对象不同单元格的设置matlab GUI中,table对象不同单元格的颜色和 各个单元格字体颜色的方法,综合了matlab和html (the method to setting table s unit color and font color of the matlab GUI,with the help of matlab and html)
    2013-10-28 16:45:18下载
    积分:1
  • IEEE14
    IEEE14潮流计算 牛拉法 直角坐标形式 (The IEEE14 node power flow calculation cattle Rafah rectangular coordinate form)
    2020-07-03 02:40:01下载
    积分:1
  • chengxuheshuzu[2]
    MATLAB高效编程程序源代码 第二部分(failed to translate)
    2013-05-08 21:15:58下载
    积分:1
  • LatticeAmePut
    美式看跌期权二叉树算法的matlab程序实现方式m文件(American put option binary tree algorithm)
    2013-05-14 14:44:58下载
    积分: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
  • 696516资源总数
  • 106914会员总数
  • 0今日下载