压缩感知块稀疏BOMP算法

%一维测试
clear;
N=32*32;
K=2;
sort=randperm（N）;
x=zeros（N1）;
x（sort（1:K））=randn（K1）;


d=4;
subrate=0.4;
xx=zeros（N1）;
M=floor（subrate*N）-mod（floor（subrate*N）d）;                             %M: length of measurement
phi=sqrt（1/M）*randn（MN）;        %Guassian random matrix obeying the distribution N（01/M）
for i=1:N                                      %normalization for convenience of projection
    norm_v=norm（phi（:i））;
    phi（:i）=phi（:i）/norm_v;
end
y=phi*x;
r=y;                                                %residual

L=N/d;
phi_copy=phi;
A=[];                                                    %transient measurement matrix
pos_record=[];