登录
首页 » matlab » mimo-OFDM.rar

mimo-OFDM.rar

于 2014-08-06 发布 文件大小:9KB
0 183
下载积分: 1 下载次数: 9

代码说明:

  for mimo ofdm matlab code

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

发表评论

0 个回复

  • sztxcl
    冈萨雷斯的数字图像处理(matlab)第二版,中译本,非常实用的教材(Gonzalez, Digital Image Processing (matlab) second edition, in translation, very useful materials)
    2009-09-16 13:06:22下载
    积分:1
  • OFDM
    说明:  使用matlab对ofdm系统进行仿真和误比特率的分析(Ofdm systems using matlab on simulation and analysis of bit error rate)
    2010-04-25 10:41:00下载
    积分:1
  • zhuiganfa
    以前写的数值分析里的追赶法的代码,我自己看着是可用的(Previous numerical analysis method to write the code in the catch)
    2014-12-14 19:29:29下载
    积分:1
  • Car_Speed_Control
    汽车速度控制系统的设计和仿真(李雪仁,夏 洪)论文仿真部分 simulink汽车速度反馈控制系统 (car speed control simulink model)
    2021-03-19 16:39:19下载
    积分:1
  • Two-linkage-mechanism
    使用matlab的simulink工具箱,对平面二连杆机构进行动态仿真(Matlab dynamic simulation of Two-linkage mechanism)
    2014-01-12 19:53:19下载
    积分:1
  • SSC_1.0
    数据聚类方法最新方法——稀疏子空间聚类法SSC(SSC Matlab Code)
    2015-09-19 16:16:10下载
    积分:1
  • KBE
    KBE REGULATEUR DE SPEED
    2010-05-15 04:08:15下载
    积分:1
  • amplification-diminished-image
    采用matlab中的函数对图像进行放大缩小,缩小到原来的0.2倍,再放大到原来大小(Using matlab function image zoom, narrowed to 0.2 times, and then zoom to the original size)
    2012-11-26 19:17:41下载
    积分:1
  • meatuxingchuli
    这是一一一一一个基于图像平滑处理的程序,附代码(This is eleven thousand one hundred and eleven procedures based on image smoothing, with the code)
    2010-11-10 08:59:26下载
    积分:1
  • danchunxingfa
    单纯形法,求解线性规划问题的通用方法。单纯形是美国数学家G.B.丹齐克于1947年首先提出来的。它的理论根据是:线性规划问题的可行域是 n维向量空间Rn中的多面凸集,其最优值如果存在必在该凸集的某顶点处达到。顶点所对应的可行解称为基本可行解。单纯形法的基本思想是:先找出一个基本可行解,对它进行鉴别,看是否是最优解;若不是,则按照一定法则转换到另一改进的基本可行解,再鉴别;若仍不是,则再转换,按此重复进行。因基本可行解的个数有限,故经有限次转换必能得出问题的最优解。如果问题无最优解也可用此法判别。 (Simplex method, for solving linear programming problems common method. Simplex is the American mathematician GB Danzig in 1947 first put forward. Its theory is based on: linear programming problem feasible region is n-dimensional vector space Rn convex set in the multi-faceted, and its optimal value must be if the vertices of a convex set to achieve. Feasible solution corresponding to the vertex is called a basic feasible solution. The basic idea of the simplex method is: first find a basic feasible solution, to identify it and see whether it is the optimal solution If not, switch to another according to certain rules to improve the basic feasible solution, and then identify if still No, the re-conversion, click here to repeat. Due to the limited number of basic feasible solution, it will be converted by the finite optimal solution can be reached. If the problem can also be the optimal solution method has been applied without discrimination. )
    2011-01-17 21:01:44下载
    积分:1
  • 696518资源总数
  • 106148会员总数
  • 10今日下载