登录
首页 » matlab » yangxin2

yangxin2

于 2012-05-24 发布 文件大小:7KB
0 277
下载积分: 1 下载次数: 28

代码说明:

  比较协作通信中AF、DF的性能,有误码率的比较,以及实验值与理论值的比较(Comparison of collaborative communication, the AF, the DF performance, comparison of the bit error rate, and the comparison of experimental and theoretical values)

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

发表评论

0 个回复

  • notch01
    50hz陷波器,零极点的原理。编译通过。 (50hz notch filter, zero-pole principle. Compiled through.)
    2007-08-23 19:56:47下载
    积分:1
  • chap2_8
    在过程控制中,按偏差的比例(P)、积分(I)和微分(D)进行控制的PID控制器(亦称PID调节器)是应用最为广泛的一种自动控制器。(In process control, according to the percentage of deviation (P), Integral (I) and differential (D) control of PID controller (also known as PID regulators) is the most widely used of an automatic controller.)
    2008-07-23 23:36:23下载
    积分:1
  • area-select
    该文件为区域选择的相关程序,希望对你有所帮助(it is about area selecting)
    2012-03-29 16:51:20下载
    积分:1
  • Codes
    Matlab Sample Codes Implementation
    2013-10-01 20:48:08下载
    积分:1
  • carr_fraquen_offset
    carrier frequency offset and time offset in radio communication system,
    2010-06-21 22:44:29下载
    积分:1
  • Wavelet_OMP
    说明:  基于小波变换与正交匹配准备恢复算法的稀疏恢复算法试验(Orthogonal wavelet transform algorithm is ready to resume Test match)
    2011-02-24 10:01:07下载
    积分:1
  • convolutionPcorrelation
    a matlab source code for convolution and correlation, combined by annotations
    2011-05-04 08:55:42下载
    积分:1
  • Kalm
    雷达系统中的Kalman滤波算法的应用,很全。值得一看(Radar system application of Kalman filtering algorithm, it is full. Worth seeing)
    2011-05-10 19:32:10下载
    积分:1
  • buffon-experiment-on-mathematica
    mathematica里面实现仿真的蒲丰投针实验(buffon experiment on mathematica)
    2012-09-30 09:43:04下载
    积分:1
  • littleworld
    NW小世界网络的构成原则为:从一个环状的规则网络开始,网络含有N个结点,每个结点向与它最近邻的K个结点连出K条边,并满足N>>K>>In(N)>>1。随后进行随机化加边,以概率p在随机选取的一对节点之间加上一条边。其中,任意两个不同的节点之间至多只能有一条边,并且每一个节点都不能有边与自身相连。改变p值可以实现从最近邻耦合网络(p=0)向全局耦合网络(p=1)转变。在p足够小和N足够大时,NW小世界模型本质上等同于WS小世界模型。 (NW constitutive principles of small-world networks: from the rules of a ring network, network with N nodes, each node is connected to the K node with its nearest neighbor K edges, and meet N > > K > > In (N) > > 1. Followed by randomization into the plus side, with probability p with an edge between a pair of nodes in a randomly selected. Wherein between any two different nodes at most only one edge, and each node can not have a side connected with itself. P value can be changed to achieve the transition from the nearest neighbor coupling network (p = 0) coupled to the global network (p = 1). When p is small enough and large enough N, NW small-world model is essentially the same as the WS small-world model.)
    2013-04-26 21:17:37下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载