大工至善|大学至真分享 http://blog.sciencenet.cn/u/lcj2212916

博文

[转载]【源码】SISO与MIMO系统容量的比较仿真

已有 2443 次阅读 2019-5-16 20:27 |系统分类:科研笔记|文章来源:转载


clc;close all;clear all;

%%%%%%%%%%%%%%%% Comparison Between Capacity of SISO and MIMO  %%%%%%%%%%%%

%%%%%%%%%%%%%%%%%%%%%%%%%%%%  Yousif Allbadi %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

r_M = 2; % Number of Receive Antennas of MIMO

t_M = 2; % Number of Transmit Antennas of MIMO

r_S = 1; % Number of Receive Antennas of SISO

t_S = 1; % Number of Transmit Antennas of SISO

N_M = min(r_M,t_M);

N_S = min(r_S,t_S);

H_M = zeros(r_M,t_M); % H-Matrix of Channel Coefficient of MIMO

H_S = zeros(r_S,t_S); % H-Matrix of Channel Coefficient of SISO

SNR_dB =[0:0.01:35]; % SNR in dB as a Vactor

SNR = 10.^(SNR_dB/10); % Absolute Value of SNR

for k=1:r_M

   for i=1:t_M

       H_M(k,i) = randn(1) + j* randn(1);

   end

end

for k=1:r_S

   for i=1:1

       H_S(k,i) = randn(1) + j* randn(1);

   end

end

[S V D] = svd(H_M*H_M');

[S_S V_S D_S] = svd(H_S*H_S');

Capacity_MIMO = 0;

Capacity_SISO = 0 ;

for k=1:N_M

   lamda(k) = V(k,k);

   Capacity_MIMO = Capacity_MIMO + log2(1+SNR*lamda(k)/t_M); % Capacity of MIMO

end

 for k=1:N_S

   lamda_S(k) = V_S(k,k);

   Capacity_SISO = Capacity_SISO + log2(1+SNR*lamda_S(k/t_S)); % Capacity of SISO

end

%Capacity_SISO = log2(1+SNR); % Shannon Formula

figure(1);

plot(SNR_dB,Capacity_SISO,'-','LineWidth',1.5,'Color','b');

hold on

plot(SNR_dB,Capacity_MIMO,'-','LineWidth',1.5,'Color','r');

legend('SISO','MIMO');

xlabel('SNR (dB)')

ylabel('Capacity(b/s/Hz)')

title('Comparison Between Capacity of SISO and MIMO')

grid;



源码下载地址:

http://page2.dfpan.com/fs/elcc3j5262f192b9166/ 


更多精彩文章请关注微信号:qrcode_for_gh_60b944f6c215_258.jpg



https://blog.sciencenet.cn/blog-69686-1179459.html

上一篇:[转载]【计算机科学】【2010.04】点云数据本征维数的多尺度估计与动态图的多尺度分析
下一篇:[转载]【新书推荐】【2019.02】非视距雷达
收藏 IP: 60.169.68.*| 热度|

0

该博文允许注册用户评论 请点击登录 评论 (0 个评论)

数据加载中...
扫一扫,分享此博文

Archiver|手机版|科学网 ( 京ICP备07017567号-12 )

GMT+8, 2024-9-19 07:42

Powered by ScienceNet.cn

Copyright © 2007- 中国科学报社

返回顶部