function?[?theta?]?=?CS_SAMP（?yAS?）
%CS_SAMP?Summary?of?this?function?goes?here
%Version:?1.0?written?by?jbb0523?@2015-05-08
%???Detailed?explanation?goes?here
%???y?=?Phi?*?x
%???x?=?Psi?*?theta
%	y?=?Phi*Psi?*?theta
%???令?A?=?Phi*Psi?則y=A*theta
%???現在已知y和A，求theta
%???Reference:Thong?T.Do，Lu?Gan，Nam?Nguyen，Trac?D.Tran．Sparsity?adaptive
%???matching?pursuit?algorithm?for?practical?compressed?sensing[C]．Asilomar
%???Conference?on?Signals，Systems，and?Computers，Pacific?Grove，California，
%???2008，10：581-587.
%???Available?at:
%???http://dsp.rice.edu/sites/dsp.rice.edu/files/cs/asilomar08_final.pdf
????[y_rowsy_columns]?=?size（y）;
????if?y_rows????????y?=?y‘;%y?should?be?a?column?vector
????end
????[MN]?=?size（A）;%傳感矩陣A為M*N矩陣
????theta?=?zeros（N1）;%用來存儲恢復的theta（列向量）
????Pos_theta?=?[];%用來迭代過程中存儲A被選擇的列序號
????r_n?=?y;%初始化殘差（residual）為y
????L?=?S;%初始化步長（Size?of?the?finalist?in?the?first?stage）
????Stage?=?1;%初始化Stage
????IterMax?=?M;
????for?ii=1:IterMax%最多迭代M次
????????%（1）Preliminary?Test
????????product?=?A‘*r_n;%傳感矩陣A各列與殘差的內積
????????[valpos]=sort（abs（product）‘descend‘）;%降序排列
????????Sk?=?pos（1:L）;%選出最大的L個
????????%（2）Make?Candidate?List
????????C