登录
首页 » matlab » Satellite-Communications

Satellite-Communications

于 2013-08-20 发布 文件大小:6805KB
0 215
下载积分: 1 下载次数: 34

代码说明:

  卫星通信方向的经典书籍,丹尼斯罗迪的,相关方向的可以下载看下(Satellite communication direction of the classic books, Dennis Roddy, relevant direction can download facie)

文件列表:

Satellite Communications.pdf,7872915,2013-05-29

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

发表评论

0 个回复

  • floc
    本程序为零序电流小波变换求首波头极性及模值大小原理:故障线路的波头极性与非故障线路相反。(This procedure is zero sequence current first wave wavelet transform modulus of the first polarity and the size principle: the first wave of fault lines fault lines and non-polar opposite.)
    2010-07-15 13:13:25下载
    积分:1
  • fuzzy c-mean
    说明:  一个FMEAN神经网络代码,是matlab开发的模糊聚类(FMEAN a neural network code is developed Matlab fuzzy clustering)
    2005-11-28 11:24:51下载
    积分:1
  • Numerical-Methods-
    matlab数值算法的中文版书籍,详细介绍基于matlab的各种数值算法。(The Chinese version of the numerical algorithm matlab books, matlab detailed Numerical Algorithms based presentation.)
    2014-10-03 10:19:47下载
    积分:1
  • boxsurface
    将整个空间进行划分,变成无数的小空间,其中小空间的长度可变。(The entire space is divided into numerous small space, wherein the variable length of the small space.)
    2013-12-24 09:30:05下载
    积分:1
  • berfigure
    ofdm系统中功率自适应分配算法研究的matlab源代码(运行出误比特图形)(ofdm system power distribution Adaptive Algorithm for the Matlab source code (BER running out plans shape))
    2021-02-06 02:29:57下载
    积分:1
  • matlab-100-examples
    matlab 100个小程序的示范例子,有界面的输入,交互性不错。(demonstration examples Matlab 100 small programs, interface input, good interactivity.)
    2013-03-21 16:34:10下载
    积分:1
  • EEMD
    改进EMD分解模式混叠问题,利用EEMD分解,可以克服模态混叠现象(Improved EMD decomposition aliasing mode, use EEMD decomposition can overcome aliasing modes)
    2014-11-27 11:00:36下载
    积分:1
  • Wave_Watermark
    一个简单的wave文件水印程序,使用LSB嵌入。(A simple wave file watermark, the use of LSB embedding.)
    2010-11-10 21:32:28下载
    积分:1
  • matlab
    matlab中文帮助文档,matlab强大的数据处理和图像处理能力(matlab help in Chinese)
    2013-11-01 21:51:22下载
    积分:1
  • 最大二分配法
    如果G的边集E(G)中有个子集M,满足M中的任何两条边 都不邻接,则M就是图G的一个匹配。包含边数最多的匹配 称为最大匹配,最大匹配所包含的边数称为最大匹配数。当 G是二分图时,问题就比较特殊了,这就是我们要解决 的问题——最大二分匹配。(If there is a subset M in the edge set E (G) of G, if any two edges in M are not adjacent, then M is a match of graph G. The match with the largest number of edges is called the maximum matching, and the number of edges contained in the maximum matching is called the maximum matching number. When G is a two point graph, the problem is very special. This is the problem we want to solve -- the biggest two points matching.)
    2021-01-20 10:38:41下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载