登录
首页 » matlab » decode_tuyang

decode_tuyang

于 2013-11-25 发布 文件大小:8KB
0 153
下载积分: 1 下载次数: 1

代码说明:

  资料中包含利用校验子(错误图样)译码的原理、编码流程图以及matlab的编码,程序中配有注释,通俗易懂。(Information contained in the use of sub-parity (error pattern) decoding principle, flow charts and coding matlab code, the program with notes, easy to understand.)

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

发表评论

0 个回复

  • beni33
    this is a [ortion of machine drive designind code.
    2010-08-08 07:11:37下载
    积分:1
  • kalman.guijigenzong
    用Kalman滤波方法估计目标航迹的Matlab源程序(this study is Kalman Filter algorithm of a very good process)
    2010-05-29 16:36:08下载
    积分:1
  • wavelet
    matlab下的小波消噪源程序,能较好的对非平稳信号进行滤波消噪(matlab source code under the wavelet denoising can be better to filter the non-stationary signal denoising)
    2010-06-09 18:48:04下载
    积分:1
  • Noncoherent_multiple
    实现扩频里随机信号和伪码序列的产生,以及关于生成扩频序列的MATLAB程序,并用载波信号实现2PSK调制,在接收端用非相干差分积分实现捕获(Spread spectrum signal generated in the realization and pseudo random code sequence, and generate MATLAB program about spreading sequences and achieve 2PSK modulation carrier signal at the receiving end with the capture of non-coherent differential integrator)
    2015-04-21 10:39:38下载
    积分:1
  • 2016.08.08topsIS
    TOPSIS源码MATLAB中文详细注解。(TOPSIS source MATLAB detailed comments.)
    2016-09-09 17:09:50下载
    积分:1
  • 路径规划算法
    说明:  基础的路径规划算法:人工势场,构建引力场与势力场寻找最短路径(Artificial potential field)
    2021-01-20 15:14:43下载
    积分:1
  • S1
    说明:  SET OF PROGRAMS FOR ASSEMBLY LINE BLOCKING PARAMETERS
    2014-09-25 20:26:48下载
    积分:1
  • jingtongLP
    多井过程中的井筒计算,以及注采过程中的相关参数(Multi-well process wellbore calculations, and injection process parameters)
    2013-11-06 00:14:54下载
    积分:1
  • maxcost
    “基于Floyd最短路算法的Ford和Fulkerson迭加算法”的最小费用最大流算法,其基本思路为:把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条自V1至Vn的最短路;再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流量增至最大可能值;而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新确定,如此多次迭代,最终得到最小费用最大流。 (" Floyd shortest path algorithm based on the Ford and Fulkerson algorithm superposition" of the minimum cost maximum flow algorithm, the basic idea is: the flow of each arc on the unit cost as a length, with Floyd for the most short-circuit method to determine a from V1 to Vn of the most short-circuit then this can be expanded as the shortest way, by solving the maximum flow of traffic on the way to its maximum possible value and this increased the flow of the shortest path, on which the arcs of the unit to re-determine the cost of traffic, so several iterations, finally get the minimum cost maximum flow.)
    2010-12-22 17:27:32下载
    积分:1
  • Communication_system_simulation_matlab
    说明:  通信系统的matlab仿真实例,有源代码和仿真图在里面,可供参考(Matlab simulation example communication system, source code and simulation diagram on the inside, for reference)
    2010-04-08 10:20:16下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载