登录
首页 » matlab » RS

RS

于 2011-01-01 发布 文件大小:3KB
0 299
下载积分: 1 下载次数: 0

代码说明:

说明:  本部分根据RS编译码原理,建立了SIMULINK仿真模型,可以对个参数不同设置,分析各参数对RS码性能的影响。(in this part we have build the mode of RS by simulink.we can analyze the impose of any keys to the function)

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

发表评论

0 个回复

  • Gold_codes
    these are the gold codes used in the cdma systems.
    2009-03-23 17:51:58下载
    积分:1
  • yuzhi
    实现了小波变换的阈值去噪算法,并实验仿真对比去噪效果(Internship wavelet threshold de-noising algorithm,)
    2009-11-09 16:29:38下载
    积分:1
  • 16PSKand16QAM
    16PSK和16QAM仿真使用Matlab(16PSK and 16QAM simulation using Matlab)
    2012-06-07 22:56:08下载
    积分:1
  • matlab_tutorials
    Matlab power spectral density qpsk power spectral density qpsk
    2014-10-04 18:27:51下载
    积分:1
  • pscad_AF
    一个简化的有源滤波器串联配置,提高并联型无源滤波器的滤波。(A simplified active filter in series configuration to improve the shunt passive filter filtering.)
    2014-01-19 20:23:21下载
    积分:1
  • matlab_watershed_pdf
    里面是一写我写MATLAB粘连细胞分割时搜索到的一些比较有用的资料,一起与大家分享(There is a write I write MATLAB adhesion cell division when the search for some of the more useful information to share with you together)
    2009-01-09 23:25:42下载
    积分:1
  • duishubianhuan
    我以前主要做MTALAB图像处理工作,现在慢慢整理以前的代码,上述未简单的图像对数变换处理程序(I used to do MTALAB main image processing work, and now slowly finishing the previous code, these are not a simple logarithmic transformation of the image processing)
    2010-01-05 18:31:47下载
    积分:1
  • Essential_MATLAB_language_and_dynamic_simulation_t
    MATLAB语言精要及动态仿真工具SIMULINK 学习应用matlab中的simulink库的好的书籍。(Essential MATLAB language and dynamic simulation tool SIMULINK。 Learning simulink in matlab application of a good library of books)
    2009-06-10 20:09:04下载
    积分: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
  • simulation-QAM
    explaination with codes of Quadrature Amplitude Modulation
    2013-12-04 04:49:13下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载