登录
首页 » matlab » fdmRadio

fdmRadio

于 2015-04-10 发布 文件大小:1KB
0 180
下载积分: 1 下载次数: 7

代码说明:

  FDM modulation with matlab

文件列表:

radio_FDM1.m,4799,2015-03-22

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

发表评论

0 个回复

  • MPD_PMD
    this code for voice detection
    2013-12-25 00:07:34下载
    积分:1
  • vectorquant
    VQLBG Vector quantization using the Linde-Buzo-Gray algorithm
    2009-03-14 00:12:30下载
    积分:1
  • STCode
    空时编码源代码,在Matlab中使用Mex文件编写,速度快(space time codec)
    2009-03-24 18:38:40下载
    积分:1
  • matlab_eng
    说明:  matlab编程引擎(matlab programming engine)
    2008-09-14 17:25:52下载
    积分:1
  • 1
    说明:  here is the matlab code for sixty four qam modulation
    2013-11-04 08:54:02下载
    积分:1
  • filter_0
    实现spwm谐波消除方法滤波器的设计模型搭建。(To achieve the spwm harmonic elimination filter design and the model structures.)
    2013-04-14 17:42:33下载
    积分:1
  • encoder-crossover
    encoder crossover mutation
    2012-10-28 15:35:23下载
    积分:1
  • SOM
    神经网络自适应竞争SOM算法,matlab算例,共9例,非常实用,可运行。(Neural network adaptive competition SOM algorithm, matlab example, a total of nine cases, very practical, you can run.)
    2013-04-10 09:18:32下载
    积分:1
  • MODE
    一种多目标差分演化算法的例程,可以自己添加目标函数(A multi-objective differential evolution algorithm routines, you can add your own objective function)
    2020-12-29 16:39:00下载
    积分:1
  • Matlab_zuixiaoerchengfa
      最小费用最大流算法通用Matlab函数 基于Floyd最短路算法的Ford和Fulkerson迭加算法   基本思路:把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条   自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流   量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新   确定,如此多次迭代,最终得到最小费用最大流.( Minimum cost maximum flow algorithm for general Matlab functions based on the Floyd shortest path algorithm of Ford and Fulkerson superposition algorithm of the basic ideas: the cost of unit flow on the arc as a certain length of Floyd for the most short-circuit method to determine the one percent V1 through Vn are the most short-circuit then this short circuit as a scalable road, a method for solving the maximum flow problem on flow increased to the maximum possible value that the shortest way increased traffic, the cost of unit flow on each arc sure, so many iterations, the final minimum cost maximum flow.)
    2012-07-27 14:54:17下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载