m_sequence.m

已知本原多项式

m=5;
connections=[0 0 1 0 1];
N=2^m-1;                                           %length of the shift register sequence requested
registers=[1 zeros(1,m-1)];                        %initial register contents
%************** generalize N*m M_sequences************
for i=1:N
    seq(i,:)=registers;
    new_reg_cont(1)=xor(registers(m),registers(m-2));
    for j=2:m
        new_reg_cont(j)=registers(j-1);
    end;
    registers=new_reg_cont;                      %current register contents
end;
seq 
%********transmit N*m seq into one dimenision vectors b*****
for i=1:N
     for j=1:m
          b((i-1)*m+j) = seq(i,j);
     end
 end  
b(1:N*m);

 %****************find the number of gcd(f,N+1)=1***********
 j=1;
 for i=2:N
     if gcd(i,32)==1
            f_prime(j)=i;
            j=j+1;
  end
end
 f_prime;
%************************Sampling to generate all cyclically distinct m-sequences 
 f_prime_length=j-1
 for i=1:f_prime_length
      a=f_prime(i);
     for j=1:N
        samp_output(i,j)=b(mod(a*j,N+1));
     end;
  end;
samp_output
%N*m M_sequences