一、交织与解交织概述
二、交织原理
Matlab程序:生成m序列
注:函数的第一个参数是以向量形式表示的本原多项式,第二个参数是以向量形式表示的初相。
function [m_Sequence] = Linear_Feedback_Shift_Register(Primitive_Polynomial,Initial_Phase)
n = length(Primitive_Polynomial);
N = (2^n)-1;
m_Sequence = zeros(1,N);
register = Initial_Phase;
new_register = zeros(1,n);
for i=2:N+1
new_register(1) = mod(sum(Primitive_Polynomial.*register),2);
for j=2:n
new_register(j) = register(j-1);
end
register = new_register;
m_Sequence(i-1)=bin2dec(num2str(register));
end
end
Matlab程序:利用m序列生成交织映射与解交织映射
以本原多项式为x^15+x^14+1,初相为“101110001111010”(高位在左)为例,下述代码给出了交织和解交织的地址映射序列,address_map是交织映射,address_demap是解交织映射。
其中,address_num是需要映射的地址总数,它需小于等于m序列的周期,否则需要改变本原多项式的阶数。另外,改变初相只能改变m序列的初始相位,不能改变其序列的排列顺序。当本原多项式一定时,不同初相生成的m序列之间只是循环移位的关系。
clc,clear,close all;
address_num=20000;
Primitive_Polynomial=[0 0 0 0 0 0 0 0 0 0 0 0 0 1 1];
Initial_Phase=[0 1 0 1 1 1 1 0 0 0 1 1 1 0 1];
[m_Sequence] = Linear_Feedback_Shift_Register(Primitive_Polynomial,Initial_Phase);
address_map=zeros(1,address_num);
address_demap=zeros(1,address_num);
j=1;
for i=1:length(m_Sequence)
if(m_Sequence(i)<=address_num)
address_map(j)=m_Sequence(i)-1;
j=j+1;
end
end
for i=1:address_num
address_demap(address_map(i)+1)=i-1;
end