資源簡介
研究有限反饋下基于博弈論的聯合功率分配與反饋速率控制優化問題。通過建立新的博弈模型,證明了其納什均衡的存在性。同時,根據功率與反饋速率的關系,提出了一種迭代算法,可快速收斂到博弈不動點。仿真結果表明,聯合優化算法的性能優于單單考慮反饋速率的算法。
代碼片段和文件信息
clc?;
clear?all;
Nt=4;
Iter=100;???????%迭代次數
Ith_0=1.5;??????%沒有反饋的干擾門限?1.5W
P_p=1;??????????%主用戶的發射功率1W
PT=2;???????????%認知用戶的額定發射功率
T=1;????????????%塊衰落時間1S
Bn=0.01?????????%背景噪聲
sinr_r=0;???????%認知用戶的信干比門限
lamti=0:0.01:1;?%波束成形變化的步長
L=length(lamti);
Nt=4;
h_1=random(‘rayleigh‘11Nt);??%認知用戶SU1信道信息
h_2=random(‘rayleigh‘11Nt);
h_3=random(‘rayleigh‘11Nt);
h_4=random(‘rayleigh‘11Nt);
hp=random(‘rayleigh‘11Nt);???%主用戶的信道信息
h1_gain=norm(h_1);??????????????%認知用戶SU1的信道增益
h2_gain=norm(h_2);
h3_gain=norm(h_3);
h4_gain=norm(h_4);
%%主用戶不同量化比特數下,主用戶的干擾門限
%%認知用戶在主用戶不同的反饋速率干擾溫度余量
for?n=1:1:11;???????%量化比特數
????n=n-1;
Rf=n*Nt/T;??????%反饋速率
Ith_n(n+1)=P_p/(2^Rf*((Ith_0+P_p)/Ith_0)-1);?????%不同量化比特下,主用戶的干擾門限
D(n+1)=Nt/(3*4^n);???????????????????????????????%信道
?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----
?????文件????????7430??2020-10-26?09:47??1\disanzhang.m
?????文件????????6616??2020-10-26?09:47??1\disizhang.asv
?????文件????????6615??2020-10-26?09:47??1\disizhang.m
?????文件???????10576??2020-10-26?09:47??1\disizhang1.asv
?????文件???????17691??2020-10-26?09:47??1\disizhang1.fig
?????文件????????9627??2020-10-26?09:47??1\disizhang1.m
?????文件????????9773??2020-10-26?09:47??1\disizhang2.fig
?????文件????????8883??2020-10-26?09:47??1\disizhang3.fig
?????文件????????7346??2020-10-26?09:47??1\diwuzhang1.asv
?????文件????????7346??2020-10-26?09:47??1\diwuzhang1.m
?????文件??????????89??2020-10-26?09:47??1\extremun.m
?????文件?????????191??2020-10-26?09:47??1\feeback_rate.m
?????文件?????????128??2020-10-26?09:47??1\rongiang_game_waterfilling.asv
?????文件?????????134??2020-10-26?09:47??1\rongiang_game_waterfilling.m
?????文件?????????103??2020-10-26?09:47??1\rongliang.asv
?????文件?????????103??2020-10-26?09:47??1\rongliang.m
?????文件?????????112??2020-10-26?09:47??1\sulvfenpei.m
評論
共有 條評論