function C = CRC_code_new(M,n,G)
%CRC code (n,k) function,每k個bit編成nbit。
%Input:
%   M:(1,x*k) input data
%   n:
%   G:generating polynomial.(1,n-k+1)
%Output:
%   C:(1,n) coded data;
len1=length(G);%len1=n-k+1 已經比n-k大1了。
k=n-len1+1;
len2=length(M);
M1=reshape(M,k,len2/k);
C1=zeros(n,len2/k);
C1(1:k,:)=M1;
%t=zeros(n-k+1,1);
%CRC 部分
GG=[];
for ii=1:len2/k
    GG=[GG,G];
end
t=C1(1:n-k+1,:);%8=n-k;eg.n-k+1=9; t為矩陣
for jj=n-k+2:n
    for ii=1:n-k+1
        GT(ii,:)=t(1,:).*GG(ii,:);
    end
    t=mod((t+GT),2);
    t=[t(2:n-k+1,:);C1(jj,:)];
end
for ii=1:n-k+1
    GT(ii,:)=t(1,:).*GG(ii,:);
end
    t=mod((t+GT),2);
    C1(k+1:n,:)=t(2:n-k+1,:);%2-9,共8位
C=reshape(C1,1,n*len2/k);