mchuli.m

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

function dsum=dlay(Ap,M,dl,w);
a=[];M=[0,M]
n=length(M);
for k=1:n
        if(w>M(k)&w<=M(k+1))
              for l=k:1
                    ds=(Ap(i)+2*(l-1)*pi)/dl(i);
                    a=[a,ds];
                    s=n-k;
                    a=[a,zeros(1,s)];
                end
            end
        end
 dsum=a;