登录
首页 » matlab » calculaPAR

calculaPAR

于 2014-02-13 发布 文件大小:1KB
0 204
下载积分: 1 下载次数: 8

代码说明:

  Calcula the PAPR and the CCDF of the ofdm signal

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

发表评论

0 个回复

  • prtools
    A Matlab Toolbox for Pattern Recognition,PRTools..Version 3.0
    2009-07-21 11:18:57下载
    积分:1
  • wavelet
    小波实现图像压缩的程序,matlab仿真,可以下载下来学习一下,简单易懂(Wavelet image compression of small procedures, to share)
    2014-10-09 17:26:17下载
    积分:1
  • Cyclostationarity
    关于循环平稳的一篇很经典的外文文献,值得认真阅读(About cyclostationary a very classic foreign literature worthy of serious reading)
    2013-03-11 21:55:39下载
    积分:1
  • KalmanTest
    现代信号处理 卡尔曼滤波matlab仿真程序(Kalman algorithm ,Modern signal processing)
    2010-08-17 23:20:41下载
    积分:1
  • MATLAB-book
    matlab的初学者教程 简单 实用 教会不懂得人学习matlab(matlab tutorial for beginners who do not know how the church is simple and practical learning matlab)
    2011-01-15 23:17:30下载
    积分:1
  • UKF
    本文 重 点 研究单目标跟踪中的三方面主要内容:一、非线性滤波 二、目标运动建模 三、各种探测条件下目标跟踪仿真实验。(This paper focuses on single target tracking in three areas: a nonlinear filtering , target motion modeling Third, a variety of detection under the conditions of the target tracking simulation experiments. )
    2013-01-10 21:36:06下载
    积分:1
  • patchantenna
    patchantenna matlab code
    2009-05-21 13:54:00下载
    积分:1
  • matlabProgramm
    说明:  经典程序例子,matlab语言编制的。 可供学习者参考(Classic example of the procedure, matlab languages. For learner reference)
    2008-10-02 00:17:10下载
    积分:1
  • Mathematical
    说明:  数学建模1998年A题论文集。其中有matlab中的程序的思路及计算的结果。非常好,很难得的。(Mathematical Modeling A title in 1998 collection. Matlab in which the idea of the procedures and calculation results. Very good, hard to come by.)
    2009-08-19 10:17:53下载
    积分: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今日下载