In compressed sensing theory,dividing signals into blocks can effectively reduce data processing requirements and improve signal reconstruction speed.Therefore,the stable recovery of block sparse signals has been widely studied in recent years.In this paper,we examine the stopping iteration criterion for stable recovery of block sparse signals using the Block generalized Orthogonal Matching Pursuit(BgOMP)algorithm when l∞ bound noise and discuss recovery errors;furthermore we get the boundedness results of nonzero blocks generated by the iteration.
万方数据