登录
首页 » matlab » fading

fading

于 2011-10-09 发布 文件大小:139KB
0 263
下载积分: 1 下载次数: 2

代码说明:

  channel fading on cellular communication

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

发表评论

0 个回复

  • vimrc
    vim配置文件,可以直接解压后放在/home/username(vim config file,u can put this file inthe path /home/usrname)
    2014-02-21 10:27:35下载
    积分:1
  • adfig04
    adfig function for wavelet processing in wavelab
    2013-05-16 20:32:39下载
    积分:1
  • SF_Spline
    基于matlab的三次样条插值算法程序(Matlab based on the cubic spline interpolation algorithm procedure)
    2007-12-05 18:21:48下载
    积分:1
  • SingleNeuralNetPID
    用MATLAB实现的单神经元PID算法程序(Using MATLAB to achieve the single neuron PID algorithm procedure)
    2007-12-22 20:41:34下载
    积分:1
  • ofdmwaterfilling
    经典的注水算法 可用来解决信道中质量好的信道多分功率,质量差的少分。(Classical algorithm can be used to solve the water quality channel multi-channel power, a smaller share of poor quality.)
    2009-05-08 16:28:24下载
    积分:1
  • adaptivefilterbyhaykin
    说明:  自适应滤波器byhaykin源码-关于语音方面的自适应源代码和详解(Adaptive filter byhaykin source- on the voice side of the adaptive source code and detailed)
    2008-11-06 14:56:45下载
    积分:1
  • liejskjfs
    说明:  野人过河问题属于人工智能学科中的一个经典问题,问题描述如下: 有三个牧师(也有的翻译为传教士)和三个野人过河,只有一条能装下两个人的船,在河的任何一方或者船上,如果野人的人数大于牧师的人数,那么牧师就会有危险. 你能不能找出一种安全的渡河方法呢?的matlab程序!(Savage river belongs to the problem of artificial intelligence disciplines a classic problem, it is described as follows : There are three priests (also translated some of the missionaries) and the three Savage cross the river, only one can hold the next two boats in the river or any of the parties on board, if Savage is greater than the number of priests the number of priests will be so dangerous. you can find a safe way to cross the river? The Matlab procedures!)
    2006-03-30 22:02:40下载
    积分:1
  • eye-detection
    基于灰度的人眼定位,matlab,积分投影法实现人眼识别(eye detection)
    2013-12-11 14:41:23下载
    积分:1
  • DynamicWindowApproachSample
    动态窗口法,直接可以运行的程序。实乃学习路径规划优良demo( Dynamic window method, you can run the program directly. Learning Path planning exercise good demo)
    2016-06-09 10:05:21下载
    积分:1
  • gn
    说明:  Market Newman写的复杂网络的加权GN算法 算法用Python写的 其基本思想是不断的删除网络中具有相对于所有源节点的最大的边介数(ege betweenness)的边,然后,再重新计算网络中剩余的边的相对于所有源节点的边介数(The basic idea is to delete the network with respect to all of the source nodes of the largest betweenness (EGE betweenness) edges, then re computing network the remaining edge relative to the boundary of the source node number of all)
    2016-09-18 08:40:49下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载