登录
首页 » matlab » 6methods

6methods

于 2010-05-26 发布 文件大小:22KB
0 183
下载积分: 1 下载次数: 108

代码说明:

  六种波束形成仿真 matlab代码仿真 喜欢的下 (Matlab code simulation six beamforming)

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

发表评论

0 个回复

  • Interactive.music.visualization
    Interactive music visualization
    2010-08-16 16:08:29下载
    积分:1
  • MATLAB-getrect
    matlab 鼠标从一幅图像中截取一个区域,并生成一幅图片(get a picture form a picture)
    2013-11-27 16:13:19下载
    积分:1
  • FCM-used-for-image-segmention
    基于FCM的图像分割算法,先对图像平滑,然后利用FCM对像素聚类,实现对图像的分割。(A methord based on FCM for image segmenting,firstly,using filter to smooth the image and the use the rule of FCM clustering pix finshing image segmention)
    2021-04-18 17:58:52下载
    积分:1
  • b.m
    Matlab仿真程序,介绍了数据的程序结构、运用和算法设计。(Matlab simulation program, introduced procedures for data structure, application and algorithm design.)
    2008-12-31 13:03:04下载
    积分:1
  • moeadmatlab
    最新的moea优化方法!一种解决大规模多目标复杂问题的优化算法!(The latest moea optimization method! A solution to the complex problem of large-scale multi-objective optimization algorithm!)
    2013-03-02 23:34:20下载
    积分:1
  • Microwave_Heating
    comsol mytihpysics最新版4.3a中射频模块中关于微波加热的源码(in the the comsol mytihpysics latest version 4.3a RF module microwave heating source)
    2013-04-27 14:49:02下载
    积分:1
  • shuzu
    数组元素互换Array element swap.(Array element swap)
    2014-01-28 09:51:32下载
    积分:1
  • Pitch_Control_Hydraulic_Testrig
    pitch controler in wind turbines
    2014-01-03 19:02:33下载
    积分:1
  • heart
    藏在代码里的小浪漫,给你爱的ta送上一个三维立体爱心,理科生的matlab表白神器(Give he or she that you love with a three-dimensional love)
    2021-02-14 11:59:48下载
    积分:1
  • maxcost
    “基于Floyd最短路算法的Ford和Fulkerson迭加算法”的最小费用最大流算法,其基本思路为:把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条自V1至Vn的最短路;再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流量增至最大可能值;而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新确定,如此多次迭代,最终得到最小费用最大流。 (" Floyd shortest path algorithm based on the Ford and Fulkerson algorithm superposition" of the minimum cost maximum flow algorithm, the basic idea is: the flow of each arc on the unit cost as a length, with Floyd for the most short-circuit method to determine a from V1 to Vn of the most short-circuit then this can be expanded as the shortest way, by solving the maximum flow of traffic on the way to its maximum possible value and this increased the flow of the shortest path, on which the arcs of the unit to re-determine the cost of traffic, so several iterations, finally get the minimum cost maximum flow.)
    2010-12-22 17:27:32下载
    积分:1
  • 696518资源总数
  • 105877会员总数
  • 14今日下载