%本程序仿真GOLD码的产生
%两个n=6的m序列，其本原多项式分别为
%f(x) = x^6 + x + 1;
%g(x) = x^6 + x^5 + x^2 + x + 1;
%合成串行型特征多项式为：h(x) = x^12 + x^11 + x^8 + x^6 + x^5 + x^3 + 1;
clc;
clear;
a = [1 0 0 0 0 1 ]; %103
b = [1 1 0 0 1 1 ]; %147
c = [1 1 0 0 1 0 1 1 0 1 0 0]; %14551
%对抽头系数进行翻转
for j = 1:6
link_a(j) = a(7-j);
end;
for j = 1:6
link_b(j) = b(7-j);
end;
for j = 1:12
link_c(j) = c(13-j);
end;
%产生串联gold码
z(1,2:12)=zeros(1,11);
z(1,1) = 1;
for i=1:125
z(i+1,1) = mod(sum(and(z(i,:),link_c)),2);
for j=1:11
z(i+1, j+1)=z(i, j);
end;
end;
serial_gold_one = z(:,12)'; %初始状态为000000000001,高位在前
clear z;
z(1,3:12)=zeros(1,10);
z(1,1) = 1;
z(1,2) = 1;
for i=1:125
z(i+1,1) = mod(sum(and(z(i,:),link_c)),2);
for j=1:11
z(i+1, j+1)=z(i, j);
end;
end;
serial_gold_two = z(:,12)'; %初始状态为000000000011,高位在前
figure;
subplot(2,1,1);
stem(serial_gold_one,'b');
subplot(2,1,2);
stem(serial_gold_two,'r');
%求出2个63位的m序列
x(1,1:5)=zeros(1,5);
x(1,6) = 1;
for i=1:62
x(i+1,1) = mod(sum(and(x(i,:),link_a)),2);
for j=1:5
x(i+1, j+1)=x(i, j);
end;
end;
pn_a = x(:,6)';
y(1,1:5)=zeros(1,5);
y(1,6) = 1;
for i=1:62
y(i+1,1) = mod(sum(and(y(i,:),link_b)),2);
for j=1:5
y(i+1, j+1)=y(i, j);
end;
end;
pn_b_1 = y(:,6)'; %初始状态为100000，高位在前
clear z;
z(1,1:4)=zeros(1,4);
z(1,5:6) = 1;
for i=1:62
z(i+1,1) = mod(sum(and(z(i,:),link_b)),2);
for j=1:5
z(i+1, j+1)=z(i, j);
end;
end;
pn_b_2 = z(:,6)'; %初始状态为110000，高位在前
parallel_gold_one = xor(pn_a, pn_b_1);
parallel_gold_two = xor(pn_a,pn_b_2);
figure;
subplot(2,1,1);
stem(parallel_gold_one);
subplot(2,1,2);
stem(parallel_gold_two);
- 1
- 2
- 3
- 4
- 5
- 6
前往页