登录
首页 » matlab » mimo_ofdm_matlab

mimo_ofdm_matlab

于 2013-01-24 发布 文件大小:2KB
0 230
下载积分: 1 下载次数: 34

代码说明:

  这个仿真程序用于实现MIMO-OFDM系统容量仿真,分析了MIMO算法的性能。(This simulation program is used to implement the system capacity of MIMO-OFDM simulation program.)

文件列表:

mimo_ofdm_matlab.txt,6138,2013-01-24

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

发表评论

0 个回复

  • JuanCarlosPSCE11
    a paper about the wind turbines psat simulation and good
    2013-07-14 23:19:28下载
    积分:1
  • getstart
    matlab的一款比较好的教程,大家好好看,希望对大家有所帮助。(matlab' s a good tutorial, we take look at, we want to help.)
    2012-06-08 00:18:22下载
    积分:1
  • Three-Ortogonal-Planes-(LPQ-TOP)
    spatio-temporal Local Phase Quantization Three Ortogonal Planes (LPQ-TOP)
    2011-10-25 16:29:52下载
    积分:1
  • Improving compact gravity inversions
    Improving compact gravity inversion using new weighting functions
    2018-01-06 21:29:21下载
    积分:1
  • signalgenration
    signal generation using matlab
    2013-07-30 21:55:53下载
    积分:1
  • 36989166Matlab
    说明:  hslogic算法仿真,基于MATLAB的TSP算法的优化仿真与性能分析(Hslogic algorithm simulation, optimization simulation and performance analysis of TSP algorithm based on MATLAB)
    2020-06-22 02:40:01下载
    积分:1
  • 分支定界法
    说明:  分支定界法(branch and bound)是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划,还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法,选择不同的分支变量和子问题进行分支。 对于两个变量的整数规划问题,使用网格的方法有时更为简单。 [1] 通常,把全部可行解空间反复地分割为越来越小的子集,称为分支;并且对每个子集内的解集计算一个目标下界(对于最小值问题),这称为定界。在每次分枝后,凡是界限超出已知可行解集目标值的那些子集不再进一步分枝,这样,许多子集可不予考虑,这称剪枝。这就是分枝定界法的主要思路。(Branch and bound method is one of the most commonly used algorithms to solve integer programming problems. This method can solve not only pure integer programming but also mixed integer programming. Branch and bound algorithm is a method of search and iteration, which selects branches with different branch variables and sub problems. For integer programming problems with two variables, the grid method is sometimes simpler[ 1] Generally, all feasible solution spaces are divided into smaller and smaller subsets repeatedly, which is called bifurcation; And a lower bound of the objective (for the minimum value problem) is calculated for the solution set in each subset, which is called the bound. After each branch, those subsets whose bounds exceed the objective value of the known feasible solution set will not be further branched, so many subsets can not be considered, which is called pruning. This is the main idea of branch and bound method.)
    2021-04-26 12:21:14下载
    积分:1
  • robustdesign
    全面系统地给出鲁棒设计的源程序及运算实例,希望对研究鲁棒的有所帮助(Comprehensively and systematically given robust design and operator of the source code examples, I hope the study will help Robust)
    2008-05-01 01:04:50下载
    积分:1
  • 3D_TDOA_Kalman
    三维TDOA_AOA定位的扩展卡尔曼滤波仿真主程序(3D TDOA_AOA positioning the extended Kalman filter simulation main program)
    2012-04-09 20:37:04下载
    积分:1
  • matlab-code-pi-calculation
    The number π is a mathematical constant that is the ratio of a circle s circumference to its diameter and is approximately equal to 3.14159. It has been represented by the Greek letter "π" since the mid-18th century, though it is also sometimes romanized as "pi
    2013-12-30 00:35:55下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载