基于Matlab模拟时变瑞利衰落信道中的差分放大转发中继

✅作者简介:热爱科研的Matlab仿真开发者,修心和技术同步精进,matlab项目合作可私信。

🍎个人主页:Matlab科研工作室

🍊个人信条:格物致知。

更多Matlab仿真内容点击👇

智能优化算法       神经网络预测       雷达通信       无线传感器        电力系统

信号处理              图像处理               路径规划       元胞自动机        无人机 

⛄ 内容介绍

1 算法原理

This paper considers the performance of differential amplify-and-forward (D-AF) relaying over time-varying Rayleigh fading channels. Using the auto-regressive time-series model to characterize the time-varying nature of the wireless channels, new weights for the maximum ratio combining (MRC) of the received signals at the destination are proposed. Expression for the pair-wise error probability (PEP) is provided and used to obtain an approximation of the total average bit error probability (BEP). The obtained BEP approximation clearly shows how the system performance depends on the auto-correlation of the direct and the cascaded channels and an irreducible error floor exists at high signal-to-noise ratio (SNR). Simulation results also demonstrate that, for fast-fading channels, the new MRC weights lead to a better performance when compared to the classical combining scheme. Our analysis is verified with simulation results in different fading scenarios.

2 算法流程

Differential Amplify-and-Forward (DAF) relaying is a technique used in wireless communication systems to improve performance in time-varying Rayleigh fading channels. In DAF relaying, the relay node receives the modulated signal from the source node differentially and amplifies it before forwarding it to the destination node.

Here is a general overview of the DAF relaying process in time-varying Rayleigh fading channels:

  1. Source-to-relay transmission:

    • The source node transmits a modulated signal in the first time slot.

    • The signal experiences fading and attenuation as it propagates through the channel.

  2. Relay amplification:

    • The relay node receives the signal differentially, comparing it with a local delayed version of the received signal from the previous time slot.

    • The relay node amplifies the differentially-encoded signal to enhance its strength.

  3. Relay-to-destination transmission:

    • The relay node forwards the amplified signal to the destination node in the next time slot.

    • The signal undergoes further fading and attenuation during transmission.

  4. Destination reception:

    • The destination node receives the relayed signal and demodulates it to recover the transmitted data.

Key advantages of DAF relaying in time-varying Rayleigh fading channels include:

  1. Diversity gain: The differential encoding at the relay provides diversity gain, allowing for better performance in fading channels.

  2. Simplified processing: DAF relaying reduces the need for coherent phase and timing synchronization between the source and relay nodes.

  3. Robustness to fading variations: Differential processing mitigates the impact of channel fading variations over consecutive time slots.

It's worth noting that the specific implementation and performance of DAF relaying may vary depending on the system design, modulation scheme, fading characteristics, and other factors. Channel estimation, power control, and cooperation strategies can also be incorporated to further enhance the performance of DAF relaying in time-varying Rayleigh fading channels.

⛄ 部分代码

%% Simulation of the following paper

% M. R. Avendi and Ha H. Nguyen, "Differential Amplify-and-Forward relaying

% in time-varying Rayleigh fading channels," IEEE Wireless Communications 

% and Networking Conference (WCNC), Shanghai, China, 2013,

clc

close all

clear all

addpath('functions')

%%

% MPSK modulation

M=2;

Ns=1E5;% number of symbols

Ptot_dB=0:5:40;% SNR scan

Ptot=10.^(Ptot_dB/10);

N0=1; % noise power

% number of Relays

R=1;

% channel distance between channel uses

ch_dis=0; % for symbol-by-symbol n=R

%  scenarios

vfsd=[.001,.01,.05];

vfsr=[.001,.01,.05];

vfrd=[.001,.001,0.01];

% select the scenario

scenario=3;

% normalized Dopplers

fsd=vfsd(scenario);

fsr=vfsr(scenario);

frd=vfrd(scenario);

% auto-correlations

[alfa_sd,alfa]=auto_corr(fsd,fsr,frd,ch_dis);

% power allocation

%[P0,P1]=opt_pow(Ptot,fsd,fsr,frd,M,n);

P0=Ptot./2;

Pi=Ptot./2./R;

Ai2= Pi./(P0+N0);

% CDD power allocation

if M==2, c=.5; else c=.5; end

P0_cdd=c*Ptot;

Pi_cdd=(1-c)*Ptot./R;

Ai2_cdd= Pi_cdd./(P0_cdd+N0);

% this loop scans the SNR range

for ind=1:length(Ptot)

nbits=0;%total number of info sent

err_cdd=0;% error counter 

err_tvd=0;% error counter

clc

Ptot_dB(ind)

% this loop keeps going to get a certain amount of errors

ERR_TH=100;

while err_cdd<ERR_TH || err_tvd<ERR_TH

% info bits

xb=bits(log2(M)*Ns);

%binary  to MPSK

v=bin2mpsk(xb,M);

% DPSK modulation

s=diff_encoder(v);

Nd=length(s);

% S-D channel

hsd=flat_cos(Nd,fsd,ch_dis);

% S-R and R-D channels

for k=1:R

hsr(k,:)=flat_cos(Nd,fsr,ch_dis);

hrd(k,:)=flat_cos(Nd,frd,ch_dis);

end

% AWGN noise CN(0,N0)

z_sd=cxn(Nd,N0);

for k=1:R

z_sr(k,:)=cxn(Nd,N0);

z_rd(k,:)=cxn(Nd,N0);

end

%--------------------------------------- received signals

% CDD power allocation

y_sd_cdd=sqrt(P0_cdd(ind))*hsd.*s+z_sd;

for k=1:R

y_sr_cdd(k,:)=sqrt(P0_cdd(ind))*hsr(k,:).*s+z_sr(k,:);

y_rd_cdd(k,:)=sqrt(Ai2_cdd(ind))*hrd(k,:).*y_sr_cdd(k,:)+z_rd(k,:);

end

% propossed power allocation for time-varying

y_sd=sqrt(P0(ind))*hsd.*s+z_sd;

for k=1:R

y_sr_tvd(k,:)=sqrt(P0(ind))*hsr(k,:).*s+z_sr(k,:);

y_rd_tvd(k,:)=sqrt(Ai2(ind))*hrd(k,:).*y_sr_tvd(k,:)+z_rd(k,:);

end

% ---------------------------------------- MRC combining

% classical weights

a0_cdd=1/2;

ai_cdd=1/(1+Ai2_cdd(ind))/2;

vh_cdd=a0_cdd*diff_detector(y_sd_cdd);

for k=1:R

vh_cdd=vh_cdd+ai_cdd*diff_detector(y_rd_cdd(k,:));

end

% propossed weights for time-varying

[at1,at2]=mrc_gains(P0(ind),Ai2(ind),alfa_sd,alfa);

vh_tvd=at1*diff_detector(y_sd);

for k=1:R

vh_tvd=vh_tvd+at2*diff_detector(y_rd_tvd(k,:));

end

% selection combining

%vh2=max((diff_detector(y_sd)),(diff_detector(y_rd)));

% binary detection

bh_cdd=mpsk2bin(vh_cdd,M);

bh_tvd=mpsk2bin(vh_tvd,M);

% error count

err_cdd=err_cdd+sum(abs(xb-bh_cdd));

err_tvd=err_tvd+sum(abs(xb-bh_tvd));

nbits=log2(M)*Ns+nbits;

end

% compute practical BER 

BER_cdd(ind)=err_cdd/nbits;% coperative

BER_tvd(ind)=err_tvd/nbits;% coperative

end

% SER

Pu=Pupper(P0,Ai2,fsd,fsr,frd,M,ch_dis);

Ps=Ps_num_int(P0,Ai2,fsd,fsr,frd,M,ch_dis);

Psf=Ps_floor(fsd,fsr,frd,M,ch_dis);

% upper bound

Pb_ub=Pu./log2(M);

% theoretical bit error rate

Pb_theory=Ps./log2(M);

% error floor

Pbf=Psf/log2(M)*ones(1,length(P0));

%% plot 

lcm=['b-s';'r-o';'k:>';'g-.';'y-*'];

figure

semilogy(Ptot_dB,BER_cdd,lcm(1,:),'LineWidth',3,'MarkerSize',5);

hold on

semilogy(Ptot_dB,BER_tvd,lcm(2,:),'LineWidth',3,'MarkerSize',5);

%semilogy(Ptot_dB,Pb_ub,lcm(3,:),'LineWidth',3,'MarkerSize',5);

semilogy(Ptot_dB,Pb_theory,lcm(4,:),'LineWidth',3,'MarkerSize',5);

semilogy(Ptot_dB,Pbf,'r-.','LineWidth',3,'MarkerSize',5);

legend('CDD','TVD','Theory','Error Floor')

grid on

xlabel('P(dB)')

ylabel('BER')

⛄ 运行结果

⛄ 参考文献

M. R. Avendi and Ha H. Nguyen, "Differential Amplify-and-Forward relaying in time-varying Rayleigh fading channels," IEEE Wireless Communications and Networking Conference (WCNC), Shanghai, China, 2013,

🍅 仿真咨询

1.卷积神经网络(CNN)、LSTM、支持向量机(SVM)、最小二乘支持向量机(LSSVM)、极限学习机(ELM)、核极限学习机(KELM)、BP、RBF、宽度学习、DBN、RF、RBF、DELM实现风电预测、光伏预测、电池寿命预测、辐射源识别、交通流预测、负荷预测、股价预测、PM2.5浓度预测、电池健康状态预测、水体光学参数反演、NLOS信号识别、地铁停车精准预测、变压器故障诊断

2.图像识别、图像分割、图像检测、图像隐藏、图像配准、图像拼接、图像融合、图像增强、图像压缩感知

3.旅行商问题(TSP)、车辆路径问题(VRP、MVRP、CVRP、VRPTW等)、无人机三维路径规划、无人机协同、无人机编队、机器人路径规划、栅格地图路径规划、多式联运运输问题、车辆协同无人机路径规划

4.无人机路径规划、无人机控制、无人机编队、无人机协同、无人机任务分配

5.传感器部署优化、通信协议优化、路由优化、目标定位

6.信号识别、信号加密、信号去噪、信号增强、雷达信号处理、信号水印嵌入提取、肌电信号、脑电信号

7.生产调度、经济调度、装配线调度、充电优化、车间调度、发车优化、水库调度、三维装箱、物流选址、货位优化

8.微电网优化、无功优化、配电网重构、储能配置

9.元胞自动机交通流 人群疏散 病毒扩散 晶体生长

⛳️ 代码获取关注我

❤️部分理论引用网络文献,若有侵权联系博主删除

❤️ 关注我领取海量matlab电子书和数学建模资料

 

基于MATLAB的CDMA通信系统仿真-基于MATLAB的CDMA通信系统仿真.rar CDMA通信系统的MATLAB仿真 摘 要:在简要介绍MATLAB语言的基础上,对使用MATLAB语言仿真的CDMA通信系统进行描述。关键词:仿真;码分多址;扩频 1 仿真语言矩阵实验室(MATLAB:Matrix Laboratory)是一种以矩阵运算为基础的交互式的程序语言。与其它计算机语言相比,具有简洁和智能化程度高的特点,而且适应科技专业人员的思维方式和书写习惯,因而用其编程和调试,可以大大提高工作的效率。 目前MATLAB已经成为国际上最流行的软件之一,除了可提供传统的交互式的编程方法之外,还能提供丰富可靠的矩阵运算、图形绘制、数据处理、图像处理和方便的Windows编程工具等。因而出现了各种以MATLAB为基础的工具箱,应用于自动控制、图像信号处理、生物医学工程、语音处理、信号分析、时序分析与建模、优化设计等广泛的领域,表现出了一般高级语言难以比拟的优势。较为常见的MATLAB工具箱有:控制系统工具箱、系统辩识工具箱、多变量频率设计工具箱、分析与综合工具箱、神经网络工具箱、最优化工具箱、信号处理工具箱、模糊推理系统工具箱,以及通信工具箱等。在MATLAB通信工具箱中有SLMULINK仿真模块和MATLAB函数,形成一个运算函数和仿真模块的集合体,用来进行通信领域的研究、开发、系统设计和仿真。通信工具箱中的模块可供直接使用,并允许修改,使用起来十分方便,因而完全可以满足使用者设计和运算的需要。 MATLAB通信工具箱中的系统仿真,分为用SIMULINK模块框图进行仿真和用MATLAB函数进行的仿真两种。在用SIMULINK模块框图的仿真中,每个模块,在每个时间步长上执行一次,就是说,所有的模块在每个时间步长上同时执行。这种仿真被称为时间流的仿真。而在用MATLAB函数的仿真中,函数按照数据流的顺序依次执行,意味着所处理的数据,首先要经过一个运算阶段,然后再激活下一个阶段,这种仿真被称为数据流仿真。某些特定的应用会要求采用两种仿真方式中的一种,但无论是哪种,仿真的结果是相同的。 下面即对使用M-ATLAB语言仿真CDMA通信系统进行描述。 2 仿真框图 CDMA是指在各发送端使用不相同、相互(准)正交的地址码调制所传送的信息,而在接收端在利用码型的(准)正交性,通过相关检测,从混合信号中选出相应的信号的一种技术。实现CDMA的理论基础是扩频通信,即在发送端将待发送的数据用伪随机码进行调制,实现频谱扩展,然后进行传输,而在接收端则采用同样的编码进行解扩及相关处理,恢复原始的数据信息。扩频通信有直接序列(DS)、跳频(FH)、线性调频(chirp)、跳时(TH)等方式。采用扩频通信的优点很多,如抗干扰、抗噪声、抗多径衰落的能力强,能在低功率谱密度下工作,保密性好,可多址复用和任意选址及进行高度测量等等。因此,扩频通信作为新型的通信技术,已引起人们的特别关注,得到了迅速的发展和广泛的应用。以美国Quacomm公司为首推出的IS-95CDMA移动通信系统,以W-CDMA、CDMA2000、TD-SCD-MA为主流的第三代移动通信系统的标准化建设等,不仅确立了CDMA系统在移动通信中的稳固地位,也把扩频CDMA系统的研究、应用和发展推向了新的阶段。 本文讨论的CDMA通信系统的仿真,采用的是直扩方式,信息调制采用的是DPSK调制方式,伪随机码采用的是31位GOLD序列,仿真框图如图1所示。 matlab_dsp.JPG 更多内容,请看附件!
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

matlab科研助手

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值