登录
首页 » matlab » STBC_MIMO_code

STBC_MIMO_code

于 2012-05-24 发布 文件大小:19KB
0 251
下载积分: 1 下载次数: 34

代码说明:

  STBC MIMO 通信的代码,模拟了不同SNR下的BER。代码中,有注释说明(STBC MIMO communication code to simulate the BER in the SNR. Code, there are explanatory notes)

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

发表评论

0 个回复

  • pnn1
    PNN神经网络聚类法的MATLAB的源代码,自己编写的,很实用,希望对大家有所帮助。(PNN neural network clustering method for MATLAB source code, I have written, very practical, we want to help.)
    2010-06-05 16:57:01下载
    积分:1
  • Wave
    说明:  《MATLAB小波分析》书本实例源程序。 希望为各位的学习带来方便!(MATLAB wavelet analysis examples of source books.I want to bring convenience to learning!)
    2009-08-13 10:57:31下载
    积分:1
  • puguji
    进行功率谱估计的许多方法的matlab程序,可以运行的(Many power spectrum estimation method matlab program, you can run)
    2014-11-21 23:21:29下载
    积分:1
  • earth-geometry
    input diameter,circumference,etc to find planet geometry
    2014-09-12 21:48:20下载
    积分:1
  • FZP离焦光强计算focus_Z
    FZP离焦光强计算 系统滴介绍了 光学计算问题(Calculation of defocus intensity)
    2021-02-05 13:59:57下载
    积分:1
  • HW1_Part1
    vào đ ay mà loafd matlab code
    2013-09-23 21:18:48下载
    积分:1
  • FSK
    数字频带通信系统 输入:首先输入模拟信号,给出此模拟信号的时域波形。 数字化:将模拟信号进行数字化,得到数字信号,可以选择PCM编码。 调制:可以选择简单的二进制数字调制方式。例如振幅键控(2ASK)、相移监控(2PSK)、频移键控(2FSK)、差分相移键控(DPSK)等。要求每个题目至少选择两种调制方式。有能力的同学也可以选择其它高效的调制方式?例如多进制数字振幅键控等?给出调制后信号的时域波形。 信道:假定信道属于加性高斯信道?或自行设计。 解调:相应的2ASK、2PSK、2FSK、DPSK解调,仿真获得解调输出波形。 PCM解码:给出解码后的模拟信号的时域波形,并与输入信号进行比较。 系统性能分析:比较在不同调制方式下,该数字频带传输系统的性能指标,即该系统的输出误码率随输入信噪比的变化曲线。(Digital frequency band communication system)
    2017-06-19 10:44:54下载
    积分:1
  • mkf_demo4
    关于卡尔曼滤波的matlab工具箱,里面有好几个,大家可以参考(Kalman filter on matlab toolbox, which has quite a few, everyone can refer to)
    2007-09-04 09:36:48下载
    积分:1
  • cost20_m
    this project s about smart antennas
    2011-01-31 13:31:37下载
    积分: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今日下载