登录
首页 » matlab » 87ptsn

87ptsn

于 2010-12-09 发布 文件大小:2KB
0 318
下载积分: 1 下载次数: 5

代码说明:

  通信仿真中非常重要的一个程序,实现ofdm抑制papr算法(Communication simulation program is very important to realize ofdm algorithm inhibition papr)

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

发表评论

0 个回复

  • simulink_labs
    simulink实例仿真源码应有尽有,通信方向在学习Simulink的可以参考一下!(The simulation simulink source everything, communication, direction in learning Simulink that can refer to!)
    2009-10-21 21:43:29下载
    积分:1
  • Matlabnnt
    觉得很好的一个Matlab程序想和大家一起分享,互相学习。(A Matlab program feel good and you want to share, learn from each other.)
    2010-12-09 17:03:23下载
    积分:1
  • EKFLocalisation
    non-linear Kalman based localisation in a field of landmarks
    2012-03-22 18:04:59下载
    积分:1
  • LRtoHR
    z_tranform for advanced digital signal processing lab
    2012-04-08 18:16:03下载
    积分:1
  • 20140114043337585
    ABS是关于汽车防抱死制动系统的simulink,程序截图(ABS is simulink automotive anti-lock braking system on the program screenshot)
    2014-08-25 18:40:43下载
    积分:1
  • chaos
    混沌信号生成 逻辑映射 三个函数matlab程序(chaos signal)
    2014-12-09 12:05:35下载
    积分:1
  • trajectory-tracking
    利用二轮车辆运动学微分方程来跟踪圆形轨迹,首先生成离散化的参考轨迹圆,进而进行点对对跟踪(The use of two differential equations to track the vehicle kinematics circular trajectory, the first generation of discrete circular reference trajectory, and then make the point right right track)
    2015-03-06 08:46:27下载
    积分:1
  • main
    基于梯度的亚像素配准算法的Matlab程序 (Gradient-based sub-pixel registration algorithm Matlab procedures)
    2014-01-27 17:36:00下载
    积分:1
  • Channels
    通过internet远程对示波器通道数据进行采集与读取控制(through remote internet access for oscilloscope data acquisition and control Read)
    2007-07-10 10:46:47下载
    积分:1
  • TSP(TravelingSalesmanProblem)
    Traveling Salesman Problem (TSP) has been an interesting problem for a long time in classical optimization techniques which are based on linear and nonlinear programming. TSP can be described as follows: Given a number of cities to visit and their distances from all other cities know, an optimal travel route has to be found so that each city is visited one and only once with the least possible distance traveled. This is a simple problem with handful of cities but becomes complicated as the number increases.
    2007-11-15 01:44:52下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载