登录
首页 » matlab » Desktop

Desktop

于 2014-01-28 发布 文件大小:15KB
0 169
下载积分: 1 下载次数: 2

代码说明:

  This is about Digital signal Processing.

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

发表评论

0 个回复

  • 神经模糊预测控制及其matlab实现
    神经模糊预测控制及其matlab实现,包含书籍中各类案例代码(Neuro-Fuzzy Predictive Control and Its Matlab Implementation)
    2018-12-09 10:32:54下载
    积分:1
  • mmc-hvdc
    说明:  包含30个智能算法。遗传算法粒子群算法等等。(It contains 30 intelligent algorithms.)
    2020-06-28 18:32:19下载
    积分:1
  • weibo
    Smith圆图,可以实现多种功能,用matlab仿真软件实现(Smith chart, you can achieve a variety of functions, implemented using matlab simulation software)
    2012-10-20 21:29:31下载
    积分:1
  • iterative
    Iterative thresholding
    2015-03-28 14:14:39下载
    积分:1
  • EM
    说明:  用于估计未知数据的EM算法,即最大期望算法,用到的地方很多,可用来做同步。(The data used to estimate the unknown EM algorithm, that is the maximum expectation algorithm, used in many places, can be used for synchronization.)
    2010-08-05 16:20:21下载
    积分:1
  • imagepanorama
    Its a novel matlab program for image panorama building
    2010-05-31 15:29:44下载
    积分:1
  • adaptive-filter-theory-4th
    自适应滤波器原理第四版,经典中的经典,adaptive filter theory 4th(adaptive filter theory 4th)
    2014-01-04 11:49:32下载
    积分:1
  • 可控整流仿真模型
    可控整流仿真模型,PWM整流器,三相可控整流(Controlled rectifier simulation model, PWM rectifier, three-phase controlled rectifier)
    2021-01-08 19:58:52下载
    积分:1
  • code_tracking
    GPSCA码跟踪,自己编写,可观察误码率,(GPSCA code tracking, I have written, the bit error rate can be observed,)
    2010-11-22 16:41:11下载
    积分:1
  • path_discovery
    自己编写的利用matlab实现无线自组织网AODV仿真的算法源码。 为由50个节点构成的网络。在50m×50m大小的区域内,随机的产生50个节点。由用户指定源节点和目的节点,程序负责给出从源节点到目的节点的最小路径和此路径的跳数。各个节点之间设定为只要在自己直接通信范围内的其它节点,均一跳可达。(Write your own realization of the use of matlab simulation of wireless self-organizing network algorithms AODV source. The grounds of a network of 50 nodes. Size of 50m × 50m in area, randomly generated 50 nodes. By the user to specify the source node and destination node, the program responsible for the given node from the source node to the destination path and this path is the minimum number of hops. Set between each node to communicate directly as long as within the scope of their other nodes, all jump up.)
    2021-04-15 16:08:55下载
    积分:1
  • 696518资源总数
  • 106222会员总数
  • 14今日下载