MU-MIMO有意思的用户配对/调度

Posted 2022-12-03 飞凡可期

简单compare相关性来逐个选取

R = V1*V2’；
ui = smallest®;

code

%MU_MIMO_Schedule.m MU配对逻辑
% core: smallest relative users schedule together; R = V1V2', min norm_f(R)
% 1 find strong user0; 2 find smallest relative R(Sta0,Sta1); 3 find
% samllest relative R(Sta(n-1), Sta(n))； 4 End

M = 11; % users number
N = 4; % select user; suppose user0 the strong user
m = 4; n = 2;

V = ;
for ii = 1:M
   Vend+1 = (randn(m,n) + 1j*randn(m,n))/sqrt(2);
end

Idx = [1];
R = [];
Rv = [];
for ii = 1:(N-1)
    Rtmp = [];
   for jj = 1:M 
       Rtmp(end+1) =  norm( V Idx(end) * conj(Vjj'), 'fro');
   end
   R  = [R; Rtmp];
   Rtmp(Idx) = 100;
   [a,b] = min(Rtmp);
   Idx(end+1) = b;
   Rv(end+1) = Rtmp(b);
end
Idx
Rv
% function V = GenV(m,n)
% sq2 = 1/sqrt(2);   
% V = sq2*(randn(m,n) + 1j*randn(m,n));
% end

% function R = Relat(V1,V2)
% R1 = V1*conj(V2');
% end