Skip to main content

Table 6 The computation cost of the t th iteration in DCS-SOMP

From: Robust reconstruction algorithm for compressed sensing in Gaussian noise environment using orthogonal matching pursuit with partially known support and random subsampling

Step

The number of multiplication

The number ofâ„“ 2 optimization

(1) λ t = arg max j = 1 , . . . , N ∑ l = 1 L r l , t - 1 , φ j .

LpM(N-t+1)

-

(2) a t = Φ t z t

LpMt

-

(3) z t = arg min z ||y-Φ t zt-1||2

-

L(â„“2 optimization for t variables)

Total

Lp(MN+M)

L(â„“2 optimization for t variables)