登录
首页 » matlab » Hard_decision_demapping_8PSK

Hard_decision_demapping_8PSK

于 2009-08-10 发布 文件大小:1KB
0 88
下载积分: 1 下载次数: 34

代码说明:

  Demapping 8PSK : LLR computation using Euclidian distance approach, Parallel-to-Serial converter, Hard decision, needs I and Q componets of 8PSK symbols at the input

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

发表评论

0 个回复

  • LinkLayerModelMATLAB
    Link Layer Model in MATLAB consisting files: inputFile.m, LinkLayerModel.m, Q.m, topologyFile.m
    2009-04-01 12:33:29下载
    积分:1
  • Fisher
    说明:  用MATLAB做的Fisher线性分类器,处理脑电信号,数据为bci竞赛数据(MATLAB to do with Fisher linear classifier, EEG signal processing, data race data for the bci)
    2020-09-19 23:57:54下载
    积分:1
  • SIMPLE-suanfa
    Simple迭代算法模型,可作为模块直接用于需要利用simple迭代的计算(Simple iterative algorithm model, or as a module for the need to use a simple iterative calculation)
    2012-04-07 01:48:18下载
    积分:1
  • nne_smlk
    neural network similation fot load flow studies
    2013-04-13 19:09:32下载
    积分:1
  • RSA
    this program is cryptosystem use RSA
    2015-02-08 09:12:02下载
    积分:1
  • PCA
    PCA。基于PCA和K-means分类的锋电位分类方法。(the way is used to classify spikes with PCA and K-means.)
    2012-11-12 10:23:10下载
    积分:1
  • Tank1
    说明:  主要运用gui的控件来进行调整数值,可以进行绘图功能(primarily use the controls to adjust values can be graphics)
    2006-05-15 23:42:52下载
    积分:1
  • Mppt_sfunction
    利用扰动观察法实现光伏电池的最大功率点的跟踪(Perturbation and observation method using photovoltaic cells to achieve maximum power point tracking)
    2011-05-24 15:54:13下载
    积分:1
  • BRAIN0829
    一個能夠讀取eeg2000機型的matlab程式(One can read eeg2000 models matlab program)
    2013-08-26 20:49:08下载
    积分:1
  • Floyd
    Floyd算法的matlab实现。对输入的邻接距离矩阵计算图中任意两点间的最短距离矩阵和路由矩阵,且能查询任意两点间的最短距离和路由。并根据结果自动绘制出了最短路径图。 程序中使用了前向路由和回溯路由两种方法,并对于无向图进一步减小算法复杂度。(Matlab implementation of the Floyd algorithm. Adjacent input distance matrix between any two points in calculating the figure, the shortest distance matrix and routing matrix, and can query the shortest distance between any two points and routing. Automatically based on the results map out the shortest path graph. Used in the program prior to routing and backward routing are two methods, and undirected graph further reduce the algorithm complexity.)
    2012-07-23 10:28:52下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载