viterbiinit.m

卷积码的Viterbi译码算法仿真程序 要求：递归卷积码

function  ViterbiInit

global  state_num;
global  memory_len;
global  state_inbits;
global  state_outbits1;
global  state_outbits2;



G=[1 1 1 1 1;1 0 0 0 1];%生成矩阵(RSC)

memory_len=4;
state_num=2^memory_len;

state_inbits=zeros(state_num,state_num);
state_outbits1=zeros(state_num,state_num);
state_outbits2=zeros(state_num,state_num);

mem=zeros(1,memory_len);
for s1=0:state_num-1
    for in=0:1
        mem=de2bi(s1,memory_len);
        net_in=xor(xor(xor(xor(mem(1),mem(2)),mem(3)),mem(4)),in);
        s2=bi2de([mem(2) mem(3) mem(4) net_in]);
        state_inbits(s1+1,s2+1)=2*in-1;
        state_outbits1(s1+1,s2+1)=2*in-1;
        state_outbits2(s1+1,s2+1)=2*xor(net_in,mem(1))-1;
    end
end

%state_inbits
%state_outbits1
%state_outbits2