登录
首页 » matlab » 混沌理论计算 互信息计算最佳延迟时间

混沌理论计算 互信息计算最佳延迟时间

于 2014-04-11 发布 文件大小:2KB
0 151
下载积分: 1 下载次数: 101

代码说明:

  混沌理论计算 互信息计算最佳延迟时间,保证可以运行(Mutual information to calculate the optimal delay time to ensure that you can run)

文件列表:

drawelem2.m,459,2013-08-27
mutualinformation22.m,1693,2013-08-27
mutualinformationspcv2200.m,666,2014-04-03
statx2.m,656,2013-08-27

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

发表评论

0 个回复

  • MATLAB2
    for 3 G matlab code develop for gold sequence
    2010-06-17 05:45:55下载
    积分:1
  • mino-simulation-dda
    mimo systems correlation
    2009-04-25 05:40:04下载
    积分:1
  • tongyuanfangzhen
    ask psk仿真,通信原理,包括文档以及源程序(ask psk)
    2013-12-28 15:27:11下载
    积分:1
  • knn
    说明:  knn分类程序,基于matlab开发 (Commission classification procedure based on the development of Matlab)
    2006-01-06 22:38:08下载
    积分:1
  • INDOORLOC
    In this i attached matlab code for indoor localization using WIFI and FM signal features classified by KNN classifier to predict the fingure print of the building structure.
    2013-10-06 14:04:16下载
    积分:1
  • shiyu
    对信号进行时域平均分析,提起周期性信号,常用于故障诊断(Time domain signal analysis)
    2013-05-14 16:00:35下载
    积分:1
  • MPSKTransmissonwithGausNoise
    本程序用于完成BPSK、QPSK、8PSK的调制仿真。并可任意扩展到MPSK和MQAM。程序分成三个部分:phase.m对基带码元序列进行脉冲成型,可选矩形脉冲,升余弦脉冲和平方根升余弦脉冲; model.m 为主程序,完成各种信号的基带星座图映射、脉冲成型和调制; command.m给出一个简单的频谱显示测试。(This procedure for the completion of BPSK, QPSK, 8PSK modulation simulation. Arbitrary and may be extended to MPSK and MQAM. Program is divided into three parts: phase.m symbol of the baseband shaping pulse sequences, optional rectangular pulse, the square root raised cosine pulse and raised cosine pulse model.m-based procedures, completed a variety of base-band signal constellation mapping , pulse shaping and modulation command.m given spectrum shows a simple test.)
    2009-05-21 20:14:27下载
    积分:1
  • 10.1.1.23.6686
    dynamic time warping
    2011-01-18 23:34:31下载
    积分:1
  • Floyd-Matlab
    floyd算法的matlab程序 floyd-最短路问题 输入: B-邻接矩阵(bij),指i到j之间的距离,可以是有向的。 sp- 起点标号。 ep- 终点标号。 输出: d- 最短路的距离。 path-最短路的路径。 (floyd algorithm matlab program floyd-shortest path problem Input: B-adjacency matrix (bij), refers to the distance between i to j, can be directed to. Sp-starting label. Ep-end labeling. Output: d-shortest distance. Path-shortest path.)
    2010-05-16 12:17:31下载
    积分:1
  • geodes
    求复杂网络节点之间的最短距离,也叫做测地线,对复杂网络的拓扑性质的分析很重要(Complex networks seeking the shortest distance between nodes, also called geodesic network topological properties of complex analysis is very important)
    2013-11-08 14:24:04下载
    积分:1
  • 696518资源总数
  • 104269会员总数
  • 42今日下载