登录
首页 » matlab » multiuser

multiuser

于 2020-11-07 发布 文件大小:1KB
0 182
下载积分: 1 下载次数: 0

代码说明:

说明:  基于子空间的盲多用户检测,matlab仿真例程(Subspace-based blind multiuser detection, matlab simulation routines)

文件列表:

multiuser.m

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

发表评论

0 个回复

  • viterbi
    viterbi译码算法,可以对卷积码进行解码。通信类的朋友知道的。。。(viterbi)
    2009-12-12 10:43:56下载
    积分:1
  • ma=0
    标准AM振幅调制方式,ma=0时的标准AM振幅调制(Standard AM modulation, ma = 0 the standard AM modulation)
    2013-07-21 13:47:08下载
    积分:1
  • a
    说明:  matlab code OFDM SC FDMA OFDMA PAPR matlab code OFDM SC FDMA OFDMA PAPR matlab code OFDM SC FDMA OFDMA PAPR matlab code OFDM SC FDMA OFDMA PAPR
    2013-05-19 22:43:57下载
    积分:1
  • VoronoiUsingBrushfire-master
    Voronoi使用Matlab编程,解决选址、最小路径最大覆盖等问题(Voronoi uses Matlab programming to solve the problem of location, minimum path maximum coverage and so on)
    2020-08-23 14:07:52下载
    积分:1
  • workshop_part3_programming
    introduction to matlab part 3 and examples
    2009-06-04 00:28:15下载
    积分:1
  • icaFacesCode
    face regnation system with matlab sourcecode
    2013-10-09 17:11:17下载
    积分:1
  • ga
    说明:  binary genetic algorithm
    2011-07-07 13:05:40下载
    积分:1
  • shuxue
    这些资料都是有关数学建模的资料,包含多种算法,包括遗传算法,灰色预测等,希望对大家有帮助。(These data are related to the mathematical modeling of information, including a variety of algorithms, including genetic algorithm, the gray prediction, we want to help.)
    2011-09-18 22:03:31下载
    积分:1
  • gui-of-ATLAB
    matlab中GUI的使用说明,有使用的实例说明,适合初步入门GUI的人使用(description of the matlab GUI-use, use examples, a GUI for initial entry)
    2013-03-25 10:28:44下载
    积分:1
  • game-theory
    We consider the scheduling of simple linear deteriorating jobs on parallel machines a new perspective based on game theory. In scheduling, jobs are often controlled by independent and selfish agents, in which each agent tries to a machine for processing that optimizes its own payoff while ignoring the others. We formalize this situation as a game in which the players are job owners, the strategies are machines, and a player’s utility is inversely proportional to the total completion time of the machine selected by the agent. The price of anarchy is the ratio between the worst-case equilibrium makespan and the optimal makespan. In this paper, we design a game theoretic approximation algorithm Aand prove that it converges to a pure-strategy Nash equilibrium in a linear number of rounds. We also derive the upper bound on the price of anarchy of Aand further show that the ratio obtained by Ais tight. Finally, we analyze the time complexity of the proposed algorithm
    2015-03-23 14:25:30下载
    积分:1
  • 696516资源总数
  • 106436会员总数
  • 7今日下载