登录
首页 » matlab » fiekao_V3.6

fiekao_V3.6

于 2021-03-23 发布 文件大小:6KB
0 291
下载积分: 1 下载次数: 2

代码说明:

  ldpc码的编解码实现,实现了图像的加水印,去噪,加噪声等功能,IMC-PID是利用内模控制原理来对PID参数进行计算。( Codec ldpc code implementation Realize image watermarking, de-noising, plus noise and other functions, The IMC- PID is using the internal model control principle for PID parameters is calculated.)

文件列表:

fiekao_V3.6.m,10845,2016-12-03

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

发表评论

0 个回复

  • ImageStore
    Image Storage in Access
    2009-03-24 16:18:01下载
    积分:1
  • OFDM-simulation
    This code used in Modeling the wireless Propagation channel A simulation approach with Matlab
    2012-09-16 21:46:03下载
    积分:1
  • GAjn
    自己编写的遗产算法程序。在matlab环境下编写的m文件。经测试好用,基本,原理简单。(I have written legacy algorithm. In the matlab environment prepared m files. Tested easy to use, the basic principle is simple.)
    2013-12-31 11:22:12下载
    积分:1
  • STO-estimation
    OFDM符号定时同步算法,几种经典算法的仿真和比较(OFDM symbol timing synchronization algorithm, simulation and comparison of several classical algorithm)
    2015-10-07 10:33:13下载
    积分:1
  • CH5
    Chapter 5 of Telecommunication Networks book
    2010-10-24 18:15:33下载
    积分:1
  • Frank-Wolfe-matlab
    Frank-Wolfe算法 matlab(rank-Wolfe, matlab)
    2013-09-27 15:10:32下载
    积分:1
  • SI
    说明:  Matlab的系统经典辨识,包括二阶和三阶(Matlab system identification classical)
    2010-04-23 09:26:39下载
    积分:1
  • gaevolve
    this go sample code for genetic
    2011-04-28 17:07:37下载
    积分:1
  • IRR-digital-high-pass-filter
    IRR数字高通滤波器matlab程序代码(IRR digital high pass filter matlab code)
    2011-05-04 16:20:28下载
    积分: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
  • 696516资源总数
  • 106914会员总数
  • 0今日下载