登录
首页 » matlab » MATLAB

MATLAB

于 2011-05-21 发布 文件大小:8KB
0 178
下载积分: 1 下载次数: 217

代码说明:

  卷积码编码译码MATLAB仿真程序,比较详细的源代码(Convolutional coding and decoding MATLAB simulation program)

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

发表评论

0 个回复

  • tdoa
    时延估计算法 互相关 自适应滤波法 (TDE TIME DELAY ESTIMATION)
    2021-05-16 17:30:02下载
    积分:1
  • K_L
    使用K-L变换和K-L反变换,对信号正交变换和压缩有很大帮助。(Using the K-L transform and inverse K-L transform, the signal orthogonal transform and compression of great help.)
    2013-03-27 17:01:43下载
    积分:1
  • rangePolyponPoint
    Matlab中有很多根据多边形顶点计算多边形面积,对多边形涂色等函数,但是并没有对多边形顶点进行凸多边形排序问题,所以写了这个对可以构成凸多边形的顶点进行排序的算法。( 此子程序功能为逆时针排列多个可构成一个凸多边形的顶点 输入参数xv是这些顶点的横坐标集合 yv是这些坐标的纵坐标集合 返回的排列好的点的横坐标和纵坐标集合. 使用示例: [x y]=rangePolyponPoint([0 10 10 0],[0 10 0 10]) 输出结果为:x = [ 0 10 10 0], y = [ 0 0 10 10].)
    2011-11-27 11:34:14下载
    积分:1
  • c5s3_L
    matlab simulink 小电流中性点不接地,相间短路故障暂态仿真(nutural point not ground, phase short cut)
    2016-05-20 10:38:23下载
    积分:1
  • routing_R
    复杂网络中,在BA网络中最经典的路由算法matlab源程序并,是学习复杂网络最基本的路由算法。(Complex network, in the BA network, the most classical routing algorithm matlab source code and is the most basic learning complex network routing algorithm.)
    2007-09-17 14:55:24下载
    积分:1
  • ARzxg
    AR模型,用经典法的自相关法求谱估计,简单实用(AR model, using the classic method of auto-correlation spectral estimation method, simple and practical)
    2009-06-26 10:16:49下载
    积分:1
  • matlab_c++-call_mat
    这个是自己实现的matlab与c++的一个接口。 是用c++语言实现的(This is the realization of our own Matlab and c of an interface. Is the C Language)
    2021-03-04 12:39:32下载
    积分:1
  • chap4_7b
    模糊自整定PID控制系统simulink仿真实例第二部分(Fuzzy self-tuning PID control system simulink simulation instance)
    2013-04-08 09:14:48下载
    积分:1
  • WindyGridWorldQLearning
    Q-learning (Watkins, 1989) is a simple way for agents to learn how to act optimally in controlled Markovian domains. It amounts to an incremental method for dynamic programming which imposes limited computational demands. It works by successively improving its evaluations of the quality of particular actions at particular states. This paper presents and proves in detail a convergence theorem for Q,-learning based on that outlined in Watkins (1989). We show that Q-learning converges to the optimum action-values with probability 1 so long as all actions are repeatedly sampled in all states and the action-values are represented discretely. We also sketch extensions to the cases of non-discounted, but absorbing, Markov environments, and where many Q values can be changed each iteration, rather than just one.
    2013-04-19 14:23:35下载
    积分:1
  • pec1_0
    对一组滚动轴承振动信号做分数阶排列熵计算达到诊断的目的。(For a group of vibration signals do Fractional permutation entropy calculation diagnostic purposes.)
    2015-08-28 16:27:25下载
    积分:1
  • 696518资源总数
  • 105877会员总数
  • 14今日下载