马尔可夫过程_srtp论文(22)

数学建模,马尔科夫链,论文

Z(i)=1;

elseif data(i)>=395 & data(i)<485 Z(i)=2;

elseif data(i)>=575 & data(i)<665 Z(i)=3; else Z(i)=4; end end

P1=zeros(4);F1=zeros(4); %P1,P2,P3,P4分别为1、2、3、4步状态转移概率矩阵 P2=zeros(4);F2=zeros(4); %F1,F2,F3,F4分别为1、2、3、4步频数转移矩阵 P3=zeros(4);F3=zeros(4); P4=zeros(4);F4=zeros(4);

for i=1:length(Z)-1 %计算1步转移频数矩阵F1 switch Z(i) case 1

switch Z(i+1) case 1

F1(1,1)=F1(1,1)+1; case 2

F1(1,2)=F1(1,2)+1; case 3

F1(1,3)=F1(1,3)+1; case 4

F1(1,4)=F1(1,4)+1; end case 2

switch Z(i+1) case 1

F1(2,1)=F1(2,1)+1; case 2

F1(2,2)=F1(2,2)+1; case 3

F1(2,3)=F1(2,3)+1; case 4

F1(2,4)=F1(2,4)+1; end case 3

switch Z(i+1) case 1

F1(3,1)=F1(3,1)+1; case 2

F1(3,2)=F1(3,2)+1; case 3

F1(3,3)=F1(3,3)+1;