test.m

LDPC中的q进制编码算法

rand('state',sum(100*clock));
randn('state',sum(100*clock));

load PEGirReg504x1008.mat

[rows cols]=size(newH);

f=find(newH(:,cols)==1);
Tsize=f(1);
g=rows-Tsize;
Acols=cols-rows;

A=full(newH(1:Tsize, 1:Acols));
B=full(newH(1:Tsize, Acols+1:Acols+g));
T=full(newH(1:Tsize, Acols+g+1:cols));
InvT=qinv_GF2(T);
%因为先进行了转置，所以下标j在前面
[psm1j psm1i]=find((newH(1:Tsize, :)')~=0);

s=round(rand(1,Acols));

p1=mul_GF2(Gp1, s');

tic
for i=1:10000
u1=ldpcqenc(psm1j', [s p1'], cols);
end
toc

tic
for i=1:10000
p2=mul_GF2(InvT, add_GF2(mul_GF2(A, s'), mul_GF2(B, p1)));
u2=[s p1' p2'];
end
toc
%下面所用时间是上面用c改写并使用迭代计算方法时间的27倍

u(rearranged_cols)=u1;