untitled2.m

本次的算法是相位周期展开聚类

[dmax,imax]=max(b);
s=zeros(dmax,6);
for m=1:128
for n=1:6
if(sun(m,n)>=b(imax)&sun(m,n)<b(imax))
    s=sun(m,:);
    end
end
end
end
b=zeros(1,ceil(max(M));
c=[];
for n=fix(min(M):ceil(max(M))
c=[c,n];
end   
for m=1:length(M)
    for n=fix(min(M):ceil(max(M))
        if (M(m)>=c(n)&M(m<c(n)+1)
            b(n)=b(n)+1;
        end
    end
end
t=(s(i,1)*wp(i)-s((i+1),1)*wp(i+1))/(wp(i))-(wp(i+1));