登录
首页 » matlab » entropy

entropy

于 2009-02-14 发布 文件大小:1KB
0 233
下载积分: 1 下载次数: 5

代码说明:

  entropy of ofdm inter carrier interference scheme

文件列表:

entropy.m

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

发表评论

0 个回复

  • gabp
    说明:  用多种方式进行神经网络模拟,比较了多种模拟方法的优劣(In many ways the neural network simulation to compare the advantages and disadvantages of various simulation)
    2011-04-06 19:39:21下载
    积分:1
  • ed
    说明:  能量检测算法,用于cr中的,对于学习能量检测的有借鉴作用(Energy detection algorithm for the cr)
    2011-09-17 10:42:09下载
    积分:1
  • LQR-
    对欧进萍《结构振动控制——主动、半主动和智能控制》书中2.6节算例的matlab代码(OU Jin-ping quot structural vibration control- active, semi-active and intelligent control quot book 2.6 example matlab code)
    2012-11-03 22:19:20下载
    积分:1
  • TSP---Copy
    This is dynamic matlab code for tsp, an optimization program
    2013-07-29 21:29:43下载
    积分:1
  • svm3legprint
    space vector modulation for three phase two level inverter
    2011-07-07 23:58:59下载
    积分:1
  • MADA
    SIMULATION DOUBLY FED MACHINE
    2014-11-22 06:39:54下载
    积分:1
  • kalman_filter
    describe kalman filter for tracking
    2014-12-01 04:41:31下载
    积分:1
  • PLL_System_Sim_for_matlab
    PLL_System_Sim_for_matlab————(PLL_System_Sim_for_matlab----)
    2013-04-16 21:07:26下载
    积分:1
  • CFAR
    雷达CFAR技术 恒需警检测代码 杂波背景中区分出有用目标回波的恒虚警(CFAR)检测技术,是直接影响雷达性能的关键(CFAR technique requires constant police radar detection code clutter distinguish the useful target echo CFAR (CFAR) detection technology is the key to directly affect radar performance)
    2013-12-10 14:32:22下载
    积分:1
  • Dijkstra
    说明:  最短路径的Dijkstra算法程序。Dijkstra算法是典型最短路算法,用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展,直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解,但由于它遍历计算的节点很多,所以效率低。   Dijkstra算法是很有代表性的最短路算法,在很多专业课程中都作为基本内容有详细的介绍,如数据结构,图论,运筹学等等。 (The Dijkstra shortest path algorithm for the procedure. Dijkstra algorithm is a typical shortest path algorithm, used to calculate a node to all other nodes of the shortest path. The main characteristics is the starting point as the center outward expansion layers, until the end date be extended to. Dijkstra shortest path algorithm can arrive at the optimal solution, but because of its calculation of the node traversal, so inefficient. Dijkstra algorithm is very representative of the shortest path algorithm, in many professional courses in the basic content as described in detail, such as data structures, graph theory, operational research and so on.)
    2008-11-26 22:27:45下载
    积分:1
  • 696516资源总数
  • 106554会员总数
  • 12今日下载