pseudo.asv

来自「尽量不要让站长把时间都花费在为您修正说明上。压缩包解压时不能有密码。」· ASV 代码 · 共 39 行

function c = pseudo(x1,x2,Nc)

% Pseudo-random sequences c(i) generation ,which is defined by
%                   c(n)=(x1(n+Nc)+x2(n+Nc))mod2, where Nc=1600
%                   x1(n+31)=(x1(n+3)+x1(n))mod2,shall be initialized with x1(0)=1,x1(n)=0,n=1,2,...,30; 
%                   x2(n+31)=(x1(n+3)+x1(n))mod2,shall be initialized with c_init=n_RNTI*2^14+floor(Ns/2)*2^9+N_id;
%                   set n_RNTI=2,Ns=2,N_id=0;                                     
Nc = 1600;
numbits = 168;
x1(1) = 1;       % --------------------
               % sequence x1 initializition
for i = 2:31     % x1(0)=1,x1(n)=0,n=1,2,...,30;
    x1(i) = 0;    
end            %----------------------

for i = 1:(Nc + numbits - 31)                   % generate sequence x1
    x1(i+31) = mod((x1(i + 3) + x1(i)),2);
end
for j = 1:8
    x2(j) = 0;
end

x2(9) = 1;      % ------------------------
for j = 10:13   % sequence x2 initializition
    x2(j) = 0;  % x2(m)=0,m=1,...,8; x2(9)=1;x2(n)=0,n=10,...,13;x2(14)=1;x2(p)=0,p=15,...,31;
end           
x2(14)=1;
for j=15:31
    x2(j)=0;
end          %---------------------------

for i=1:(Nc+numbits-31)                  % generate sequence x1
    x2(i+31)=mod((x2(i+3)+x2(i+2)+x2(i+1)+x2(i)),2);
end


for i=1:numbits                           % generate Pseudo-random sequences c(i)
    c(i)=mod((x1(i+Nc)+x2(i+Nc)),2);
end