登录
首页 » matlab » computingBERConvolutionalCod1

computingBERConvolutionalCod1

于 2010-07-13 发布 文件大小:5KB
0 226
下载积分: 1 下载次数: 11

代码说明:

   Script for computing BER with Binary Convolutional Code and Viterbi decoding with finite survivor state memory and variable traceback depth Convolutional code of Rate-1/2, Generator polynomial - [7,5] octal Hard decision decoding is used.

文件列表:

Script for computing BER with Binary Convolutional Cod1.doc,41472,2010-07-13

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

发表评论

0 个回复

  • guss
    matlab code for solve equation
    2010-08-29 20:30:24下载
    积分:1
  • ISAE
    Image segmentation and extraction in matlab
    2011-10-20 05:58:54下载
    积分:1
  • 鲁棒控制:线性矩阵不等式处理方法
    鲁棒控制问题的线性矩阵不等式的解法,从理论到程序,自学很好用,希望对大家有帮助。(Robust control problem of linear matrix inequality solution, from theory to procedures, self-learning, very useful, and I hope to help everyone.)
    2017-10-08 16:30:15下载
    积分:1
  • matlab
    实验指导 低通采样定理实验 FFT频谱分析实验 IIR滤波器设计实验 窗函数法FIR滤波器设计 频率采样法FIR滤波器设计实验(Experimental guide low-pass sampling theorem FFT spectrum analysis experiment experiment experiment IIR Filter Design Window Function FIR filter design frequency sampling FIR filter design experiment)
    2009-01-08 10:57:04下载
    积分:1
  • Near_and_far_field
    Calculation of near field and far field Radiation pattern
    2009-10-29 05:08:18下载
    积分:1
  • MyKmeans
    实现聚类K均值算法: K均值算法:给定类的个数K,将n个对象分到K个类中去,使得类内对象之间的相似性最大,而类之间的相似性最小。 缺点:产生类的大小相差不会很大,对于脏数据很敏感。 改进的算法:k—medoids 方法。这儿选取一个对象叫做mediod来代替上面的中心 的作用,这样的一个medoid就标识了这个类。步骤: 1,任意选取K个对象作为medoids(O1,O2,…Oi…Ok)。 以下是循环的: 2,将余下的对象分到各个类中去(根据与medoid最相近的原则); 3,对于每个类(Oi)中,顺序选取一个Or,计算用Or代替Oi后的消耗—E(Or)。选择E最小的那个Or来代替Oi。这样K个medoids就改变了,下面就再转到2。 4,这样循环直到K个medoids固定下来。 这种算法对于脏数据和异常数据不敏感,但计算量显然要比K均值要大,一般只适合小数据量。(achieving K-mean clustering algorithms : K-means algorithm : given the number of Class K, n will be assigned to target K to 000 category, making target category of the similarity between the largest category of the similarity between the smallest. Disadvantages : class size have no great difference for dirty data is very sensitive. Improved algorithms : k-medoids methods. Here a selection of objects called mediod to replace the center of the above, the logo on a medoid this category. Steps : 1, arbitrary selection of objects as K medoids (O1, O2, Ok ... ... Oi). Following is a cycle : 2, the remaining targets assigned to each category (in accordance with the closest medoid principle); 3, for each category (Oi), the order of selection of a Or, calculated Oi Or replace the consumption-E (Or))
    2005-07-26 01:32:58下载
    积分:1
  • root_locus_1
    matlab编程设计GPS中载波跟踪环路kalman滤波器的应用(matlab programmed the GPS carrier tracking loop kalman filter application)
    2014-09-22 15:51:35下载
    积分:1
  • Polyroots
    Find roots of a polynomial with very high degree and multiplicity by this compact routine.
    2010-12-14 13:05:05下载
    积分:1
  • pure_aloha_theory
    Pure aloha theory of simulation
    2011-01-12 01:00:16下载
    积分:1
  • steps-in-detail
    说明:  一个关于插值的例程,步骤详细,有详细的注释,对于通信专业的学习有用(An interpolation routine on the steps in detail, with detailed notes, learn useful for the communication professional)
    2011-04-15 17:00:03下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载