登录
首页 » matlab » alamoutibpsk1

alamoutibpsk1

于 2010-05-15 发布 文件大小:2KB
0 267
下载积分: 1 下载次数: 50

代码说明:

  Alamouti方案的仿真,双发双收,双发单收,单发多收的性能比较,信道为准静态平坦水落信道,信道噪声为高斯白噪声。(Alamouti scheme simulation, twin double income, double single income, single overcharged performance comparison, static channel subject to flat Mizuochi channel, channel noise is Gaussian white noise.)

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

发表评论

0 个回复

  • Machangle2
    使用matlab软件编写的用于计算激波角的程序,简单、易懂、好用!(Written matlab software program used to calculate the shock angle, simple, easy to understand, easy to use!)
    2012-10-26 21:17:39下载
    积分:1
  • DSP_MATLAB
    matlab非常全的编程实例,代码丰富,初学者的佳品(matlab very wide programming examples, code-rich, beginners Jiapin)
    2008-08-12 10:39:08下载
    积分:1
  • work
    采用小波变换对采集的原始信号进行去噪,并显示图像(Collected with the wavelet transform of the original signal denoising)
    2011-11-14 11:40:09下载
    积分:1
  • Biomedicin_data_anlysis
    生物医学数据分析及其matlab实现(源码与PPT),包含回归分析,时间序列分析,主成分分析,判别分析等(Biomedicine data anlysis with matlab cod)
    2014-12-16 14:09:07下载
    积分:1
  • K-meanCluster
    How the K-mean Cluster work Step 1. Begin with a decision the value of k = number of clusters Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the following: Take the first k training sample as single-element clusters Assign each of the remaining (N-k) training sample to the cluster with the nearest centroid. After each assignment, recomputed the centroid of the gaining cluster. Step 3 . Take each sample in sequence and compute its distance from the centroid of each of the clusters. If a sample is not currently in the cluster with the closest centroid, switch this sample to that cluster and update the centroid of the cluster gaining the new sample and the cluster losing the sample. Step 4 . Repeat step 3 until convergence is achieved, that is until a pass through the training sample causes no new assignments. (How the K-mean Cluster workStep 1. Begin with a decision the value of k = number of clusters Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the following: Take the first k training sample as single-element clusters Assign each of the remaining (Nk) training sample to the cluster with the nearest centroid. After each assignment, recomputed the centroid of the gaining cluster. Step 3. Take each sample in sequence and compute its distance from the centroid of each of the clusters. If a sample is not currently in the cluster with the closest centroid, switch this sample to that cluster and update the centroid of the cluster gaining the new sample and the cluster losing the sample. Step 4. Repeat step 3 until convergence is achieved, that is until a pass through the training sample causes no new assignments.)
    2007-11-15 01:49:03下载
    积分:1
  • YALMIP
    说明:  用于求解线性规划、整数规划、非线性规划、混合规划等标准优化问题以及LMI(For solving standard optimization problems such as linear programming, integer programming, non-linear programming, mixed programming and LMI)
    2019-05-13 15:05:34下载
    积分:1
  • 马氏距离法剔除异常样本可运行
    说明:  马氏距离法剔除异常数据的matlab代码(Matlab code of removing abnormal data by Mahalanobis distance method)
    2021-03-14 18:19:23下载
    积分:1
  • scripts
    Support Vector Machine
    2010-07-12 01:34:21下载
    积分:1
  • Tikonov_Regularized_Solutions_For_1D_Shaw_Problem
    1-D Shaw Problems: Finds the Tikhonov regularized solutions (L = I) for a variety of choices for alpha and generates a waterfall plot of the results
    2009-04-28 14:03:26下载
    积分:1
  • AMI
    产生AMI码,并求其功率谱密度和时域波形。 (AMI generated code, and for its power spectral density and time-domain waveform.)
    2008-05-10 10:59:55下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载