登录
首页 » matlab » decodeProbDomain

decodeProbDomain

于 2010-11-24 发布 文件大小:1KB
0 198
下载积分: 1 下载次数: 3

代码说明:

  prob domain decoding technique using matlab m-file

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

发表评论

0 个回复

  • bbs-SNR_Max
    说明:  基于最大信噪比的盲源分离算法,源信号为混沌信号。(Based on the maximum signal to noise ratio Blind source separation algorithm, the source signal for the chaotic signal.)
    2010-03-17 15:08:18下载
    积分:1
  • LSFS
    说明:  有监督的特征选择和优化程序MATLAB代码,基于最小二乘算法。内有测试数据,和详细程序说明(Least-Squares Feature Selection (LSFS) is a feature selection method for supervised regression and classification. LSFS orders input features according to their dependence on output values. Dependency between inputs and outputs is evaluated based on an estimator of squared-loss mutual information called LSMI)
    2010-04-13 16:07:59下载
    积分:1
  • app1
    A good Appendix from Wiley Pub Group for understanding Genetic Algorithm you can download from Wiley Web.
    2014-09-15 19:24:10下载
    积分:1
  • lyapunov_wolf
    采用轨迹跟踪的方法来求解最大李雅普诺夫指数(Trajectory tracking method is adopted to solve the maximum lyapunov index)
    2015-04-20 20:04:47下载
    积分:1
  • 在雷达成像中脉冲压缩技术使非常重要的一部分,去斜处理的方法是最常使用的
    在雷达成像中脉冲压缩技术使非常重要的一部分,去斜处理的方法是最常使用的(Pulse compression radar imaging technology enables a very important part, to ramp handling method is the most commonly used)
    2014-03-18 17:35:39下载
    积分:1
  • 6
    说明:  《精通MTLAB最优化计算》第6章 无约束一维极值问题 源码(&quot The most proficient MTLAB Optimization&quot Chapter 6 one-dimensional extremum problem without constraint source)
    2011-04-18 21:44:10下载
    积分:1
  • GVI-ADP
    动态规划网络,包括执行网络和评价网络,采用BP网络实现。(ADP network, including execution network and evaluation network, is implemented by BP network.)
    2020-11-04 11:29:52下载
    积分:1
  • Turbo_simulink
    turbo码在simulink中的编译码、误码率分析的仿真。(the encoding and decoding of turbo codes in the simulink simulation, bit error rate analysis.)
    2012-05-04 10:18:23下载
    积分:1
  • ACO
    TSP问题的人工蚁群算法中,假设m只蚂蚁在图的相邻节点间移动,从而协作异步地得到问题的解。每只蚂蚁的一步转移概率由图中的每条边上的两类参数决定:1、信息素质,也称信息素痕迹。2、可见度,即先验值。(Artificial ant colony algorithm TSP problem, assume that m ants move between adjacent nodes in the graph, which asynchronously collaborate get problem solution. Each ant transition probability is determined by the figure of two kinds of parameters for each edge: 1, the quality of information, also called pheromone trails. 2, visibility, ie priors.)
    2016-10-10 20:51:31下载
    积分:1
  • meanshift_matlab
    mean shift tracker mean shift tracker mean shift tracker mean shift tracker mean shift tracker
    2009-04-06 04:23:15下载
    积分:1
  • 696518资源总数
  • 106215会员总数
  • 5今日下载