登录
首页 » matlab » SimulationofCommunicationSystems

SimulationofCommunicationSystems

于 2010-05-23 发布 文件大小:11449KB
0 249
下载积分: 1 下载次数: 27

代码说明:

   最经典的通信仿真教程:simulation of communication systems modeling methodology and techniques(Classic communication simulation tutorials: simulation of communication systems modeling methodology and techniques)

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

发表评论

0 个回复

  • main
    the signal pass the canal uwb on 60GHz and localisation indoor
    2010-06-23 21:18:22下载
    积分:1
  • 5.CA_infectious_disease
    基于元胞自动机算法的传染病模型,可仿真传染病发展过程(Epidemic model based on cellular automata algorithm can simulate the development of infectious diseases)
    2016-05-22 21:52:17下载
    积分:1
  • LinearReceivers
    Linear CDMA Receivers Like Decorrelator MMSE and Matched filters efficien and fast code
    2009-03-17 15:12:13下载
    积分:1
  • DTC PMSM
    my first PMSM drive model based on DTC, by using stator resistance Rs to measure the flux. a very simple model
    2020-09-29 22:27:49下载
    积分:1
  • TBR6
    ETSI STANDDARD TEST DOCUMENT FOR TBR6
    2009-12-18 15:46:00下载
    积分:1
  • matlab编写的流体计算和传热程序
    用matlab编写的关于流体计算和传热的几个程序(Fluid flow calculation and heat transfer program written by MATLAB)
    2020-07-03 00:40:02下载
    积分:1
  • rs_encode
    RS码编码的源代码,直接复制出来粘贴在新建工程即可用(RS coding source code, paste copied directly out ready for use in new construction)
    2013-11-15 10:05:25下载
    积分:1
  • cl
    说明:  matlab潮流计算,利用牛顿法计算线路潮流,各位大神进来指点(Matlab power flow calculation, using Newton method to calculate line power flow, you gods come in and give advice)
    2019-05-05 14:15:47下载
    积分:1
  • Essential_MATLAB_for_Engineers_and_Scientists
    Essential MATLAB for Engineers and Scientists - 3ed. Brian D. Hahn, Daniel T. Valentine 2007
    2010-09-30 11:49:45下载
    积分:1
  • 0
    说明:  给定n种物品和一个背包,物品i的重量是Wi,价值是vi,被包容量是C,应该如何选择装入被包的物品,使得装入背包中物品的总价值最大?对于每种物品i,只有两种选择,装入或者不装入. 输入:第一行两个正整数n(物品数)和C(容量) 第二行n个正整数n,表示物品价值 第三行n个正整数n,表示物品重量 输出:第一行表示总价值 第二行n个数(0/1),0表示物品不装入,1表示装入 例如, 输入: 5 10 6 3 5 4 6 2 2 6 5 4 输出 15 1 1 0 0 1 (Species of a given n items and a backpack, the weight of item i is Wi, the value of vi, was packet capacity is C, should be how to choose a package of items to be loaded, the backpack load in the largest total value of goods? For each item i, there are only two options, loaded or not loaded. Input: the first line of the two positive integer n (the number of items) and C (capacity) of the second line of n positive integer n, that the value of the third line of n positive integer n, that the weight of output: the total value of the first line of the second line, said n number of (0/1), 0 that the items do not load, that load 1 for example, enter: 5,106,354,622 6 5 4 output 15 1 1 0 0 1)
    2009-07-01 23:07:01下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载