登录
首页 » matlab » ML-estimator

ML-estimator

于 2013-03-22 发布 文件大小:1KB
0 242
下载积分: 1 下载次数: 15

代码说明:

  极大似然估计器用于简单通信系统模拟,估计A1,A2: s1 = x11*A1 + x12*A2 s2 = x21*A1 = x22*A2 r1 = s1 + n1 r2 = s2 + n2(Maximum likelihood estimator for a simple communication system simulation, it is estimated that A1, A2: s1 = x11* A1+ x12* A2 s2 = x21* A1 = x22* A2 r1 = s1+ n1 r2 = s2+ n2)

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

发表评论

0 个回复

  • PrinciplesofCommunicationSystemSimulationandwirele
    通信系统仿真原理与无线应用,很好的一本关于通信系统仿真的书(Principles of Communication System Simulation and wireless applications, a good book on the communication system simulation)
    2010-08-09 15:43:17下载
    积分:1
  • fitness
    适应值的选取是一个重要的运算过程,我们应该选择合适的适应值函数,这样才能够很好的选择最佳的变量值(Fitness selection process is an important operation that we should select the appropriate fitness function, so that it can be a good choice of the best value of the variable )
    2011-11-16 09:42:09下载
    积分:1
  • jingdian
    认知无线电中的能量检测程序,用于频谱感知(energy detection)
    2012-11-15 11:12:33下载
    积分:1
  • GAforvrp
    多目标遗传算法 很好很强大 是一个非常不错的程序(it s good for you)
    2010-06-05 23:40:36下载
    积分:1
  • cluster
    clustering algorithms in matlab
    2010-07-18 14:31:49下载
    积分:1
  • vibration--signal--matlab-code
    matlab振动信号处理工具包可以进行滤波,信号时频域转换,试验模态参数辨识,时间序列分析等功能(MATLAB vibration signal processing tool bag, filter, experimental modal parameter identification and time series analysis and other functions)
    2016-06-01 11:56:44下载
    积分:1
  • houghyuan
    利用霍夫变换的原理,能够实现二值空间的圆检测。获得预期的图像信息。(Using the principle of Hough transform, the value of space to achieve the second round test. Achieve the desired image information.)
    2010-06-01 06:29:41下载
    积分:1
  • chap3
    matlab图像处理实例详解第三章源码程序,推荐大家一起学习,很好很实用。(Detailed examples matlab image processing Chapter III source program, recommend everyone to learn, very very useful.)
    2013-11-07 18:01:10下载
    积分:1
  • 1
    说明:  Simple control system design model. Project about control system of a manufacturing flow process.
    2011-03-03 08:49:22下载
    积分:1
  • dijikstra
    For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).
    2012-04-12 21:01:48下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载