登录
首页 » Windows_Unix » OFDMAsingalTimedomain

OFDMAsingalTimedomain

于 2010-12-24 发布 文件大小:2KB
0 299
下载积分: 1 下载次数: 7

代码说明:

  OFDMA singal Time domain

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

发表评论

0 个回复

  • save
    一些基本的語法練習,可以拿來實際應用,包含了註解與程式(Some basic grammar exercises, can be used to practical applications, including annotations and programs)
    2014-02-21 01:51:09下载
    积分:1
  • preprocessing
    图像空域预处理算法汇总:有增强,去噪,锐化等,对初学者可作参考(err)
    2007-07-14 11:06:47下载
    积分:1
  • wavelet
    小波变换的matlab程序,里面有对图片的小波变换和波形文件的小波变换程序(Matlab wavelet transform procedure, which the picture has on the waveform of wavelet transform and wavelet transform procedures documents)
    2009-04-02 20:47:14下载
    积分:1
  • LMS
    说明:  实现lms实现lms实现lms实现lms实现lms实现lms(carry out lmscarry out lmscarry out lmscarry out lmscarry out lms)
    2011-03-05 21:27:17下载
    积分:1
  • jixiegongcheng
    学习机械工程控制的例子的一些matlab中的实现过程(Examples of mechanical engineering to learn some control of the implementation process in matlab)
    2011-09-06 14:39:48下载
    积分:1
  • Matlabsimulink
    基于Matlab的现代通信系统的仿真应用 内有SIMULINK通信仿真图(matlab simulink)
    2009-03-31 18:40:46下载
    积分:1
  • imcompwav
    image compression using wavelets
    2010-09-18 17:03:14下载
    积分:1
  • sift
    说明:  sift算法在matlab代码。对学习sift算法有很大帮助(sift algorithm in matlab code. Sift algorithm for learning a great help)
    2020-12-10 11:09:18下载
    积分:1
  • small-world-networks
    1998年, Watts和Strogatz 提出了小世界网络这一概念,并建立了WS模型。 实证结果表明,大多数的真实网络都具有小世界特性(较小的最短路径) 和聚类特性(较大的聚类系数) 。 WS小世界模型构造算法 1、从规则图开始:考虑一个含有N个点的最近邻耦合网络,它们围成一个环,其中每个节点都与它左右相邻的各K/2节点相连,K是偶数。 2、随机化重连:以概率p随机地从新连接网络中的每个边,即将边的一个端点保持不变,而另一个端点取为网络中随机选择的一个节点。其中规定,任意两个不同的节点之间至多只能有一条边,并且每一个节点都不能有边与自身相连。 (In 1998, Watts and Strogatz proposed the concept of the small world network, and the establishment of the WS model. The empirical results show that most real networks have small world (the smaller the shortest path) and clustering properties (high clustering coefficient). WS small-world model construction algorithm 1, from the rules FIG: consider a nearest neighbor coupling network with N points, they are surrounded by a ring, wherein each node and its left and right adjacent to each of K/2 connected to the node, K is an even number. The 2 randomized reconnection: randomly with probability p from the new connection on each side of the network, coming section of one of the endpoints remain unchanged, while the other endpoint is taken as the random selection of a node in the network. Which states that between any two different nodes can have at most one edge, and each node can not be connected to its own side.)
    2021-04-27 08:08:44下载
    积分:1
  • ADRC-TANKS
    自抗扰控制水箱 simulink 各种阶数(ADRC )
    2015-03-24 10:55:34下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载