登录
首页 » matlab » 06169936

06169936

于 2013-08-19 发布 文件大小:144KB
0 142
下载积分: 1 下载次数: 5

代码说明:

  Interference Management with Relay Cooperation in Two-Hop Interference Channels

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

发表评论

0 个回复

  • daitong
    中频数字正交采样,并进行滤波,得出基带信号(IF quadrature sampling and filtering)
    2011-05-14 11:34:17下载
    积分:1
  • tsp_ga
    遗传算法,matlab编写的源代码,用于解决旅行商等np问题,算法效率高(Genetic algorithm written in Matlab source code used to solve the traveling salesman and other np, high efficiency of the algorithm)
    2012-05-25 20:32:26下载
    积分:1
  • CDMA2000reverse_link_channel_simulation
    对于CDMA2000 1X反向信道仿真,其中包括CRC,卷积,交织,扩频和调制的整个过程,模型和M文件。请查看文件夹中的README。(for CDMA2000 1X reverse channel simulation, including CRC, convolution, interleaving, Spread-spectrum modulation, and the whole process model and the M-file. Please see the folder README.)
    2007-05-22 00:35:56下载
    积分:1
  • DFS
    深度优先搜索属于图算法的一种,英文缩写为DFS即Depth First Search.其过程简要来说是对每一个可能的分支路径深入到不能再深入为止,而且每个节点只能访问一次.(DFS Depth First Search is a kind of graph algorithm, English abbreviation for DFS is the Depth First Search. The process is briefly branch of every possible path can t go deep into the deep, and each node can only access at a time.)
    2015-04-10 10:28:28下载
    积分:1
  • mcmc1
    mcmc的重要代码,在MATLAB中运用(mcmc)
    2010-12-31 20:54:58下载
    积分:1
  • PCA_yuandaima
    PCA 源代码 使用MATLAB PCA 源代码 使用MATLAB(PCA source code using MATLAB PCA using MATLAB source code)
    2007-01-10 12:06:42下载
    积分:1
  • xiansousuosuanfa
    最坏情况下使用O(n)次比较,2分搜索算法最坏情形复杂度O(logn)次比较,2分搜索算法比之线性搜索最坏情况下要好.(O (n) comparisons using the worst case, worst-case 2 minutes searching algorithm complexity of O (logn) comparisons, two points lower than the linear search algorithm search for the worst-case better.)
    2014-11-20 14:17:47下载
    积分:1
  • sl_using-(1)
    A way to do simulating for wireless com. using matlab
    2013-12-16 05:52:49下载
    积分:1
  • ref-for-base-paper
    The most ofICI avoidance algorithms divide UEs into cell edge and cell centre users based on static thresholds such as path loss, SINR and geometry factors. However, in an actual communication environment, the UE distribution as well as the shape of a cell can be changed. Therefore selection of the cell edge bands is difficult and needs to be optimized according to the time variation environment. Reference [6] proposed an ICI avoidance algorithm that can change cell edge bands dynamically. For each active UE and every time gap (the update duration of CEU/CCU), the threshold is updated based on SINR in order to keep the ratio of number of CEUs and CCUs constant. Then, cell weight is calculated to follow the instant changing of network.
    2014-10-21 12:42:32下载
    积分:1
  • 1st-part
    Virtual Mouse using Hand Gesture
    2013-11-20 22:27:40下载
    积分:1
  • 696518资源总数
  • 105877会员总数
  • 14今日下载